相关论文: A Conjecture on Primes and a Step towards Justific…

We survey the classical results on the prime number theorem

We study a special set of constellations of primes generated by twin primes.

Dickson conjectured that a set of polynomials will take on infinitely many simultaneous prime values. Later others, such as Hardy and Littlewood, gave estimates for the number of these primes. In this article we look at this conjecture,…

We give an account of the arguments that lead from the assumption of the existence of exceptional characters to the asymptotics in related ranges for the counting function of twin primes.

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

Robin's Conjecture is strengthened, deformed, and proved. Nicolas conjecture follows.

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

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…

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…

This article is a survey based on our earlier paper ("The 'Vertical' Generalization of the Binary Goldbach's Conjecture as Applied on 'Iterative' Primes with (Recursive) Prime Indexes (i-primeths)" [11]), a paper in which we have proposed a…

This is an extension and background to a talk I gave on 9 October 2013 to the Brown Graduate Student Seminar, called `A friendly intro to sieves with a look towards recent progress on the twin primes conjecture.' During the talk, I mention…

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

This article seeks to encourage a mathematical dialog regarding a possible solution to Beals Conjecture. It breaks down one of the worlds most difficult math problems into laymans terms and encourages people to question some of the most…

By creating a new method, the author proved the well-known world's baffling problems Goldbach conjecture, twin primes conjecture, the Proposition (C) and the Proposition $n^2+1$.

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…

We propose a new refinement of the McKay conjecture and we prove it for symmetric groups.

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

We formulate, using heuristic reasoning, precise conjectures for the range of the number of primes in intervals of length $y$ around $x$, where $y\ll (\log x)^2$. In particular we conjecture that the maximum grows surprisingly slowly as $y$…