2 citations · 3 across the 6 of their papers we have counts for
8 papers · 1 filter
On the maximal order of numbers in the "factorisatio numerorum" problem
Martin Klazar, Florian Luca
Let m(n) be the number of ordered factorizations of n in factors larger than 1. We prove that for every eps>0 n^{rho} m(n) < exp[(log n)^{1/rho}/(loglog n)^{1+eps}] holds for all i…
Uniform Distribution of Fractional Parts Related to Pseudoprimes
William D. Banks, Moubariz Z. Garaev, Florian Luca +1
We estimate exponential sums with the Fermat-like quotients $$ f_g(n) = \frac{g^{n-1} - 1}{n} \mand h_g(n)=\frac{g^{n-1}-1}{P(n)}, $$ where and are positive integers, i…
Divisibility of class numbers: enumerative approach
Yuri F. Bilu, Florian Luca
Murty proved that for all sufficiently large there exist at least ${c(\ell,\eps) X^{1/{4\ell}-\eps}}$ real quadratic fields with class number divisible by and discrimina…
Noncototients and Nonaliquots
William D. Banks, Florian Luca
Let and denote the Euler function and the sum of divisors function, respectively. In this paper, we give a lower bound for the number of positive integers $m\…
Exponential Sums and Congruences with Factorials
Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski
We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials and…
Character Sums and Congruences with n!
Moubariz Z. Garaev, Florian Luca, Igor E. Shparlinski
We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information…