Y. Simsek, D. Kim, T. Kim, S. -H. Rim
In this paper we construct the q-analogue of Barnes' Bernoulli numbers and plynomials of degree 2, which is an answer to a part of Schlosser's question. Finally, we treat the q-analogue of the sums of powers of consecutive integrs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
Following an idea due to J. Bernoulli, we explore the q-analogue of the sums of powers of consecutive integers.
We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.
Expressing three consecutive integers as sums of three cubes
本文研究将连续整数表示为三个立方数之和的问题，给出三个连续整数的若干参数化解，并讨论五至七个连续整数的平凡解，最后提出四个及以上连续整数的开放问题。
Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.
In this paper we construct $q$-Genocchi numbers and polynomials. By using these numbers and polynomials, we investigate the $q$-analogue of alternating sums of powers of consecutive integers due to Euler.
In this paper we construct a new q-Euler numbers and polynomials. By using these numbers and polynomials, we give the interesting formulae related to alternating sums of powers of consecutive q-integers following an idea due to Euler.
We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.
Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and Zhongfeng Zhang. In particular Stroeker determined all squares that can be written as a sum of at most $50$ consecutive cubes. We generalize Stroeker's work by determining all perfect powers that are sums of at most $50$ consecutive cubes. Our methods include descent, linear forms in two logarithms, and Frey-Hellegouarch curves.
We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.
In this paper we construct the $q$-analogue of Barnes's Bernoulli numbers and polynomials of degree 2, for positive even integers, which is an answer to a part of Schlosser's question. For positive odd integers, Schlosser's question is still open. Finally, we will treat the $q$-analogue of the sums of powers of consecutive integers.
In a surprising recent work, Lemke Oliver and Soundararajan noticed how experimental data exhibits erratic distributions for consecutive pairs of primes in arithmetic progressions, and proposed a heuristic model based on the Hardy--Littlewood conjectures containing a large secondary term, which fits the data very well. In this paper, we study consecutive pairs of sums of squares in arithmetic progressions, and develop a similar heuristic model based on the Hardy--Littlewood conjecture for sums of squares, which also explain the biases in the experimental data. In the process, we prove several …
We show that the diophantine equation $n^\ell+(n+1)^\ell + ...+ (n+k)^\ell=(n+k+1)^\ell+ ...+ (n+2k)^\ell$ has no solutions in positive integers $k,n \ge 1$ for all $\ell \ge 3$.
Let $k \ge 2$ be even, and let $r$ be a non-zero integer. We show that for almost all $d \ge 2$ (in the sense of natural density), the equation $$ x^k+(x+r)^k+\cdots+(x+(d-1)r)^k=y^n, \qquad x,~y,~n \in \mathbb{Z}, \qquad n \ge 2, $$ has no solutions.
Positive density for consecutive runs of sums of two squares
本文研究了两个平方数之和的连续序列在等差数列中的分布，证明对于任意奇数无平方因子模数和简化同余类，存在正密度的此类连续序列，这是 Maynard 素数序列结果的类比。
We study the surface arising from the diophantine equation $m^3+(m+1)^3+...+(m+k-1)^3=l^2$. It turns out that this is a $K3$ surface with Picard number 20. We stduy its aritmetic properties in detail. We construct elliptic fibrations on it, and we find a parametric solution to the original equation. Also, we determine the Hasse-Weil zeta function of the surface over $Q$.
Arithmetic Polygons and Sums of Consecutive Squares
本文研究了算术多边形与连续平方和的关系，证明了对于奇数N≥3存在至少一个N边算术多边形，并展示了存在无限多个偶数边的算术多边形。
In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which permits an easy description but fails to distinguish many patterns that have seemingly very different frequencies. There was a secondary factor in our conjecture accounting for this additional variation, but it was given only by a complicated expression whose distribution was not easily understood. Here, we study this term, which proves to be connected to bot…
We give a new short proof of the most simple relation between consecutive power sums of the first m positive integers.
Let $S_k(m):=1^k+2^k+\cdots+(m-1)^k$ denote a power sum. In 2011 Bernd Kellner formulated the conjecture that for $m\ge 4$ the ratio $S_k(m+1)/S_k(m)$ of two consecutive power sums is never an integer. We will develop some techniques that allow one to exclude many integers $ρ$ as a ratio and combine them to exclude the integers $3\le ρ\le 1501$ and, assuming a conjecture on irregular primes to be true, a set of density $1$ of ratios $ρ$. To exclude a ratio $ρ$ one has to show that the Erdős-Moser type equation $(ρ-1)S_k(m)=m^k$ has no non-trivial solutions.
Considering the problem of finding all the integer solutions of the sum of $M$ consecutive integer squares starting at $a^{2}$ being equal to a squared integer $s^{2}$, it is shown that this problem has no solutions if $M\equiv3,5,6,7,8$ or $10 (mod\,12)$ and has integer solutions if $M\equiv0,9,24$ or $33 (mod\,72)$; or $M\equiv1,2$ or $16 (mod\,24)$; or $M\equiv11 (mod\,12)$. All the allowed values of $M$ are characterized using necessary conditions. If $M$ is a square itself, then $M\equiv1 (mod\,24)$ and $(M-1)/24$ are all pentagonal numbers, except the first two.
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
On sums of powers of consecutive squares over finite fields, and sums of distinct values of polynomials
本文研究有限域中连续元素为平方或非平方时的幂和，并将其用于计算四次多项式 X^4+aX^2+b 的像集元素之和，解决了两个已有猜想。
All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the difference and sum of the triangular numbers of $\left(a+M-1\right)$ and $\left(a-1\right)$ in the product of their greatest common divisor $g$ and remaining square factors $δ^{2}$ and $σ^{2}$, yielding $c=gδσ$. Further, the condition that $g$ must be integer for several particular and general cases yield generalized Pell equations whose solutions allow to find all …
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by their lengths and introduce the concept of length spectrum. Also, we use diagrams to illustrate the ideas behind our proofs.
Using only elementary arguments, Cassels solved the Diophantine equation $(x-1)^3+x^3+(x+1)^3=z^2$ in integers $x$, $z$. The generalization $(x-1)^k+x^k+(x+1)^k=z^n$ (with $x$, $z$, $n$ integers and $n \ge 2$) was considered by Zhongfeng Zhang who solved it for $k=2$, $3$, $4$ using Frey-Hellegouarch curves and their Galois representations. In this paper, by employing some sophisticated refinements of this approach, we show that the only solution for $k=5$ is $x=z=0$, and that there are no solutions for $k=6$. The chief innovation we employ is a computational one, which enables us to avoid the…
Sums of $M$ consecutive squared integers $\left(a+i\right)^{2}$ equaling squared integers (for $a\geq1$, $0\leq i\leq M-1$) yield certain linear groupings of pairs $\left(a_{1},a_{2}\right)$ of $a$ values for successive same values of $M$ when these are linked by $a_{1}+a_{2}=μM+1$ with $μ=\left(η/δ\right)\in\mathbb{\mathbb{Q}}^{+}$. In this paper, congruent conditions on $M,η,δ$, and on the difference $\left(a_{2}-a_{1}\right)$ are demonstrated for these linear groupings to hold. It is found that $η\equiv1\left(mod\,2\right)$ and $δ\equiv0,1$ or $5\left(mod\,6\right)$, and if $δ\equiv0\left(m…
We show that Euler's relation and the Taxi-Cab relation are both solutions of the same equation. General solutions of sums of two consecutive cubes equaling the sum of two other cubes are calculated. There is an infinite number of relations to be found among the sums of two consecutive cubes and the sum of two other cubes, in the form of two families. Their recursive and parametric equations are calculated.
The problem of finding all the integer solutions in $a$, $M$ and $s$ of sums of $M$ consecutive integer squares starting at $a^{2}\geq1$ equal to squared integers $s^{2}$, has no solutions if $M\equiv3,5,6,7,8$ or $10\left(mod\,12\right)$ and has integer solutions if $M\equiv0,9,24% or %33\left(mod\,72\right)$; or $M\equiv1,2$ or $16\left(mod\,24\right)$; or $M\equiv11\left(mod\,12\right)$. In this paper, additional congruence conditions are demonstrated on the allowed values of $M$ that yield solutions to the problem by using Beeckmans' eight necessary conditions, refining further the possibl…
We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high probability there are $(\frac{1+e^{-2}}{4} +o(1)) n^2$ such sums. This answers an old question of Erdős and Harzheim. We also obtain non-trivial bounds on the maximum possible number of distinct sums, ranging over all permutations of $1,2,\dots,n$. We close with some questions concerning the minimal possible number of distinct sums.
Sharpening (a particular case of) a result of Szemeredi and Vu and extending earlier results of Sarkozy and ourselves, we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset to contain a block of consecutive integers of length, comparable with the lengths of the set summands. A corollary of our main result is as follows. Let $k,l\ge 1$ and $n\ge 3$ be integers, and suppose that $A_1,...,A_k\subset[0,l]$ are integer sets of size at least $n$, none of which is contained in an arithmetic progression with difference greater than 1.…
Consecutive runs of sums of two squares
本文研究两个平方数之和序列在算术级数中的连续分布，证明了在可容许同余类条件下，任意长度三段的同余模式以及两段任意长度的同余模式均可出现无穷多次。
For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$ 2S_{2k+1}(n)- (2k+1)nS_{2k}(n)\equiv \{{array}{ll} 0\,(\bmod{\,n^3}) & {\rm if}\,\,k\,\,{\rm is\,\,even\,\,or}\,\, n\,\, {\rm is\,\, odd} & {\rm or} \,\, n\equiv 0\,(\bmod{\,4}) \frac{n^3}{2}\,(\bmod{\,n^3}) & {\rm if}\,\,k\,\,{\rm is\,\, odd} &,\,{\rm and}\,\, n\equiv 2\,(\bmod{\,4}). {array}.$$ The above congruence allows us to state an equivalent formulati…
Consecutive Cycle Sums
本文研究将数字1至n排列在n-循环上，哪些数可表示为连续数字之和，并证明当n≥8时，n-循环不完备。
Fibonacci Numbers as Sums of Consecutive Terms in $k$-Generalized Fibonacci Sequence
本文研究 $k$-广义斐波那契数列连续项之和何时为斐波那契数，证明对 $k\geq3$ 此类情形仅有有限多个，并推出两类数列交集有限。
A note on three consecutive powerful numbers
本文通过佩尔方程、椭圆曲线和二阶递推，证明了不存在中间项为完全立方数且两端各仅含一个奇次幂质因数的三个连续幂数三元组。
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 cubes. Recently, the equation $(x-r)^k + x^k + (x+r)^k$ has been studied for $k=4$ by Zhongfeng Zhang and for $k=2$ by Koutsianas. In this paper, we complement the work of Cassels, Koutsianas and Zhang by considering the case when $k=3$ and showing that the equation $(x-r)^3+x^3+(x+r)^3=y^n$ with $n\geq 5$ a prime and $0 < r \leq 10^6$ only has trivial solu…
In this paper we consider Dedekind type DC sums and prove receprocity laws related to DC sums.
Assuming the Riemann Hypothesis, we show that infinitely often consecutive non-trivial zeros of the Riemann zeta-function differ by at most 0.5155 times the average spacing and infinitely often they differ by at least 2.69 times the average spacing.
In 2021, Guyer and Mbirika gave two equivalent formulas that computed the greatest common divisor (GCD) of all sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In this current paper, we extend their results to the GCD of all sums of $k$ consecutive squares of these numbers. Denoting these GCD values by the symbol $\mathcal{G}_{G_0, G_1}^2\!(k)$, we prove $\mathcal{G}_{G_0, G_1}^2\!(k) = \gcd\left(G_k G_{k+1} - G_0 G_1,\; G_{k+1}…
We explore the sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In particular, we give precise values for the greatest common divisor (GCD) of all sums of $k$ consecutive terms of $\left(G_n\right)_{n \geq 0}$. When $G_0 = 0$ and $G_1 = 1$, we yield the GCD of all sums of $k$ consecutive Fibonacci numbers, and when $G_0 = 2$ and $G_1 = 1$, we yield the GCD of all sums of $k$ consecutive Lucas numbers. Denoting the GCD of all sum…
Let $α, β\geq 0$ and $α+ β< 1$. In this short note, we show that $\liminf_{n \to \infty} p_n^β(p_{n+1}^α- p_n^α) = 0$, where $p_n$ is the $n$th prime. This notes an improvement over results of Sándor and gives additional evidence towards a conjecture of Andrica. This follows directly from recent results on prime pairs from Maynard, Tao, Zhang.
Let $n$ be a non-negative integer and put $p_{n}(x)=\prod_{i=0}^{n}(x+i)$. In the first part of the paper, for given $n$, we study the existence of integer solutions of the Diophantine equation $$ y^m=p_{n}(x)+\sum_{i=1}^{k}p_{a_{i}}(x), $$ where $m\in\N_{\geq 2}$ and $a_{1}<a_{2}<\ldots <a_{k}<n$. This equation can be considered as a generalization of the Erdős-Selfridge Diophantine equation $y^m=p_{n}(x)$. We present some general finiteness results concerning the integer solutions of the above equation. In particular, if $n\geq 2$ with $a_{1}\geq 2$, then our equation has only finitely many …
Note on large quadratic character sums
本文在广义黎曼假设下，证明了二次狄利克雷特征和存在大值的Omega结果，深化了对该特征和极值行为的理解。
An Algorithm to Find Sums of Powers of Consecutive Primes
提出一种枚举可表示为连续素数 $k$ 次幂之和的整数 $n\le x$ 的算法，证明其渐近计数界与运行时间界，并给出同量级下界及快速计数算法，扩展了前人关于连续素数平方和的研究。
it is the purpose of this paper to construct a p-adic continuous function for an odd prime to contain a p-adic q-analogue of higher order Dedekind type sums related to q-Euler polynomials and numbers.
Generalization of Ramanujan's formula for sums of half-integer powers of consecutive integers via formal Bernoulli series
本文通过形式Bernoulli级数推广了Ramanujan关于连续整数半整数次幂求和的公式，扩展了原有结果到所有正半整数次幂。
Pell and associated Pell braid sequences as GCDs of sums of $k$ consecutive Pell, balancing, and related numbers
研究了六个著名序列（Pell、相伴Pell、平衡及相关数）中$k$个连续项之和的最大公约数，给出了依赖$k$的闭式，并发现其可表示为Pell和相伴Pell辫序列，同时探讨了平方项之和的GCD问题。
For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with $N$ consecutive Fermat quotients that is nontrivial for $N\ge p^{1/2+ε}$ for any fixed $ε>0$. We use a recent idea of M. Z. Garaev together with a form of the large sieve inequality due to S. Baier and L. Zhao, to show that on average over $p$ one can obtain a nontrivial estimate for much shorter sums starting with $N\ge p^ε$. We also obtain lower bounds on …
We give a simple proof and a multivariable generalization of an identity due to E. Alkan concerning a weighted average of the Ramanujan sums. We deduce identities for other weighted averages of the Ramanujan sums with weights concerning logarithms, values of arithmetic functions for gcd's, the Gamma function, the Bernoulli polynomials, and binomial coefficients.
On a problem of Erdős and Graham about consecutive sums in strictly increasing sequences
本文证明了存在常数c>0，使得对任意正整数n，可选取1到n间的递增序列，其连续子段和的不同值至少为cn^2个，回答了Erdős和Graham的问题，并给出上界及解决若干开放问题。
Kannan Soundararajan recently obtained a new estimate, conditional to the Riemann hypothesis, for the summatory function of the Mobius function. In this expository article we describe his method, with detailed computations.
In this note, we provide refined estimates of the following sums involving the Euler totient function: $$\sum_{n\le x} ϕ\left(\left[\frac{x}{n}\right]\right) \qquad \text{and} \qquad \sum_{n\le x} \frac{ϕ([x/n])}{[x/n]}$$ where $[x]$ denotes the integral part of real $x$. The above summations were recently considered by Bordellès et al. and Wu.
The Ohno relation is a well-known relation among multiple zeta values. Hirose, Onozuka, Sato, and the author investigated the sum related to the Ohno relation and presented two types of new relations and five conjectural formulas. This paper proves one of these formulas.
$q$-analogues of sums of consecutive powers of natural numbers and extended Carlitz $q$-Bernoulli numbers and polynomials
本文通过构造经典Appell序列的q-模拟框架，扩展了Carlitz q-Bernoulli数与多项式，并利用第二类q-Stirling数给出其显式级数表示和新连接公式。
A Note on Sun's Conjectures on Apéry-like Sums Involving Lucas Sequences and Harmonic Numbers
本文利用Davydychev--Kalmykov的相关结果，证明了Zhi-Wei Sun提出的关于涉及Lucas序列与调和数的类Apéry和的四个猜想恒等式。
Following the work of Hildebrand we improve the Po'lya- Vinogradov inequality in a specific range, we also give a general result that shows its dependency on Burgess bound and at last we improve the range of validity for a special case of Burgess' character sum estimate.
An elementary note on three consecutive powerful numbers
本文利用初等方法及相关数论结果，推广了T. H. Chan关于三个连续幂数的结论，讨论了若干丢番图方程的解。
A note on weighted consecutive Davenport constant
该研究定义了加权连续达文波特常数${\sf C}_A(G)$，证明了两类群下该常数的取值结果，推进了零和序列理论中相关常数的研究。
Effective Estimates for a Class of Farey Fraction Sums and Bounds for Mundici-Type Constants
本文推广了Mundici猜想中关于Farey分数间距平方和的界到子区间和h-间距，并得到了相应的Mundici型常数界。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。