Results 1 -
2 of
2
On the p-divisibility of Fermat quotients
- Math.Comp.66 (1997), 1353–1365. http://users.utu.fi/taumets/fermat/fermat.htm. MR 97i:11003
"... Abstract. The authors carried out a numerical search for Fermat quotients Qa =(a p−1 −1)/p vanishing mod p, for1≤a≤p−1, up to p<10 6. This article reports on the results and surveys the associated theoretical properties of Qa. The approach of fixing the prime p rather than the base a leads to some a ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract. The authors carried out a numerical search for Fermat quotients Qa =(a p−1 −1)/p vanishing mod p, for1≤a≤p−1, up to p<10 6. This article reports on the results and surveys the associated theoretical properties of Qa. The approach of fixing the prime p rather than the base a leads to some aspects of the theory apparently not published before. 1.
Arbitrarily Tight Bounds On The Distribution Of Smooth Integers
- Proceedings of the Millennial Conference on Number Theory
, 2002
"... This paper presents lower bounds and upper bounds on the distribution of smooth integers; builds an algebraic framework for the bounds; shows how the bounds can be computed at extremely high speed using FFT-based power-series exponentiation; explains how one can choose the parameters to achieve ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
This paper presents lower bounds and upper bounds on the distribution of smooth integers; builds an algebraic framework for the bounds; shows how the bounds can be computed at extremely high speed using FFT-based power-series exponentiation; explains how one can choose the parameters to achieve any desired level of accuracy; and discusses several generalizations.
