Gérald Tenenbaum
Let $\{p_j(n)\}_{j=1}^{ω(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erdős implying that, for any function $ξ(n)$ tending to infinity with $n$, we have $$f(n):=\max_{1\leqslant j<ω(n)}\log \Big({\log p_{j+1}(n)\over \log p_j(n)}\Big)=\log_3n+O(ξ(n))$$ for almost all integers $n$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
This paper studies the largest cycles consisted by the quadratic residues modulo prime numbers. We give some formulae about the maximum length of the cycles. Especially, the formula for modulo Fermat primes is given.
An asymptotic formula for the number of $n \le x$ such that $n$ does not divide $P(n)!$ is given, where P(n) is the largest prime factor of $n$.
In 1982, Erdös and van Lint showed an estimate for the average of the ratio of the smallest and largest prime divisor of $n$. In this note, we apply C.H. Jia's method to give an estimate for the average of positive integer power of the ratio.
We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving an asymptotic formula for this mode as $x$ tends to infinity, we look at the set of those prime numbers which, for some value of $x$, occur most frequently as the largest prime divisor of the integers in the interval $[2,x]$. We find that many prime numbers never have this property. We compare the set of "popular primes," those primes which are at some poin…
Improving on a theorem of Heath-Brown, we show that if $X$ is sufficiently large then a positive proportion of the values $\{n^3+2:n\in (X,2X]\}$ have a prime factor larger than $X^{1+10^{-52}}$.
In this paper, we find all integers $x$ such that $x^{2}-1$ has only prime factors smaller than 100. This gives some interesting numerical corollaries. For example, for any positive integer $n$ we can find the largest positive integer $x$ such that all prime factors of each of $x, x+1,..., x+n$ are less than 100.
Today, prime numbers attained exceptional situation in the area of numbers theory and cryptography. As we know, the trend for accessing to the largest prime numbers due to using Mersenne theorem, although resulted in vast development of related numbers, however it has reduced the speed of accessing to prime numbers from one to five years. This paper could attain to theorems that are more extended than Mersenne theorem with accelerating the speed of accessing to prime numbers. Since that time, the reason for frequently using Mersenne theorem was that no one could find an efficient formula for a…
On the largest prime factors of shifted semiprime numbers
该研究证明了对于固定整数a和足够大的x，移位半素数乘积的最大大素因子超过x^θ，其中θ为0.5减去一个任意小的正数。
Let P(k) be the largest prime factor of the positive integer k. In this paper, we prove that the series $\sum_{n\ge 1}\frac{(\log n)^a}{P(2^n-1)}$ is convergent for each constant a<1/2, which gives a more precise form of a result of C. L. Stewart from 1977.
Let $P(X)\in\mathbb{Z}[X]$ be an irreducible, monic, quartic polynomial with cyclic or dihedral Galois group. We prove that there exists a constant $c_P>0$ such that for a positive proportion of integers $n$, $P(n)$ has a prime factor $\ge n^{1+c_P}$.
We consider the Dickman function $Ψ(x,y)$ in the limit when $\ln x/\ln y\to \infty $ and $\ln \ln x \ln y\to 0$. The asymptotic value is expressed in terms of the ratio of iterated loragithm of $x$ and $ln y$.
It was conjectured by Gauss that any negative discriminant with at least 32 genera has at least two classes of binary quadratic forms in each genus. We prove that such a discriminant cannot have a particularly large prime factor, by an argument similar to that of Baker's solution to Gauss' class number one problem.
Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as the closely related problem of improving bounds $bc$, and $abc$. In particular, we prove two results. First we prove a new general bound on any prime divisor of an odd perfect number and obtain as a corollary of that bound that $$a < 2N^{\frac{1}{6}}.$$ Second, we show that $$abc < (2N)^{\frac{3}{5}}.$$ We also show how in certain circumstances these bounds …
Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. Here, we show that if $n\geq k+2$, then $P(F_n^{(k)})>c\log\log n$, where $c>0$ is an effectively computable constant. Furthermore, we determine all the $k-$Fibonacci numbers $F_n^{(k)}$ whose largest prime factor is less than or equal to 7.
For an integer $m >1$, we denote by $P(m)$ the largest prime divisor of $m$. We prove that $\limsup_{n \rightarrow +\infty} P(n!+1)/n \geqslant 1+9\log 2>7.238$, which improves a result of Stewart. More generally, for any nonzero polynomial $f(X)$ with integer coefficients, we show that $\limsup_{n \rightarrow +\infty} P(n!+f(n))/n \geqslant 1+9\log2$. This improves a result of Luca and Shparlinski. These improvements come from an additional combinatoric idea to the works mentioned above.
We survey the classical results on the prime number theorem
We show that the largest prime factor of $n^2+1$ is infinitely often greater than $n^{1.279}$. This improves the result of de la Bretèche and Drappeau (2019) who obtained this with $1.2182$ in place of $1.279.$ The main new ingredients in the proof are a new Type II estimate and using this estimate by applying Harman's sieve method. To prove the Type II estimate we use the bounds of Deshouillers and Iwaniec on linear forms of Kloosterman sums. We also show that conditionally on Selberg's eigenvalue conjecture the exponent $1.279$ may be increased to $1.312.$
Let $M(x)$ denote the median largest prime factor of the integers in the interval $[1,x]$. We prove that $$M(x)=x^{\frac{1}{\sqrt{e}}\exp(-\text{li}_{f}(x)/x)}+O_ε(x^{\frac{1}{\sqrt{e}}}e^{-c(\log x)^{3/5-ε}})$$ where $\text{li}_{f}(x)=\int_{2}^{x}\frac{\{x/t\}}{\log t}dt$. From this, we obtain the asymptotic $$M(x)=e^{\frac{γ-1}{\sqrt{e}}}x^{\frac{1}{\sqrt{e}}}(1+O(\frac{1}{\log x})),$$ where $γ$ is the Euler Mascheroni constant. This answers a question posed by Martin, and improves a result of Selfridge and Wunderlich.
The largest prime factor of an irreducible cubic polynomial
将Heath-Brown关于$n^3+2$存在大于$n^{1+c}$的素因子的结论推广到任意首一不可约三次整系数多项式，并给出依赖于多项式的指数$c_p$。
An improvement on the largest prime factor of $n^2+1$
本研究改进了$n^2+1$最大素因子的增长下界，将此前的$(\nlog_2 n)^2/\nlog_3 n$提升至$(\nlog_2 n)^2/\nlog_4 n$，并证明该下界接近紧时同样适用于$n^2+1$的多个素因子。
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
On the largest prime factor of quadratic polynomials
本文基于 Grimmelt 和 Merikoski 的近期结果，证明了 $n^2+1$ 的最大素因子无穷多次大于 $x^{1.317}$，并给出了满足 $n \leqslant x$ 且 $n^2+1$ 具有本原因子的整数 $n$ 个数的新上界。
We investigate the distribution of $pθ$ modulo 1, where $θ$ is a complex number which is not contained in $\mathbb{Q}(i)$, and $p$ runs over the Gaussian primes.
Let $α, β\geq 0$ and $α+ β< 1$. In this short note, we show that $\liminf_{n \to \infty} p_n^β(p_{n+1}^α- p_n^α) = 0$, where $p_n$ is the $n$th prime. This notes an improvement over results of Sándor and gives additional evidence towards a conjecture of Andrica. This follows directly from recent results on prime pairs from Maynard, Tao, Zhang.
On the largest prime factors of $p-1$ and $p+1$
本文证明对正比例的素数，$p-1$ 与 $p+1$ 的最大素因子大小关系在两个方向均成立，方法结合对数平衡恒等式与均匀塞尔伯格筛法。
On the largest prime factor of integers in short intervals III
该研究通过均值定理和筛法分解，证明短区间内存在素因子大于特定阈值的整数，改进了先前关于该问题的记录。
In this note, we revisit a result of Benli's and Pollack's on the number of small prime $k^{th}$ power residues. The proof is based on their idea of using reciprocity laws, but the argument is simplified and we prove a slightly stronger bound.
Let p be a prime number, and let K be a number field. For p=2, assume moreover K totally imaginary. In this note we prove the existence of asymptotically good extensions L{K of cohomological dimension 2 in which infinitely many primes split completely. Our result is inspired by a recent work of Hajir, Maire, and Ramakrishna [7].
Motivated by the connection to the pair correlation of the Riemann zeros, we investigate the second derivative of the logarithm of the Riemann zeta function, in particular the zeros of this function. Theorem 1 gives a zero-free region. Theorem 2 gives an asymptotic estimate for the number of nontrivial zeros to height T. Theorem 3 is a zero density estimate.
Largest square divisors of shifted primes
该论文证明存在无穷多个素数 $p$，使得对任意非零整数 $a$，$p-a$ 有大于 $p^{1/2+1/700}$ 的平方因子，改进了 Merikoski 的指数，并使用了 Harman 筛法中的强力工具。
On the Largest Prime factor of the k-generalized Lucas numbers
本文研究了k-广义Lucas数的最大素因子，证明了当n≥k+1时其最大素因子大于(1/86)loglogn，并确定了所有最大素因子不超过7的k-广义Lucas数。
Instead of a strong quantitative form of the Hardy-Littlewood prime $k$-tuple conjecture, one can assume an average form of it and still obtains the same distribution result on $ψ(x+h) - ψ(x)$ by Montgomery and Soundararajan [1].
We define $g(n)$ to be the maximal order of an element of the symmetric group on $n$ elements. Results about the prime factorization of $g(n)$ allow a reduction of the upper bound on the largest prime divisor of $g(n)$ to $1.328\sqrt{n\log n}$.
We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^θ$ for $θ=1/2+1/2000.$ This improves the work of Matomäki (2009) who obtained the result for $θ=1/2-\varepsilon$ (with the added constraint that $d$ is also a prime), which improved the result of Baier and Zhao (2006) with $θ=4/9-\varepsilon.$ Similarly as in the work of Matomäki, we apply Harman's sieve method to detect primes $p \equiv 1 \, (d^2)$. To break the $θ=1/2$ barrier we prove a new bilinear equidistribution estimate modulo smooth square moduli $d^2$ by using a similar argument as …
Let $S$ be a string of $l$ decimal digits. We give an explicit upper bound on some prime $p$ whose decimal representation contains the string $S$. We also show, as a corollary of the Green-Tao theorem, that there are arbitrarily long arithmetic progressions of prime numbers all of whose decimal representations contain $S$.
A note on the distribution of prime ideals in real quadratic fields
本文总结了虚二次域素理想分布的研究，并基于相同方法建立了实二次域的类似结果。
Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we give answers to some questions and prove a conjecture posed by Miska and Tóth in their recent paper concerning subsequences of the sequence of prime numbers. In particular, we establish explicit upper and lower bounds for $p_{n}^{(k)}$. We also study the behaviour of the counting functions of the sequences $(p_{n}^{(k)})_{k=1}^{\infty}$ and $(p_{k}^{(k)})_{k=1…
In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that these sequences always terminate in a power of two but can be extended infinitely to the left.
Acquaah and Konyagin showed that if $N$ is an odd perfect number where $N= p_1^{a_1}p_2^{a_2} \cdots p_k^{a_k}$ where $p_1 < p_2 \cdots < p_k$ then one must have $p_k < 3^{1/3}N^{1/3}$. Using methods similar to theirs, we show that $p_{k-1}< (2N)^{1/5}$ and that $p_{k-1}p_k < 6^{1/4}N^{1/2}.$ We also show that if $p_k$ and $p_{k-1}$ are close to each other than these bounds can be further strengthened.
As a refinement of the celebrated recent work of Yitang Zhang we show that any admissible k-tuple of integers contains at least two primes and almost primes in each component infinitely often if k is at least 181000. This implies that there are infinitely many gaps between consecutive primes of size at most 2530338, with an improved admissible k-tuple of Andrew W. Sutherland to 2326476.
A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a broad range of existing string-analysis algorithms to problems in number theory. Binary strings of prime occurrences can be also generated with simple algorithms. Here we discuss three such algorithms and we demonstrate their applicability using the example of proving Goldbach's hypothesis for some limited sets of even numbers. This work formulates three open q…
On certain sums involving the largest prime factor over integer sequences
本文研究了整数序列中最大素因子相关的求和问题，推导了两个求和的渐进行为。
For $k\ge 2$ even, let $d_{k,N}$ denote the dimension of the largest simple Hecke submodule of $S_{k}(Γ_0(N); \mathbb{Q})^\text{new}$. We show, using a simple analytic method, that $d_{k,N} \gg_k \log\log N / \log(2p)$ with $p$ the smallest prime co-prime to $N$. Previously, bounds of this quality were only known for $N$ in certain subsets of the primes. We also establish similar (and sometimes stronger) results concerning $S_{k}(Γ_0(N), χ)$, with $k \geq 2$ an integer and $χ$ an arbitrary nebentypus.
Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <= c1((logx)^2)/loglogx, c1 > 0 constant. Equivalently, it shows that the very short intervals (x, x + y] contain prime numbers for all y > c2((logx)^2)/loglogx, c2 > 0 constant, and sufficiently large x > 0.
These notes are based on my four lectures given at the Newton Institute in April 2004 during the Recent Perspectives in Random Matrix Theory and Number Theory Workshop. Their purpose is to introduce the reader to the analytic number theory necessary to understand Montgomery's work on the pair correlation of the zeros of the Riemann zeta-function and subsequent work on how this relates to prime numbers. A very brief introduction to Selberg's work on the moments of $S(T)$ is also given.
We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we assume the Riemann Hypothesis.
On the largest prime divisor of polynomial and related problem
本文研究多项式值的最大素因子问题，识别出满足整除阶乘性质的多项式，并对三次、可约四次及Chebyshev多项式分别给出最大素因子的上界估计。
The notion of chiral prime concatenations is studied as a recursive construction of prime numbers starting from a seed set and with appropriate blocks to define the primality growth, generation by generation, either from the right or from the left. Several basic questions are addressed like whether chiral concatenation is a symmetric process, an endless process, as well as the calculation of largest chiral prime numbers. In particular, the largest left-concatenated prime number is constructed. It is a unique prime number of 24 digits. By introducing anomalous left-concatenations of primes we c…
Rigidity of Averages over the Two Largest Prime Factors
该研究解决了Alladi与Johnson关于数论中前两大素因子平均值的问题，证明若最大素因子对应加权平均收敛，则第二大素因子对应加权平均必收敛到同一极限，借助Dickman核与Wiener陶伯定理完成推导。
On the largest prime factor of non-zero Fourier coefficients of Hecke eigenforms
本文研究了 Ramanujan tau 函数及非 CM 规范化 Hecke 特征形式的非零 Fourier 系数的最大素因数，证明了其下界估计，改进了前人工作。
A note on the distribution of clusters and deserts of prime numbers
本文利用三角多项式值分布公式，研究加权 von Mangoldt 函数值之和的分布，并给出其服从类正态分布的证据。
A note on prime index of a certain subgroup in $\mathbb{F}_p^*$
在广义黎曼假设下，研究 $\mathbb{F}_p^*$ 中由 $-1$ 和 $2$ 生成的子群具有奇素数指标的素数比例，证明其与指标大于 $2$ 的素数之比趋近 $46\\%$。
Suppose that $O_L$ is the ring of integers of a number field $L$, and suppose that $f(z)=\sum_{n=1}^\infty a_f(n)q^n\in S_k\cap O_L[[q]]$ (note: $q := e^{2πiz}$) is a normalized Hecke eigenform for $\mathrm{SL}_2(\mathbb{Z})$. We say that $f$ is non-ordinary at a prime $p$ if there is a prime ideal $\mathfrak{p}\subset O_L$ above $p$ for which $a_f(p)\equiv 0 \ (mod\ {\mathfrak{p}})$. For any finite set of primes $S$, we prove that there are normalized Hecke eigenforms which are non-ordinary for each $p\in S$. The proof is elementary and follows from a generalization of work of Choie, Kohnen a…
On the Largest Prime factor of the $k$-generalized Pell numbers
本文研究了 $k$-广义 Pell 数的最大素因子，证明了当 $n \ge 4$ 时其下界为 $(1/104) \log \log n$，并找出了所有最大素因子不超过 $7$ 的 $k$-广义 Pell 数。
Let $χ$ be a real and non-principal Dirichlet character, $L(s,χ)$ its Dirichlet $L$-function and let $p$ be a generic prime number. We prove the following result: If for some $0\leq σ<1$ the partial sums $\sum_{p\leq x}χ(p)p^{-σ}$ change sign only for a finite number of $x$, then there exists $ε>0$ such that $L(s,χ)$ has no zeros in the half plane $Re(s)>1-ε$.
The largest prime factor of $n^2+1$ and improvements on subexponential $ABC$
本文结合超越方法与模方法，利用 Shimura 曲线同 $ABC$ 猜想的联系，改进了 $n^2+1$ 最大素因子的下界，并推进了 $ABC$ 猜想的亚指数界。
Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\ P(n)>\sqrt{x}}}f(n)\bigg|\leq\sqrt{x}(\log\log x)^{1/4+\varepsilon},$$ where $P(n)$ stands for the largest prime factor of $n$. This gives an indication of the almost sure size of the largest fluctuations of $f$.
A non-ordinary (prime) note
本文通过若干权为4的新形式例子，说明非寻常素数条件p整除b(p)可蕴含更强的整除性，并指出这种性质可能较为罕见。
A note on zero-density approaches for the difference between consecutive primes
本研究推广了短区间素数相关的Ingham定理与Heath-Brown和Iwaniec的结果，明晰了无零点区域、零密度估计和短区间素数的关联，还在密度假设下改进了素数定理成立的短区间范围。
The $\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\Sopfr(n)$ and the primes distribution function is drawn and some conjectures for prime numbers formulated in terms of the $\Sopfr(n)$ function are suggested.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。