English
Related papers

Related papers: Vinogradov's theorem with almost equal summands

200 papers

In this paper, we prove a congruence which confirms a conjecture of Adamchuk. For any prime $p\equiv1\pmod3$ and $a\in\mathbb{Z}^{+}$, we have \begin{align*} \sum_{k=1}^{\frac{2}3(p^a-1)}\binom{2k}k\equiv0\pmod{p^2}. \end{align*}

Number Theory · Mathematics 2021-10-20 Guo-Shuai Mao

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Number Theory · Mathematics 2026-05-22 Wujie Shi

Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

Number Theory · Mathematics 2014-01-21 Ke Gong

Let $N$ denotes a sufficiently large even integer, $p$ denotes a prime and $P_{r}$ denotes an integer with at most $r$ prime factors. In this paper, we study the solutions of the equation $N-p=P_3$ and consider two special cases where $p$…

General Mathematics · Mathematics 2024-03-18 Runbo Li

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

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Number Theory · Mathematics 2018-04-25 Olivier Bordellès , Florian Luca , Pieter Moree , Igor E. Shparlinski

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

Number Theory · Mathematics 2012-02-20 Vladimir Shevelev

We consider the Linnik--Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we…

Number Theory · Mathematics 2026-05-19 Daniel R. Johnston , Tim Trudgian

Let n>=3 be an odd integer. For any integer a prime to n, define the permutation gamma_{a,n} of {1,...,(n-1)/2} by gamma_{a,n}(x)=n-\dec{ax}_n if {ax}_n>=(n+1)/2, and {ax}_n if {ax}_n<=(n-1)/2, where {x}_n denotes the least nonnegative…

Number Theory · Mathematics 2007-05-23 Hao Pan

A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…

Combinatorics · Mathematics 2018-04-20 Hong-Bin Chen , Hung-Lin Fu , Jun-Yi Guo

Given a family $\varphi= (\varphi_1, \ldots, \varphi_d)\in \mathbb{Z}[T]^d$ of $d$ distinct nonconstant polynomials, a positive integer $k\le d$ and a real positive parameter $\rho$, we consider the mean value $$ M_{k, \rho} (\varphi, N) =…

Classical Analysis and ODEs · Mathematics 2019-10-17 Changhao Chen , Igor E. Shparlinski

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

Number Theory · Mathematics 2007-05-23 D. R. Heath-Brown , J. -C. Puchta

In this paper, we prove certain theorems about three consecutive primes.

General Mathematics · Mathematics 2009-09-25 Tsutomu Hashimoto

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible…

Number Theory · Mathematics 2020-03-31 Min Zhang , Jinjiang Li

We prove that every integer greater than two may be written as the sum of a prime and a square-free number.

Number Theory · Mathematics 2014-10-29 Adrian Dudek

Let $p_n$ is the $n$-th prime. With help of the Cram\'er-like model, we prove that the set of intervals of the form $(2p_n,\enskip2p_{n+1})$ containing at list 3 primes has a positive density with respect to the set of all intervals of such…

Number Theory · Mathematics 2009-10-20 Vladimir Shevelev

For a positive integer $n>1$ denote by $\omega(n)$ the maximal possible number $k$ of different functions $f_1,\dots,f_k:\mathbb{Z}/n\mathbb{Z}\mapsto \mathbb{Z}/n\mathbb{Z}$ such that each function $f_i-f_j,i<j$, is bijective. Recently A.…

Combinatorics · Mathematics 2019-01-03 D. Cherkashin , F. Petrov , V. Sokolov

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold…

Number Theory · Mathematics 2016-01-20 Terence Tao

We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n}…

Combinatorics · Mathematics 2019-01-31 Darij Grinberg

In this paper we will propose a strategy to prove Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two primes.

General Mathematics · Mathematics 2010-12-30 Danilo Mauro