Proving No Integers Exist: a^n + b^n

  • Thread starter halvizo1031
  • Start date
  • Tags
    Integers
In summary: In other words, (a^n - b^n) divides (a^n + b^n), or (a^n + b^n) is a multiple of (a^n - b^n). In summary, the conversation is discussing the proof that there are no integers a,b,n>1 such that (a^n - b^n) divides (a^n + b^n). The suggested approach is to use a contradiction, showing that the greatest common divisor of (a^n - b^n) and (a^n + b^n) must be either 1 or 2, making it impossible for (a^n - b^n) to divide (a^n + b^n). The speaker also acknowledges that they are not an expert in number theory, so their
  • #1
halvizo1031
78
0

Homework Statement



Prove that they are no integers a,b,n>1 such that (a^n - b^n) | (a^n + b^n).

Homework Equations





The Attempt at a Solution


Do I solve this by contradiction? If so, how do I start it?
 
Physics news on Phys.org
  • #2
I think it is by contradiction (i suppose you could show the gcd of [itex] (a^n - b^n , a^n + b^n ) [/itex] is 1 or 2 ) viz,
let d be the gcd clearly then , d must divide the sum (and the difference) of the two , [tex] d | a^n + b^n + a^n - b^n [/tex]
[tex] d | 2a^n [/tex]
which implies, [itex] d|2, [/itex] [itex] d|a^n [/itex] this last result shows d is either 1 or 2 , thus if the gcd of the two is 2 or 1, no integers a,b, c >1 can exist to satisfy the requirement (there are no numbers a,b, c> 1 that can divide in that manner) though I am only into number theory as a hobby, i might not be quite on the mark, ;-) ,
good luck
 
Last edited:
  • #3
Mechdude said:
I think it is by contradiction (i suppose you could show the gcd of [itex] (a^n - b^n , a^n + b^n ) [/itex] is 1 or 2 ) viz,
let d be the gcd clearly then , d must divide the sum (and the difference) of the two , [tex] d | a^n + b^n + a^n - b^n [/tex]
[tex] d | 2a^n [/tex]
which implies, [itex] d|2, [/itex] [itex] d|a^n [/itex] this last result shows d is either 1 or 2 , thus if the gcd of the two is 2 or 1, no integers a,b, c >1 can exist to satisfy the requirement (there are no numbers a,b, c> 1 that can divide in that manner) though I am only into number theory as a hobby, i might not be quite on the mark, ;-) ,
good luck


I consulted with my study partners and we agree that what you have is correct. But we didn't get exactly what you got so we had to make some corrections. thanks for your help.
 
  • #4
(a^n - b^n) | (a^n + b^n)

what does that mean?? does the bar symbol mean "given"
 
  • #5
frustr8photon said:
(a^n - b^n) | (a^n + b^n)

what does that mean?? does the bar symbol mean "given"

The bar symbol means "divides" in the sense of integer divisibility.
 
Last edited:

1. What does it mean to prove that no integers exist?

In mathematics, proving that no integers exist means showing that there are no whole numbers that satisfy a certain condition or equation. In other words, there are no solutions to the equation that involve only whole numbers.

2. How can you prove that no integers exist for a specific equation, such as a^n + b^n?

Proving that no integers exist for a specific equation usually involves using techniques from number theory and algebra. One common approach is to use proof by contradiction, assuming that there are integers that satisfy the equation and then showing that this leads to a contradiction.

3. What is the significance of proving that no integers exist?

Proving that no integers exist for a certain equation or condition can have important implications in mathematics. It can help to establish the boundaries of what is possible and impossible in terms of number relationships, and can also lead to important insights and discoveries in related areas of research.

4. Is it possible to prove that no integers exist for all equations?

No, it is not possible to prove that no integers exist for all equations. This is because there are an infinite number of equations and it is impossible to test every single one. However, it is possible to prove that no integers exist for a specific equation or a certain class of equations.

5. Can proving that no integers exist for an equation be done using computational methods?

While computational methods can be helpful in exploring and testing equations, they are not always sufficient to prove that no integers exist. Proving this requires rigorous mathematical reasoning and proof techniques, which may involve more advanced concepts and theories.

Similar threads

  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
30
Views
2K
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
13
Views
2K
  • Calculus and Beyond Homework Help
Replies
12
Views
855
  • Calculus and Beyond Homework Help
Replies
6
Views
928
  • Calculus and Beyond Homework Help
Replies
5
Views
2K
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
16
Views
4K
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
Back
Top