English
Related papers

Related papers: (k+1)-sums versus k-sums

200 papers

Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove…

Number Theory · Mathematics 2024-02-05 Muhammet Boran , John Byun , Zhangze Li , Steven J. Miller , Stephanie Reyes

In this paper, we mainly prove a congruence conjecture of Z.-W. Sun \cite{Sjnt}: Let $p>5$ be a prime. Then $$ \sum_{k=(p+1)/2}^{p-1}\frac{\binom{2k}k^2}{k16^k}\equiv-\frac{21}2H_{p-1}\pmod{p^4}, $$ where $H_n$ denotes the $n$-th harmonic…

Number Theory · Mathematics 2026-01-26 Guo-Shuai Mao

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

Combinatorics · Mathematics 2007-05-23 J. Solymosi

We consider the integers having the property of reversing when multiplied by a specific integer k. First, we proved that k should be either 1, 4 or 9. Second, we classify these integers as (10, 1)- reverse multiples, (10, 4)- reverse…

General Mathematics · Mathematics 2015-04-21 Madline Al- Tahan

Let $n$ and $k$ be positive integers with $n>k$. Given a permutation $(\pi_1,\ldots,\pi_n)$ of integers $1,\ldots,n$, we consider $k$-consecutive sums of $\pi$, i.e., $s_i:=\sum_{j=0}^{k-1}\pi_{i+j}$ for $i=1,\ldots,n$, where we let…

Combinatorics · Mathematics 2019-05-28 Akihiro Higashitani , Kazuki Kurimoto

Let $\{a_{1}, a_{2},\ldots, a_{n},\ldots\}$ be a sequence of complex numbers which has at most polynomial growth and satisfies an extra assumption. In this paper, inspired by a recent work of Sasane, we give an explanation of the sum…

Number Theory · Mathematics 2023-05-04 Su Hu , Min-Soo Kim

We study the extent to which sets A in Z/NZ, N prime, resemble sets of integers from the additive point of view (``up to Freiman isomorphism''). We give a direct proof of a result of Freiman, namely that if |A + A| < K|A| and |A| < c(K)N…

Number Theory · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

Dynamical Systems · Mathematics 2025-09-16 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set $A$ is the number of representations of a nonnegative integer $n$ as the sum of $k$ terms from $A$. Let $A(n)$…

Number Theory · Mathematics 2023-03-03 Sándor Z. Kiss , Csaba Sándor , Quan-Hui Yang

The aim of this paper is to prove wordlessly the sum formula of $1^{k}+2^{k}+\ldots +n^{k}$, $k\in\{1,2,3\}$.

History and Overview · Mathematics 2022-06-16 Bikash Chakraborty

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Combinatorics · Mathematics 2026-04-29 Alexander Povolotsky

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$,…

Number Theory · Mathematics 2020-12-23 Jun-Yu Zhou , Quan-Hui Yang

We present several new inequalities for trigonometric sums. Among others, we show that the inequality $$ \sum_{k=1}^n (n-k+1)(n-k+2)k\sin(kx) > \frac{2}{9} \sin(x) \bigl( 1+2\cos(x) \bigr)^2 $$ holds for all $n\geq 1$ and $x\in (0,…

Classical Analysis and ODEs · Mathematics 2023-07-11 Horst Alzer , Man Kam Kwong

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

Number Theory · Mathematics 2013-04-23 Darren Glass

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Number Theory · Mathematics 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson

In this paper, we study a density version of the Waring-Goldbach problem. Suppose that A is a subset of the primes, and the lower density of A in the primes is larger than 1-1/2k. We prove that every sufficiently large natural number n…

Number Theory · Mathematics 2023-12-19 Meng Gao

Sums over inverse s-th powers of semiprimes and k-almost primes are transformed into sums over products of powers of ordinary prime zeta functions. Multinomial coefficients known from the cycle decomposition of permutation groups play the…

Number Theory · Mathematics 2009-09-30 Richard J. Mathar

The number of $k$-roots of an arbitrary permutation is expressed as an alternating sum of $\mu$-unimodal $k$-roots of the identity permutation.

Combinatorics · Mathematics 2014-09-18 Yuval Roichman

It is well known that if S is a subset of the integers mod p, and if the second-largest Fourier coefficient is ``small'' relative to the largest coefficient, then the sumset S+S is much larger than S. We show in the present paper that if…

Combinatorics · Mathematics 2007-11-28 Ernie Croot , Tomasz Schoen

We recall a proof of Euler's identity $\sum_{n=1}^{\infty} \frac{1}{n^2}=\frac{\pi^2}{6}$ involving the evaluation of a double integral. We extend the method to find Hurwitz Zeta series of the form $S(k,a)=\sum_{n \in \mathbb{Z}}…

Classical Analysis and ODEs · Mathematics 2019-03-11 Vivek Kaushik
‹ Prev 1 4 5 6 7 8 10 Next ›