Erdős–Tenenbaum–Ford constant

From HandWiki
Short description: Mathematical constant

The Erdős–Tenenbaum–Ford constant is a mathematical constant that appears in number theory.[1] Named after mathematicians Paul Erdős, Gérald Tenenbaum, and Kevin Ford, it is defined as

δ:=1−1+log⁡log⁡2log⁡2=0.0860713320…

where log is the natural logarithm.

Following up on earlier work by Tenenbaum, Ford used this constant in analyzing the number H(x,y,z) of integers that are at most x and that have a divisor in the range [y,z].[2][3][4]

Multiplication table problem

For each positive integer N, let M(N) be the number of distinct integers in an N×N multiplication table. In 1960,[5] Erdős studied the asymptotic behavior of M(N) and proved that

M(N)=N2(log⁡N)δ+o(1),

as N→+∞.

Tenenbaum improved the Erdős multiplication table estimate, and Ford established an asymptotic best bound.

References

  1. ↑ Luca, Florian; Pomerance, Carl (2014). "On the range of Carmichael's universal-exponent function". Acta Arithmetica 162 (3): 289–308. doi:10.4064/aa162-3-6. https://math.dartmouth.edu/~carlp/rangeoflambda13.pdf. 
  2. ↑ Tenenbaum, G. (1984). "Sur la probabilité qu'un entier possède un diviseur dans un intervalle donné" (in French). Compositio Mathematica 51 (2): 243–263. https://www.numdam.org/item?id=CM_1984__51_2_243_0. 
  3. ↑ Ford, Kevin (2008). "The distribution of integers with a divisor in a given interval". Annals of Mathematics. Second Series 168 (2): 367–433. doi:10.4007/annals.2008.168.367. 
  4. ↑ Koukoulopoulos, Dimitris (2010). "Divisors of shifted primes". International Mathematics Research Notices 2010 (24): 4585–4627. doi:10.1093/imrn/rnq045. 
  5. ↑ Erdős, Paul (1960). "An asymptotic inequality in the theory of numbers". Vestnik Leningrad. Univ. 15: 41–49.