Fermat's/Euler Problem: Proving Equivalence Modulo pq and ab

  • Thread starter pacdude9
  • Start date
In summary, the conversation discusses two problems that involve proving equations using modular arithmetic. The first problem involves proving the equation p^{(q-1)} + q^{(p-1)} \equiv 1 \; (\!\!\!\!\!\! \mod \, pq) and the second problem involves proving a^{\phi(b)} + b^{\phi(a)} \equiv 1 \; (\!\!\!\!\!\! \mod \, ab) where \phi(n) is Euler's Totient Function. It is noted that these two problems are similar as the second one uses Euler's Theorem, a generalization of Fermat's Little Theorem. The conversation then gives a hint for solving the first problem by
  • #1
pacdude9
4
0
I've got a pair of (related) problems that are keeping me stumped. The two problems they are asking me to prove are:

[tex] p^{(q-1)} + q^{(p - 1)} \equiv 1 \; (\!\!\!\!\!\! \mod \, pq) [/tex]

[tex]a^{\phi(b)} + b^{\phi(a)} \equiv 1
\; (\!\!\!\!\!\! \mod \, ab)[/tex]

Where [tex] \phi(n) [/tex] is Euler's Totient Function.

I know that these are similar, as the second problem is using Euler's Theorem, a generalization of Fermat's Little Theorem, I just can't seem to figure them out.
 
Physics news on Phys.org
  • #2
for the first one, see if this helps...

By Fermat's Theorem (assuming that p and p are relatively prime...) we have
[tex]q^p=q [/tex]mod [tex]p [/tex]. We can cancel q from both sides since gcd(q,p) = 1, so [tex]q^{(p-1)} = 1 (mod p)[/tex]. Also [tex] p^{(q-1)} = 0 (mod p) [/tex] we get

[tex]p^{(q-1)} + q^{(p-1)} = 1 (mod p) [/tex]

can you go from there?
 
Last edited:

Related to Fermat's/Euler Problem: Proving Equivalence Modulo pq and ab

1. What is Fermat's/Euler problem?

Fermat's/Euler problem is a mathematical problem that asks for the solution to the equation a^n + b^n = c^n for values of n greater than 2. It was first posed by Pierre de Fermat in the 17th century and was later solved by Leonhard Euler in the 18th century. The problem has since been extended to include various other conditions and constraints, making it a famous and challenging mathematical problem.

2. Why is Fermat's/Euler problem important?

Fermat's/Euler problem is important because it has sparked a lot of interest and research in the field of mathematics. It has also led to the development of new mathematical concepts and techniques, such as the use of modular arithmetic and elliptic curves. Additionally, it has practical applications in fields such as cryptography and computer science.

3. Has Fermat's/Euler problem been solved?

Yes, Fermat's/Euler problem has been solved for values of n greater than 2. However, there are still many variations and extensions of the problem that have yet to be solved.

4. What is the difference between Fermat's and Euler's solutions to the problem?

Fermat's solution to the problem was only applicable for n=4, while Euler's solution was more general and could be applied to any value of n greater than 2. Additionally, Fermat's solution involved a mistake, which was later corrected by Euler.

5. Are there any real-world applications of Fermat's/Euler problem?

Yes, there are real-world applications of Fermat's/Euler problem, particularly in the field of cryptography. The problem has also been used to test the accuracy and efficiency of computer algorithms and software. Additionally, the techniques used to solve the problem have been applied to other mathematical problems and have contributed to the advancement of mathematics as a whole.

Similar threads

  • Calculus and Beyond Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
976
  • Calculus and Beyond Homework Help
Replies
16
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
1K
Replies
13
Views
2K
  • Introductory Physics Homework Help
Replies
15
Views
338
  • Calculus and Beyond Homework Help
Replies
4
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
4K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
Back
Top