Related papers: Folkman's theorem and the primes

We give an abstract approach to finite Ramsey theory and prove a general Ramsey-type theorem. We deduce from it a self-dual Ramsey theorem, which is a new result naturally generalizing both the classical Ramsey theorem and the dual Ramsey…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

We give a proof for the fundamental theorem of algebra,using the Fredholm index phenomena

In this note we prove an inequality involving primes and the product of consecutive primes.

In this article we prove that equation $\phi(x)=n$, for a fixed $n$, admits a finite number of solutions, we find the general form of these solutions, and we show that: if $x_0$ is a unique solution of this equation then $x_0$ is a product…

In this paper we prove, on the Riemann hypothesis, the existence of such increments of the Ingham integral (1932) that generate new functionals together with corresponding new $P\zeta$-equivalents of the Fermat-Wiles theorem. We obtain also…

We proved that there are infinitely many pairs of twin prime.

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,…

Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…

In this article we study in depth the Dirichlet theorem, which states that if a, b are relative prime integers, the sequence p = an + b contains infinite prime numbers, we simplify and generalize this theorem, we enunciate some special…

We proved that there are infinitely many cousin primes.

Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.

A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical…

In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

The number of primes of a kind x^2+1 is infinite.

We use the model theoretic notion of coheir to give short proofs of old and new theorems in Ramsey Theory. As an illustration we start from Ramsey's theorem itself. Then we prove Hindman's theorem and the Hales-Jewett theorem. Finally, we…

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…