AbstractIf n is a positive integer, we write n! as a product of n prime powers, each at least as large as nδ(n). We define α(n) to be max δ(n), where the maximum is taken over all decompositions of the required type. We then show that limn→∞α(n) exists, and we calculate its value
A $k$-representation of an integer $\l$ is a representation of $\l$ as sum of $k$ powers of $2$, whe...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
In memory of my sister Fedra Marina Jakimczuk (1970-2010) In this article we prove that almost the t...
AbstractIf n is a positive integer, we write n! as a product of n prime powers, each at least as lar...
In this paper we study vp(n!), the greatest power of prime p in factorization of n!. We find some lo...
AbstractLet p, q be primes and m be a positive integer. For a positive integer n, let ep(n) be the n...
AbstractThe parity of exponents in the prime power factorization of n! is considered. We extend and ...
summary:Let $p_{1}, p_{2}, \cdots $ be the sequence of all primes in ascending order. Using explicit...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
41 pagesInternational audienceIf n is a positive integer, let h(n) denote the maximal value of the p...
AbstractIn a previous paper [1] we proved that when n + 1 is prime. In this paper we prove that wh...
This is a preprint of an article published by TÜBİTAK; William D. Banks, Florian Luca, Igor E. Shpar...
AbstractTwo results are obtained about P(n), the largest prime factor of an integer n. The average v...
AbstractLet m(n) be the number of ordered factorizations of n⩾1 in factors larger than 1. We prove t...
AbstractA lower bound of Richert on the number of solutions of N − p = P3 is improved
A $k$-representation of an integer $\l$ is a representation of $\l$ as sum of $k$ powers of $2$, whe...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
In memory of my sister Fedra Marina Jakimczuk (1970-2010) In this article we prove that almost the t...
AbstractIf n is a positive integer, we write n! as a product of n prime powers, each at least as lar...
In this paper we study vp(n!), the greatest power of prime p in factorization of n!. We find some lo...
AbstractLet p, q be primes and m be a positive integer. For a positive integer n, let ep(n) be the n...
AbstractThe parity of exponents in the prime power factorization of n! is considered. We extend and ...
summary:Let $p_{1}, p_{2}, \cdots $ be the sequence of all primes in ascending order. Using explicit...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
41 pagesInternational audienceIf n is a positive integer, let h(n) denote the maximal value of the p...
AbstractIn a previous paper [1] we proved that when n + 1 is prime. In this paper we prove that wh...
This is a preprint of an article published by TÜBİTAK; William D. Banks, Florian Luca, Igor E. Shpar...
AbstractTwo results are obtained about P(n), the largest prime factor of an integer n. The average v...
AbstractLet m(n) be the number of ordered factorizations of n⩾1 in factors larger than 1. We prove t...
AbstractA lower bound of Richert on the number of solutions of N − p = P3 is improved
A $k$-representation of an integer $\l$ is a representation of $\l$ as sum of $k$ powers of $2$, whe...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
In memory of my sister Fedra Marina Jakimczuk (1970-2010) In this article we prove that almost the t...
DOI
Add to ORKG