On the exponent average of integer sequences
DOI10.1007/BF01585914zbMATH Open0835.11009OpenAlexW2080817428MaRDI QIDQ1902525FDOQ1902525
Authors: J. W. Sander
Publication date: 16 April 1996
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/178699
Recommendations
- scientific article; zbMATH DE number 724804
- Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients
- Sur la moyenne des exposants dans la décomposition en facteurs premiers
- On the Sum of Divisors of Binomial Coefficients
- On the average asymptotic behavior of a certain type of sequence of integers
binomial coefficientsdivisor functionnumber of distinct prime factorsalmost squarefreeasymptotic exponent averageexponent averagenumber of prime factors counted with multiplicities
Arithmetic functions; related numbers; inversion formulas (11A25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Binomial coefficients; factorials; (q)-identities (11B65)
Cites Work
- Topics in multiplicative number theory
- Title not available (Why is that?)
- Primes in short intervals
- Title not available (Why is that?)
- On divisors of binomial coefficients. I
- Primes in short intervals
- Title not available (Why is that?)
- Über einige arithmetische Summen. (On some arithmetical sums)
- On the Factorization of Integers
- Prime power divisors of binomial coefficients.
- On numbers with a large prime power factor
- An asymptotic formula for a ‐th powers dividing binomial coefficients
- On primes not dividing binomial coefficients
Cited In (2)
This page was built for publication: On the exponent average of integer sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902525)