How can the GCD of two numbers equaling 1 help find solutions for n and m?

  • Thread starter cloveryeah
  • Start date
  • Tags
    Combination
In summary, the conversation discusses finding the values of n and m for the equation 1007n+1703m=1 when n and m are integers. It is stated that the GCD of 1007 and 1703 is 1, making it possible to find n and m. The use of modular multiplicative inverse is suggested, but the person is unsure how to apply it. The solution is hinted at by asking how it is known that it is possible to find n and m, and suggesting that most proofs of this result are constructive.
  • #1
cloveryeah
26
0

Homework Statement


1007n+1703m=1 when n and m are integers

Homework Equations

The Attempt at a Solution


i hv tried for so many times, but i can't find it
the GCD of 1007 and 1703 is 1, so it is possible to find n and m
 
Physics news on Phys.org
  • #3
so that must have an ans, right?

but how to use the info given by the above link?
 
  • #4
It would help a lot if you would show what you have tried and where you had problems.
 
  • #5
cloveryeah said:

Homework Statement


1007n+1703m=1 when n and m are integers

Homework Equations

The Attempt at a Solution


i hv tried for so many times, but i can't find it
the GCD of 1007 and 1703 is 1, so it is possible to find n and m

HInt: when you say "the GCD of 1007 and 1703 is 1, so it is possible to find n and m", how do you know that?

Most proofs of that result that I have seen are constructive, which means that they prove the result by producing ##n## and ##m## that actually solve the problem.
 
Last edited:

FAQ: How can the GCD of two numbers equaling 1 help find solutions for n and m?

What is the purpose of finding a combination of n and m?

The purpose of finding a combination of n and m is to determine the number of possible arrangements or selections of objects from a set of n objects, taking m objects at a time. This can help in solving various mathematical and scientific problems, such as probability calculations, counting permutations and combinations, and optimizing experimental designs.

How do you find a combination of n and m?

To find a combination of n and m, you can use the formula n! / (m!(n-m)!), where n is the total number of objects and m is the number of objects being selected. This formula is also known as the combination formula. Alternatively, you can use a combination calculator or a computer program to quickly calculate the combination.

What is the difference between a combination and a permutation?

A combination is an arrangement of objects where the order of the objects does not matter, whereas a permutation is an arrangement where the order does matter. In other words, combinations are selections without replacement, while permutations are selections with replacement. For example, selecting three different fruits from a basket would be a combination, while selecting three fruits in a specific order would be a permutation.

Can you find a combination of n and m with repeating elements?

No, the formula for combinations n! / (m!(n-m)!) only works for selecting distinct objects. If there are repeating elements, you would need to adjust the formula accordingly. For example, if there are n total objects with x identical elements, the formula would be n! / (x!(m-x)!(n-m)!).

In what fields is finding a combination of n and m commonly used?

Finding a combination of n and m is commonly used in various fields such as mathematics, statistics, computer science, chemistry, and genetics. It is used to model real-world situations, make predictions, and solve problems. For example, in genetics, combinations are used to calculate the number of possible genotypes and phenotypes in a population.

Similar threads

Back
Top