- #1

- 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?

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter halvizo1031
- Start date

- #1

- 78

- 0

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

Do I solve this by contradiction? If so, how do I start it?

- #2

- 117

- 0

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 im only into number theory as a hobby, i might not be quite on the mark, ;-) ,

good luck

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 im only into number theory as a hobby, i might not be quite on the mark, ;-) ,

good luck

Last edited:

- #3

- 78

- 0

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 im 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

- 30

- 0

(a^n - b^n) | (a^n + b^n)

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

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

- #5

Dick

Science Advisor

Homework Helper

- 26,260

- 619

(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:

Share: