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

  • Thread starter Thread starter halvizo1031
  • Start date Start date
  • Tags Tags
    Integers
Click For Summary
SUMMARY

The discussion centers on proving that there are no integers a, b, n > 1 such that (a^n - b^n) divides (a^n + b^n). Participants agree that the proof can be approached through contradiction by examining the greatest common divisor (gcd) of the two expressions. It is established that if d is the gcd, then d must divide both expressions, leading to the conclusion that d can only be 1 or 2. Therefore, no integers a, b, n > 1 can satisfy the condition.

PREREQUISITES
  • Understanding of integer divisibility and the notation (|)
  • Familiarity with the concept of greatest common divisor (gcd)
  • Basic knowledge of number theory, particularly properties of exponents
  • Experience with proof techniques, especially proof by contradiction
NEXT STEPS
  • Study the properties of gcd and its applications in number theory
  • Learn about proof by contradiction and its effectiveness in mathematical arguments
  • Explore the implications of Fermat's Last Theorem in relation to integer solutions
  • Investigate integer factorization and its relevance to divisibility
USEFUL FOR

Mathematics students, number theorists, and anyone interested in advanced proof techniques and integer properties.

halvizo1031
Messages
77
Reaction score
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
I think it is by contradiction (i suppose you could show the gcd of (a^n - b^n , a^n + b^n ) is 1 or 2 ) viz,
let d be the gcd clearly then , d must divide the sum (and the difference) of the two , d | a^n + b^n + a^n - b^n
d | 2a^n
which implies, d|2, d|a^n 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:
Mechdude said:
I think it is by contradiction (i suppose you could show the gcd of (a^n - b^n , a^n + b^n ) is 1 or 2 ) viz,
let d be the gcd clearly then , d must divide the sum (and the difference) of the two , d | a^n + b^n + a^n - b^n
d | 2a^n
which implies, d|2, d|a^n 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.
 
(a^n - b^n) | (a^n + b^n)

what does that mean?? does the bar symbol mean "given"
 
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:

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
Replies
20
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 30 ·
2
Replies
30
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
12
Views
2K
  • · Replies 16 ·
Replies
16
Views
5K
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K