A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anonymous

  • 5 years ago

solve the Diophantine equations: 30x +47y = -11 and 102x + 1001y = 1

  • This Question is Closed
  1. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    \[x=1843/4206\] \[y=-91890/2143\]

  2. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    For the equation 102x + 1001y = 1, you know that the gcd of 102 and 1001 is 1. Therefore, there is some linear combination of 102 and 1001 that adds to 1. Use the Euclidean Algorithm to find the coefficients m, n so that 102 n + 1001 m = 1. Once you find that m and n, note that you can generate an infinite set of solutions by noting: 102 (n + 1001) + 1001 (m - 102) = 1 is always a true statement if n and m is a solution to 102 n + 1001 m = 1. Also, 102 (n + 2*1001) + 1001 (m - 2*102) = 1 is true. 102 (n + 1001k) + 1001 (m - 102)k = 1 for any integer k is true as well. So we have an infinite set of solutions based on our initial solution given by the Euclidean algorithm to find the gcd of two numbers. For 30x + 47 y = -11, the same idea holds. We know that gcd)30, 47) = 1. If we can find two numbers m, n such that 30m + 47n = 1, then we can multiply both of those by -11 to get 30 M + 47N = -11. And then we can form an infinite set of solutions by noting that 30 (M + 47k) + 47(N - 30k) = -11 would always be a true statement.

  3. anonymous
    • 5 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    For the equation 102x + 1001y = 1, you know that the gcd of 102 and 1001 is 1. Therefore, there is some linear combination of 102 and 1001 that adds to 1. Use the Euclidean Algorithm to find the coefficients m, n so that 102 n + 1001 m = 1. Once you find that m and n, note that you can generate an infinite set of solutions by noting: 102 (n + 1001) + 1001 (m - 102) = 1 is always a true statement if n and m is a solution to 102 n + 1001 m = 1. Also, 102 (n + 2*1001) + 1001 (m - 2*102) = 1 is true. 102 (n + 1001k) + 1001 (m - 102)k = 1 for any integer k is true as well. So we have an infinite set of solutions based on our initial solution given by the Euclidean algorithm to find the gcd of two numbers. For 30x + 47 y = -11, the same idea holds. We know that gcd)30, 47) = 1. If we can find two numbers m, n such that 30m + 47n = 1, then we can multiply both of those by -11 to get 30 M + 47N = -11. And then we can form an infinite set of solutions by noting that 30 (M + 47k) + 47(N - 30k) = -11 would always be a true statement.

  4. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.