English
Related papers

Related papers: On Goldbach's Conjecture

200 papers

Some mean value theorems in the style of Bombieri-Vinogradov's theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean…

Number Theory · Mathematics 2012-12-19 Karin Halupczok

Euler showed that if an odd perfect number $N$ exists, it must consist of two parts $N=q^k n^2$, with $q$ prime, $q \equiv k \equiv 1 \pmod{4}$, and gcd$(q,n)=1$. Dris conjectured that $q^k < n$. We first show that $q<n$ for all odd perfect…

Number Theory · Mathematics 2016-02-05 Patrick Brown

We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 5/8, then all sufficiently large odd positive integers can be written as the sum of three primes in A. The constant 5/8 in this statement…

Number Theory · Mathematics 2015-01-14 Xuancheng Shao

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

Number Theory · Mathematics 2014-08-08 Hao Pan , Zhi-Wei Sun

In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and…

Number Theory · Mathematics 2009-02-07 Byeong-Kweon Oh , Zhi-Wei Sun

We give a detailed proof, in the identically distributed case, of a conjecture of Feige about the maximum probability that the sum of n independent non-negative integer valued random variables, each of mean 1, exceeds n. The general case is…

Probability · Mathematics 2009-08-26 John H. Elton

The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s…

Number Theory · Mathematics 2017-05-30 Olivier Bordellès

In this paper, I proved that $$N=p_1+p_2+2p_3, p_1\sim N/2, p_2\sim N/2, p_3=o(N),$$ where $N$ is a large even number, and $p_i\ (i=1,2,3)$ are odd primes.

Number Theory · Mathematics 2014-04-15 Jin Li

Based on the propositional description of even Goldbach conjecture, in order to verify the truth of even Goldbach conjecture, we will deeply discuss this question and present a new computing model of $G{{N}_{e}}TM$ Turing Machine. This…

Computational Complexity · Computer Science 2021-12-30 Bogang Lin

Let $N$ be an odd perfect number. Let $\omega(N)$ be the number of distinct prime factors of $N$ and let $\Omega(N)$ be the total number of prime factors of $N$. We prove that if $(3,N)=1$, then $ \frac{302}{113}\omega - \frac{286}{113}…

Number Theory · Mathematics 2019-10-22 Joshua Zelinsky

We show that for any fixed base $a$, a positive proportion of primes have the property that they become composite after altering any one of their digits in the base $a$ expansion; the case $a=2$ was already established by Cohen-Selfridge…

Number Theory · Mathematics 2010-04-20 Terence Tao

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

General Mathematics · Mathematics 2017-01-10 Andrei Allakhverdov

Prime numbers, whose properties are important subjects in mathematics, are also fundamental in computer science notably in IT security, Cryptocurrencies as Bitcoin and Blockchain, cryptography, Code theory notably Error detection codes,…

General Mathematics · Mathematics 2023-11-21 Ahmed Asimi

For A,epsilon>0 and any sufficiently large odd n we show that for almost all k up to n^{1/5-epsilon} there exists a representation n=p1+p2+p3 with primes in residue classes b1,b2,b3 mod k for almost all admissible triplets b1,b2,b3 of…

Number Theory · Mathematics 2007-09-12 Karin Halupczok

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…

Number Theory · Mathematics 2021-06-29 Sean Bibby , Pieter Vyncke , Joshua Zelinsky

Hardy and Littlewood conjectured that every sufficiently large integer is either a square or the sum of a prime and a square. Let $E(x)$ be the number of positive integers up to $x\ge4$ which does not satisfy this condition. We prove…

Number Theory · Mathematics 2015-04-21 Yuta Suzuki

According to Goldbach conjecture, any even number can be broken up as the sum of two prime numbers : $n = p + q$. We construct a network where each node is a prime number and corresponding to every even number $n$, we put a link between the…

Number Theory · Mathematics 2009-11-11 Anjan Kumar Chandra , Subinay Dasgupta

We extend the Main Theorem of Aschbacher and Smith on Quillen's Conjecture from $p>5$ to the remaining odd primes $p = 3,5$. In the process, we develop further combinatorial and homotopical methods for studying the poset of nontrivial…

Group Theory · Mathematics 2022-04-28 Kevin I. Piterman , Stephen D. Smith

In this paper, we investigate sums of four squares of integers whose prime factorizations are restricted, making progress towards a conjecture of Sun that states that two of the integers may be restricted to the forms $2^a3^b$ and $2^c5^d$.…

Number Theory · Mathematics 2022-02-09 Soumyarup Banerjee

We consider the use of Goldbach numbers as random sequences. The randomness is analyzed in terms of the autocorrelation function of the sequence of number of partitions. The distinct representations of an even number n as the sum of two…

Cryptography and Security · Computer Science 2012-07-27 Krishnama Raju Kanchu , Subhash Kak
‹ Prev 1 8 9 10 Next ›