English
Related papers

Related papers: On the solutions to a power sum problem

200 papers

In this paper two conjectures are proposed based on which we can prove the first case of Fermat's Last Theorem(FLT) for all primes $p \equiv -1 (\bmod~6)$. With Pollaczek's result {\bf [1]} and the conjectures the first case of FLT can be…

History and Overview · Mathematics 2007-05-23 Joseph Amal Nathan

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

Number Theory · Mathematics 2025-09-19 Pierre-Alexandre Bazin

Let $k \in \mathbb{N}$ and suppose we are given $k$ integers $1 \leq a_1, \dots, a_k \leq n$. If $\sqrt{a_1} + \dots + \sqrt{a_k}$ is not an integer, how close can it be to one? When $k=1$, the distance to the nearest integer is $\gtrsim…

Number Theory · Mathematics 2024-03-08 Stefan Steinerberger

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

Number Theory · Mathematics 2010-02-25 Li-Lu Zhao , Zhi-Wei Sun

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many…

Number Theory · Mathematics 2018-11-13 Zhi-Wei Sun

Let $p_n$ denote the $n$-th prime number, $\{q_n\}$ be a sequence of positive numbers and $x\in\mathbb{R}$. In this note we prove that the inequality $$q_n p_{n+1}^{x}-q_{n+1}p_{n}^{x}<p_{n}^{x}p_{n+1}^{x-1}, $$ holds for infinitely many…

Number Theory · Mathematics 2017-12-11 Douglas Azevedo , Tiago Reis

The Franel numbers are defined by $ f_n=\sum_{k=0}^n {n\choose k}^3. $ Motivated by the recent work of Z.-W. Sun on Franel numbers, we prove that \begin{align*} \sum_{k=0}^{n-1}(3k+1)(-16)^{n-k-1} {2k\choose k} f_k &\equiv…

Number Theory · Mathematics 2014-04-29 Victor J. W. Guo

This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…

Number Theory · Mathematics 2013-10-11 Joel Beeren , David Harvey , Tim Trudgian

The numbers $R_n$ and $W_n$ are defined as \begin{align*} R_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{1}{2k-1},\ \text{and}\ W_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}\frac{3}{2k-3}. \end{align*} We prove that, for any positive…

Number Theory · Mathematics 2015-01-06 Victor J. W. Guo , Ji-Cai Liu

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

Combinatorics · Mathematics 2018-02-12 Aaron Robertson

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

Number Theory · Mathematics 2007-07-25 Zhi-Wei Sun , Donald M. Davis

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

Number Theory · Mathematics 2023-05-10 Bin Wei , Trevor D. Wooley

In this paper, using the well-known Karlsson-Minton formula, we mainly establish two divisibility results concerning truncated hypergeometric series. Let $n>2$ and $q>0$ be integers with $2\mid n$ or $2\nmid q$. We show that…

Number Theory · Mathematics 2020-02-25 Chen Wang , Wei Xia

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

Number Theory · Mathematics 2013-11-20 Salvatore Tringali

For $k$ a positive integer let $S_k(n) = 1^k + 2^k + \cdots + n^k$, i.e., $S_k(n)$ is the sum of the first $k$-th powers. Faulhaber conjectured (later proved by Jacobi) that for $k$ odd, $S_k(n)$ could be written as a polynomial of…

Number Theory · Mathematics 2020-09-08 Steven J. Miller , Enrique Treviño

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Number Theory · Mathematics 2019-04-01 Lucile Devin

We study the Hilbert series of a family of ideals J_\phi generated by powers of linear forms in k[x_1,...,x_n]. Using the results of Emsalem-Iarrobino, we formulate this as a question about fatpoints in P^{n-1}. In the three variable case…

Algebraic Geometry · Mathematics 2007-05-23 Hal Schenck

Using only elementary arguments, Cassels and Uchiyama (independently) determined all squares that are sums of three consecutive cubes. Zhongfeng Zhang extended this result and determined all perfect powers that are sums of three consecutive…

Number Theory · Mathematics 2017-11-20 Alejandro Argáez-García , Vandita Patel

Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative integers with $k_1\le k_2$. In this paper,…

Number Theory · Mathematics 2025-06-05 Ji-Zhen Xu , Yong-Gao Chen