New bounds on the number of representation of as a binomial coefficient.
Kane, Daniel (2004)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Polygon Triangulation in O(n log log n) Time with Simple Data Structures.”
New bounds on the number of representation of as a binomial coefficient.
Inequalities on the Lambert function and hyperpower function.
Hoorfar, Abdolhossein, Hassani, Mehdi (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
A simple elementary proof of
M. Kalecki (1967)
Acta Arithmetica
Similarity:
On the number of ways of writing as a product of factorials.
Kane, Daniel M. (2005)
Integers
Similarity:
Improved bounds on the number of ways of expressing as a binomial coefficient.
Kane, Daniel M. (2007)
Integers
Similarity:
Normal order for divisor functions of generalized integers
Horadam, E.M. (1968)
Portugaliae mathematica
Similarity:
On the average orders of a class of divisor functions.
Woodford, Roger (2007)
Integers
Similarity:
On some estimates involving the number of prime divisors of an integer
Aleksandar Ivić (1987)
Acta Arithmetica
Similarity:
On the maximal distance between integers composed of small primes
R. Tijdeman (1974)
Compositio Mathematica
Similarity:
On the maximal order in and
M. Szalay (1980)
Acta Arithmetica
Similarity: