On Prime Divisors of Binomial Coefficients
Sander, J. W.
1992-03-01 00:00:00
In 1985, Sárközy proved a conjecture of Erdös by showing that (2nn) is never square‐free for sufficiently large n. By applying a new estimate on exponential sums, we prove that this also holds for (2n±dn) if dis not ‘too big’.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngBulletin of the London Mathematical SocietyWileyhttp://www.deepdyve.com/lp/wiley/on-prime-divisors-of-binomial-coefficients-ZCzig6GZMN
In 1985, Sárközy proved a conjecture of Erdös by showing that (2nn) is never square‐free for sufficiently large n. By applying a new estimate on exponential sums, we prove that this also holds for (2n±dn) if dis not ‘too big’.
Journal
Bulletin of the London Mathematical Society
– Wiley
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.