The Divisibility of an – bn by Powers of n

DOI10.1515/INTEG.2010.027zbMATH Open1201.11008arXiv0909.2598OpenAlexW2571885369MaRDI QIDQ3580717FDOQ3580717

Authors: Kálmán Győry, Chris Smyth 

Publication date: 13 August 2010

Published in: Integers (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/0909.2598

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On the divisibility of \(a^n \pm b^n\) by powers of \(n\)
• scientific article; zbMATH DE number 3243896
• On divisibility by \(\frac{a^k-b^k}{a-b}\)
• On divisibility of some power sums
• scientific article; zbMATH DE number 3106480
• Divisibility of binomial coefficients by powers of two
• On the divisors of $a^k + b^k$

zbMATH Keywords

divisibilityZsigmondy's theorem

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Factorization; primality (11A51)

Cited In (15)

• Pairs where 2 a - 2 b Divides n a - n b for all n
• Some an ± bn Problems in Number Theory
• How often is \(d(n)\) a power of a given integer?
• Properties of infinite divisibility
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the gcd's of \(k\) consecutive terms of Lucas sequences
• A CLASS OF EXPONENTIAL CONGRUENCES IN SEVERAL VARIABLES
• Title not available (Why is that?)
• Title not available (Why is that?)
• Divisibility Properties of Integers x, k Satisfying 1 k + ⋯+ (x - 1) k = x k
• On divisibility by \(\frac{a^k-b^k}{a-b}\)
• When does \(F^L_m\) divide \(F_n\)? A combinatorial solution
• On numbers \(n\) dividing the \(n\)th term of a linear recurrence

This page was built for publication: The Divisibility of an – bn by Powers of n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580717)