Sarah Peluse
We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We prove a modification as well as an improvement of a result of K. Ford, D. R. Heath-Brown and S. Konyagin concerning prime avoidance of square-free numbers and perfect powers of prime numbers.
We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.
We find all unitary perfect polynomials over the prime field $\F_2$ with less than five distinct prime factors.
An odd perfect number, N, is shown to have at least nine distinct prime factors. If 3 does not divide N, then N must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect numbers.
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.
We investigate the consecutive primes $p$ and $q$ ($p > q$) for which there exists a pair of natural numbers $(x,y)$ such that $p^x-q^y$ is a perfect square and make some conjectures.
A perfect polynomial over the binary field $\F_2$ is a polynomial $A \in \F_2[x]$ that equals the sum of all its divisors. If $\gcd(A,x^2-x) \neq 1$ then we call $A$ even. The list of all even perfect polynomials over $\F_2$ with at most 3 prime factors in known. The object of this paper is to give the list of all even perfect polynomials over $\F_2$ with four prime factors. These are all the known perfect polynomials with four prime factors over $\F_2$.
For any positive integer $k$, we show that infinitely often, perfect $k$-th powers appear inside very long gaps between consecutive prime numbers, that is, gaps of size $$ c_k \frac{\log p \log_2 p \log_4 p}{(\log_3 p)^2}, $$ where $p$ is the smaller of the two primes.
The only (unitary) perfect polynomials over $\mathbb{F}_2$ that are products of $x$, $x+1$ and Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$. Other consequences of such a factorization are new results about odd perfect polynomials.
Bounded gaps and perfect power gaps in sequences of consecutive primes
本文研究连续素数间隙中是否存在较大间隙或完美幂间隙，并探讨相关数学问题。
In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and $F_{2k+1}$ are Fibonacci primes. Moreover, we obtain other interesting results and raise a new conjecture on perfect numbers.
For a positive integer $n$, let $σ(n)$ denote the sum of the positive divisors of $n$. Let $d$ be a proper divisor of $n$. We call $n$ a deficient-perfect number if $σ(n)=2n-d$. In this paper, we show that the only odd deficient-perfect number with four distinct prime divisors is $3^{2}\cdot 7^{2}\cdot 11^{2}\cdot 13^{2}$.
For a positive integer $n$, if $σ(n)$ denotes the sum of the positive divisors of $n$, then $n$ is called a deficient perfect number if $σ(n)=2n-d$ for some positive divisor $d$ of $n$. In this paper, we prove some results about odd deficient perfect numbers with four distinct prime factors.
Let $N$ be an odd perfect number. Let $ω(N)$ be the number of distinct prime factors of $N$ and let $Ω(N)$ be the total number (counting multiplicity) of prime factors of $N$. We prove that $\frac{99}{37}ω(N) - \frac{187}{37} \leq Ω(N)$ and that if $3\nmid N$, then $\frac{51}{19}ω(N)-\frac{46}{19} \leq Ω(N)$.
Let $k\geq 2$ be a fixed natural number. We establish the existence of infinitely many pairs of consecutive primes $p_n$, $p_{n+1}$ satisfying $$ p_{n+1}-p_n\geq c\:\frac{\log p_n\: \log_2 p_n\: \log_4 p_n}{\log_3 p_n}\:,$$ with $c$ being a fixed positive constant, for which the interval $(p_n, p_{n+1})$ contains the $k$-th power of a prime number.
Minimal zero-free regions for results on primes between consecutive perfect $k$th powers
该研究计算了确保连续完美k次幂间存在素数的最小无零区域，并证明了在连续86次幂间总存在素数，同时识别了一个特定整数序列在连续70次幂间也总存在素数。
All bi-unitary perfect polynomials over $\F_2$ with only Mersenne primes as odd divisors
该研究针对二元素域$\boldsymbol{\text{F}}_2$，找到了仅以梅森多项式为奇不可约因子的所有非分裂双酉完美多项式，是经典算术问题的多项式变体研究成果。
Non-splitting bi-unitary perfect polynomials over $\mathbb{F}_4$ with less than five prime factors
本文确定了有限域 $\mathbb{F}_4$ 上所有至多包含四个不可约因子的非分裂双酉完美多项式，并指出此类因子有无限多个。
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 …
We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{α_1}... p_s^{α_s} q_1^{2β_1}... q_t^{2β_t}$ with $β_1, ..., β_t$ in some finite set S satisfies $σ(N)=\frac{n}{d}N$, then N has a prime factor smaller than C, where C is an effective computable constant depending only on s, n, S.
In this article, we consider the Diophantine equation $σ_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible in terms of Lucas sequences. Meanwhile, we obtain some results relating to other linear recurrent sequences.
We address an arithmetic problem in the ring $\F_2[x]$ related to the fixed points of the sum of divisors function. We study some binary polynomials $A$ such that $σ(A)/A $ is still a binary polynomial. Technically, we prove that the only (unitary) perfect polynomials over $\F_2$ that are products of $x$, $x+1$ and of Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$.
Let $N$ be an odd perfect number. Let $ω(N)$ be the number of distinct prime factors of $N$ and let $Ω(N)$ be the total number of prime factors of $N$. We prove that if $(3,N)=1$, then $ \frac{302}{113}ω- \frac{286}{113} \leq Ω. $ If $3|N$, then $\frac{66}{25}ω-5\leqΩ.$ This is an improvement on similar prior results by the author which was an improvement of a result of Ochem and Rao. We also establish new lower bounds on $ω(N)$ in terms of the smallest prime factor of $N$ and establish new lower bounds on $N$ in terms of its smallest prime factor.
Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.
The sum of the reciprocals of the prime divisors of an odd perfect or odd primitive non-deficient number
本文在奇完全数及更弱的奇本原非亏数假设下，证明了素因子倒数之和 T(n) 与乘积 H(n) 关于最小素因子的新上界。
Let $σ(n)$ denote the sum of the positive divisors of $n$. We say that $n$ is perfect if $σ(n) = 2 n$. Currently there are no known odd perfect numbers. It is known that if an odd perfect number exists, then it must be of the form $N = p^α\prod_{j=1}^k q_j^{2 β_j}$, where $p, q_1, ..., q_k$ are distinct primes and $p \equiv α\equiv 1 \pmod{4}$. Define the total number of prime factors of $N$ as $Ω(N) := α+ 2 \sum_{j=1}^k β_j$. Sayers showed that $Ω(N) \geq 29$. This was later extended by Iannucci and Sorli to show that $Ω(N) \geq 37$. This was extended by the author to show that $Ω(N) \geq 47$…
In this paper, we study the diophantine equation ${{σ}_{2}}(n)-{{n}^{2}}=An+B$. We prove that except for finitely many computable solutions, all the solutions to this equation with $(A,B)=({{L}_{2m}},F_{2m}^{2}-1)$ are $n={{F}_{2k+1}}{{F}_{2k+2m+1}}$, where both ${{F}_{2k+1}}$ and ${{F}_{2k+2m+1}}$ are Fibonacci primes. Meanwhile, we show that the twin primes conjecture holds if and only if the equation ${{σ}_{2}}(n)-{{n}^{2}}=2n+5$ has infinitely many solutions.
Complete characterization of $2$-near perfect numbers with exactly 2 prime factors
本文通过分析奇偶性及指数条件，完整刻画了恰好有两个素因子的 $2$-近完美数，证明不存在奇数的此类数，并确定了所有偶数形式属于特定族。
A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their non-existence is also not proved. This is an old unsolved mathematical problem. Three mathematical propositions have been recently associated with the cuboid problem. They are known as three cuboid conjectures. These three conjectures specify three special subcases in the search for perfect cuboids. The case of the second conjecture is associated with solutions…
Products of shifted primes simultaneously taking perfect power values
本文研究了移位素数的乘积同时取完全幂值的问题，给出了无平方因子整数n的数量下界，并探讨了特定A集合下的素因子数量下界。
We establish a result linking the Bouniakowsky conjecture and the density of polynomial roots to prime moduli.
In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic achievement of Yitang Zhang about the existence of bounded gaps between consecutive primes. Most of these results would have belonged to the category of science fiction a decade ago. However, the presented results are far from being immediate consequences of Zhang's famous theorem: they require various new ideas, other important properties of the applied sieve functi…
We discuss various recent advances on weak forms of the Twin Prime Conjecture.
We show that the plane Cremona group over a perfect field $k$ of characteristic $p \ge 0$ contains an element of prime order $\ell\ge 7$ not equal to $p$ if and only if there exists a 2-dimensional algebraic torus $T$ over $k$ such that $T(k)$ contains an element of order $\ell$. If $p = 0$ and $k$ does not contain a primitive $\ell$-th root of unity, we show that there are no elements of prime order $\ell > 7$ in $\Cr_2(k)$ and all elements of order 7 are conjugate.
If $p_k$ is the k-th prime, the Firoozbakht conjecture states that the sequence $(p_k)^{1/k}$ is strictly decreasing. We use the table of first-occurrence prime gaps in combination with known bounds for the prime-counting function to verify the Firoozbakht conjecture for primes up to four quintillion $(4\times10^{18})$.
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.
A conjecture of Cai-Zhang-Shen for figurate primes says that every integer $k>1$ is the sum of two figurate primes. In this paper we give an equivalent proposition to the conjecture. By considering extreme value problems with constraints about the conjecture in the cases of odd and even integers and using the method of Lagrange multipliers, Cardano formula for cubic equations and the contradiction, we prove the conjecture.
In this paper, we prove the Iwasawa main conjecture for elliptic curves at an odd supersingular prime p. Some consequences are the p-parts of the leading term formulas in the Birch and Swinnerton-Dyer conjectures for analytic rank 0 or 1.
We give a more comrehensive treatment of Chen's double sieve and improve related constants in Goldbach's conjecture and the twin prime problem.
Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of a global field of characteristic p>2. We also prove that the set of all elements of k^{perf} which are integral at some prime \qq of k^{perf} is diophantine over k^{perf}, and this is the first such result for a field which is not finitely generated over its constant field. This is related to Hilbert's Tenth Problem because for global fields k of positive ch…
We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{α_1}\cdots p_s^{α_s} q_1^{β_1}\cdots q_t^{β_t}$ with $β_1, \ldots, β_t$ bounded by a given constant. We shall also give similar results for quasiperfect numbers and relatively prime amicable pairs of opposite parity.
An Equivalent form of Twin Prime Conjecture connected with a sequence of arithmetic progressions
本文提出了一种与算术进展序列对称性质相关的 twin素数猜想等价形式。
Perfect numbers, Wieferich primes and the solutions of $\binom{2n}{n}\equiv 2^n \bmod n$
本文研究同余方程$\binom{2n}{n}\boldsymbol{\text{≡}}2^n \bmod n$的解，借助SageMath软件及自身结果增加了已知解的数量，还证明了偶完全数、Wieferich素数与该方程解的关联。
Let $\mathcal{P}$ be the set of all primes and $π(x)$ be the number of primes up to $x$. For any $n\ge 2$, let $P^+(n)$ be the largest prime factor of $n$. For $0<c<1$, let $$T_c(x)=\#\{p\le x:p\in \mathcal{P},P^+(p-1)\ge p^c\}.$$ In this note, we proved that there exists some $c<1$ such that $$\limsup_{x\rightarrow\infty}\frac{T_c(x)}{π(x)}<\frac12,$$ which disproves a conjecture of Chen and Chen.
Let $k>2$ be a prime such that $2^k-1$ is a Mersenne prime. Let $n = 2^{α-1}p$, where $α>1$ and $p<3\cdot 2^{α-1}-1$ is an odd prime. Continuing the work of Cai et al. and Jiang, we prove that $n\ |\ σ_k(n)$ if and only if $n$ is an even perfect number $\neq 2^{k-1}(2^k-1)$. Furthermore, if $n = 2^{α-1}p^{β-1}$ for some $β>1$, then $n\ |\ σ_5(n)$ if and only if $n$ is an even perfect number $\neq 496$.
In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture can be proved assuming our improved version of Legendre's Conjecture. Finally, we sharpen the Bertrand's Postulate for prime numbers. Our results are backed by extensive empirical investigation.
A Generalized Elliott-Halberstam Conjecture Implying the Twin Prime Hypothesis
本研究提出关乎算术级数素数对分布的移位卷积广义Elliott-Halberstam猜想（GEH-2），给出von Mangoldt函数相关性的分布水平，证明其蕴含孪生素数猜想并讨论相关数论意义。
Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.
We present here a new conjecture for the nature of the Mersenne prime numbers by connecting it with the Collatz-Kakutani problem. By introducing a natural path length on the basis of the Collatz-Kakutani tree, we conjecture that this path length of a Mersenne prime from the root of the Collatz-Kakutani tree is approximately proportional to the index of the Mersenne prime. We also discuss difference of behaviors between Mersenne numbers and Mersenne primes.
In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find "Skewes numbers" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.
Under Cramér's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$. Under the same conjecture, we also prove that for any $ε>0$, there exists a positive real number $B$ for which the formula $[B.{n!}^{2+ε}]$ gives a prime number for any sufficiently large positive integer $n$.
In 1987, B. Perrin-Riou formulated a Heegner point main conjecture for elliptic curves at primes of ordinary reduction. In this paper, we formulate an analogue of Perrin-Riou's main conjecture for supersingular primes. We then prove this conjecture under mild hypotheses, and deduce from this result a $Λ$-adic extension of Kobayashi's $p$-adic Gross-Zagier formula, new cases of B.-D. Kim's doubly-signed main conjectures, and a strengthened version of Skinner's converse to the Gross-Zagier-Kolyvagin theorem for supersingular primes.
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also determine very thin and low diverging ranges in which the probability of finding a prime is one.
I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain property called pseudo equidistribution. Both rigorous as well as heuristic arguments are given in support of the generalized Cramer's conjectures.
Conjectures about Primes and Cyclic Numbers
本文定义了循环数，回顾并提出了素数与循环数的类比猜想，利用小于$10^8$的循环数进行测试，推翻了Hardy和Littlewood素数第二猜想的循环类比。
We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all $\varepsilon>0$, $p-2$ is either a prime number or can be written as $p_1 p_2$ where $p_1$ and $p_2$ are prime and $p_1<X^{\varepsilon}$, and we give the explicit asymptotic.
We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers between the $2d$ different primes. We may conclude that there exist infinitely many $2d$ different primes including the twin primes in case of $d=1$ because we can give the lower bounds of the existence density for the $2d$ different primes in this algorithm. We also discuss the Hardy-Littlewood conjecture and the Sophie Germain primes.
In this paper, by using the theory of elliptic curves, we discuss several Diophantine equations related with the so-called figurate primes. Meanwhile, we raise several conjectures related with figurate primes and Hilbert's 8th problem, including Goldbach's conjecture, twin primes conjecture and Catalan's conjecture as well.
We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient condition for the truth of the Goldbach conjecture, the infinitude of prime twins, and more general of prime pairs with a fixed even difference.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。