Normal largest gap between prime factors

DOI10.5802/JTNB.1107zbMATH Open1462.11078arXiv1903.03428OpenAlexW3025963281MaRDI QIDQ2199519FDOQ2199519

Gérald Tenenbaum

Publication date: 11 September 2020

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Abstract: Let ${p_j(n)}_{j=1}^{omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of ErdH{o}s implying that, for any function $xi(n)$ tending to infinity with $n$, we have ${\displaystyle }$f(n):=max_{1leqslant j<omega(n)}log Big({log p_{j+1}(n)over log p_j(n)}Big)=log_3n+O(xi(n))${\displaystyle }$ for almost all integers $n$.

Full work available at URL: https://arxiv.org/abs/1903.03428

Recommendations

• On the Normal Growth of Prime Factors of Integers
• On some Properties of Prime Factors of Integers
• On a thin set of integers involving the largest prime factor function
• On a problem of Erdős involving the largest prime factor of \(n\)
• The number of large prime factors of integers and normal numbers

zbMATH Keywords

normal orderlargest gapdistribution of prime factors

Mathematics Subject Classification ID

Rate of growth of arithmetic functions (11N56)

Cites Work

• Title not available (Why is that?)
• On the distribution of prime divisors
• Cribler les entiers sans grand facteur premier
• Some Remarks on Prime Factors of Integers
• On some Properties of Prime Factors of Integers

Cited In (5)

• On some Properties of Prime Factors of Integers
• On the gap distribution of prime factors
• On the Normal Growth of Prime Factors of Integers
• Title not available (Why is that?)
• On some conjectures of Erdős in Astérisque. I

This page was built for publication: Normal largest gap between prime factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199519)