AbstractWe prove that for any integer d multinomial coefficients satisfying some conditions are exactly divisible by pd for many large primes p. The obtained results are essentially the best possible. Also, we show that under some hypothesis q-multinomial coefficients are divisible by pd
AbstractIn this paper we study the distribution modulo 1 of the sequence of vectors (pα1, …, pαk), w...
AbstractWe prove: Let n > 0 be an integer. Then we have for all real numbers r > 0: where both boun...
We obtain a lower bound for the minimum over positive integers such that the sum of certain powers o...
AbstractThe following two facts are shown: 1.(i) There is a computable constant γ > 0 such that, giv...
AbstractIn the work The Friedman–Joichi–Stanton Monotonicity Conjecture at Primes, George Andrews ga...
AbstractA recent conjecture of Myerson and Sander concerns divisibility properties of certain multin...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
AbstractLetf∈Z[x] with degreekand letpbe a prime. By a complete trigonometric sum we mean a sum of t...
AbstractIn this paper we study divisibility properties of certain multinomial coefficients introduce...
AbstractWe prove that for almost all n, the numerator of the Bernoulli number B2n is divisible by a ...
In this paper, we prove that every sufficiently large positive integer satisfying some necessary con...
AbstractIt is known that for sufficiently large n and m and any r the binomial coefficient (nm) whic...
AbstractIt is shown that the number of integersnfor whichn∈(x−xθ, x] andnhaving at most two prime fa...
AbstractWe prove that for any integer d multinomial coefficients satisfying some conditions are exac...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
AbstractIn this paper we study the distribution modulo 1 of the sequence of vectors (pα1, …, pαk), w...
AbstractWe prove: Let n > 0 be an integer. Then we have for all real numbers r > 0: where both boun...
We obtain a lower bound for the minimum over positive integers such that the sum of certain powers o...
AbstractThe following two facts are shown: 1.(i) There is a computable constant γ > 0 such that, giv...
AbstractIn the work The Friedman–Joichi–Stanton Monotonicity Conjecture at Primes, George Andrews ga...
AbstractA recent conjecture of Myerson and Sander concerns divisibility properties of certain multin...
AbstractIn this paper we obtain the distribution of the functionω(ϕk(n)) which counts the number of ...
AbstractLetf∈Z[x] with degreekand letpbe a prime. By a complete trigonometric sum we mean a sum of t...
AbstractIn this paper we study divisibility properties of certain multinomial coefficients introduce...
AbstractWe prove that for almost all n, the numerator of the Bernoulli number B2n is divisible by a ...
In this paper, we prove that every sufficiently large positive integer satisfying some necessary con...
AbstractIt is known that for sufficiently large n and m and any r the binomial coefficient (nm) whic...
AbstractIt is shown that the number of integersnfor whichn∈(x−xθ, x] andnhaving at most two prime fa...
AbstractWe prove that for any integer d multinomial coefficients satisfying some conditions are exac...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
AbstractIn this paper we study the distribution modulo 1 of the sequence of vectors (pα1, …, pαk), w...
AbstractWe prove: Let n > 0 be an integer. Then we have for all real numbers r > 0: where both boun...
We obtain a lower bound for the minimum over positive integers such that the sum of certain powers o...
DOI
Add to ORKG