Related papers: Squares in arithmetic progressions and infinitely …

We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.

Pirillo and Varricchio, and independently, Halbeisen and Hungerbuhler considered the following problem, open since 1994: Does there exist an infinite word w over a finite subset of Z such that w contains no two consecutive blocks of the…

B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…

This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

Let $n$ be a squarefree positive odd integer. We will show that there exist infinitely many imaginary quadratic number fields with discriminant divisible by $n$ and-at the same time-having an element of order $n$ in the class group. We then…

In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results.

Lagrange's four-square theorem states that every natural number $n$ can be represented as the sum of four integer squares: $n=x_1^2+x_2^2+x_3^2+x_4^2$. Ramanujan generalized Lagrange's result by providing, up to equivalence, all $54$…

In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

A simpler proof of the four color theorem is presented. The proof was reached using a series of equivalent theorems. First the maximum number of edges of a planar graph is obatined as well as the minimum number of edges for a complete…

Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of…

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

In this short note we establish new refinements of multidimensional Szemeredi and polynomial van der Waerden theorems along the shifted primes.

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

We obtain a double exponential bound in Brauer's generalisation of van der Waerden's theorem, which concerns progressions with the same colour as their common difference. Such a result has been obtained independently and in much greater…

Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related…

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

It is easy to find a right-angled triangle with integer sides whose area is 6. There is no such triangle with area 5, but there is one with rational sides (a `\emph{Pythagorean triangle}'). For historical reasons, integers such as 6 or 5…

Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that $\frac32\Delta+1$ colors are sufficient…