The divisibility of a^n-b^n by powers of n

Details The divisibility of a^n-b^n by powers of n The divisibility of a^n-b^n by powers of n

2009-09-14

arxiv.org/abs/0909.2598v1

Mathematics

Number Theory

Scientific paper

For given integers a,b, and j at least 1 we determine the set of integers n for which a^n-b^n is divisible by n^j. For j=1,2, this set is usually infinite; we find explicitly the exceptional cases for which a,b the set is finite. For j=2, we use Zsigmondy's Theorem for this. For j at least 3 and gcd(a,b)=1, the set is probably always finite; this seems difficult to prove, however. We also show that determination of the set of integers n for which a^n+b^n is divisible by n^j can be reduced to that of the above set.

Affiliated with

Also associated with

No associations

Rating

The divisibility of a^n-b^n by powers of n does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The divisibility of a^n-b^n by powers of n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The divisibility of a^n-b^n by powers of n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-565321