English
Related papers

Related papers: Almost prime numbers

200 papers

Let $m>2$ and $q>0$ be integers with $m$ even or $q$ odd. We show the supercongruence $$\sum_{k=0}^{p-1}(-1)^{km}\binom{p/m-q}{k}^m\equiv0\pmod{p^3}.$$ for any prime $p>mq$. This confirms a conjecture of Sun.

Number Theory · Mathematics 2015-04-29 Xiang-Zi Meng , Zhi-Wei Sun

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

Number Theory · Mathematics 2019-02-20 Kaisa Matomäki , Xuancheng Shao

Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.

Number Theory · Mathematics 2018-10-26 J. LaChapelle

In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…

History and Overview · Mathematics 2019-01-01 Sandeep Silwal

A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…

Number Theory · Mathematics 2019-08-27 William Banks , Paul Pollack , Carl Pomerance

In this note, we approximate the average of prime powers in the decomposition of $n!$ into prime numbers.

Number Theory · Mathematics 2011-11-09 Mehdi Hassani

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…

Representation Theory · Mathematics 2026-05-07 Gunter Malle , Gabriel Navarro , Pham Huu Tiep

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof of the more…

General Mathematics · Mathematics 2016-06-20 N. A. Carella

We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the following asymptotic result:…

Information Theory · Computer Science 2007-11-06 Ioannis Kontoyiannis

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

Number Theory · Mathematics 2025-04-14 Daniel R. Johnston , Valeriia V. Starichkova

In paper on a classification of Lehmer triples, Juricevic conjectured that there are infinitely many primes of special form. We disprove one of his conjectures and consider the other one.

Number Theory · Mathematics 2010-04-09 Yu Tsumura

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

General Mathematics · Mathematics 2007-05-23 Leo Liberti

Let p be a prime number, and let K be a number field. For p=2, assume moreover K totally imaginary. In this note we prove the existence of asymptotically good extensions L{K of cohomological dimension 2 in which infinitely many primes split…

Number Theory · Mathematics 2020-02-26 Oussama Hamza , Christian Maire

We apply the Inclusion-Exclusion Principle to a unique pair of prime number subsequences to determine whether these subsequences form a small set or a large set and thus whether the infinite sum of the inverse of their terms converges or…

General Mathematics · Mathematics 2024-02-21 Michael P. May

We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…

Combinatorics · Mathematics 2022-10-28 Cheryl E. Praeger , Enoch Suleiman

Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…

General Mathematics · Mathematics 2007-05-23 Metin Aktay

There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…

Number Theory · Mathematics 2008-06-06 Jacob Korevaar

Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set…

Number Theory · Mathematics 2023-05-03 José Manuel Rodríguez Caballero

We introduce the notions of almost positively closed models and positive strong amalgamation property. We study the fundamental properties of these notions and develop some interactions between them.

Logic · Mathematics 2022-12-05 Mohammed Belkasmi

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

Number Theory · Mathematics 2020-03-23 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini