The problem involves proving that there are no integers \(a\), \(b\), and \(n\) greater than 1 such that \((a^n - b^n)\) divides \((a^n + b^n)\). The subject area pertains to number theory, specifically exploring properties of divisibility.
Some participants have offered insights into the gcd approach and its implications, while others are seeking clarification on the notation used in the problem. There is an ongoing exploration of the concepts involved without a clear consensus on the next steps.
Participants note that they are working within the constraints of number theory and express varying levels of confidence in their understanding of the problem. There is an acknowledgment of the need for further clarification on specific terms used in the discussion.
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
frustr8photon said:(a^n - b^n) | (a^n + b^n)
what does that mean?? does the bar symbol mean "given"