English
Related papers

Related papers: Integer Powers Expressed as Nested Sums of Lower P…

200 papers

Let $I(b,d,k)$ be the subseries of the harmonic series keeping the integers having exactly $k$ occurrences of the digit $d$ in base $b$. We prove the existence of an asymptotic expansion to all orders in descending powers of $b$, for fixed…

Number Theory · Mathematics 2026-01-16 Jean-François Burnol

In 1851 Prouhet showed that when $N=j^{k+1}$ where $j$ and $k$ are positive integers, $j \geq 2$, the first $N$ consecutive positive integers can be separated into $j$ sets, each set containing $j^k$ integers, such that the sum of the…

Number Theory · Mathematics 2019-08-30 Ajai Choudhry

We prove several power series identities involving the refined generating function of interval orders, as well as the refined generating function of the self-dual interval orders. These identities may be expressed as $\sum_{n\ge…

Combinatorics · Mathematics 2013-09-27 George E. Andrews , Vít Jelínek

This paper studies power indices based on average representations of a weighted game. If restricted to account for the lack of power of dummy voters, average representations become coherent measures of voting power, with power distributions…

Computer Science and Game Theory · Computer Science 2017-10-10 Serguei Kaniovski , Sascha Kurz

In this paper, we derive eight basic identities of symmetry in three variables related to Bernoulli polynomials and power sums. These and most of their corollaries are new, since there have been results only about identities of symmetry in…

Number Theory · Mathematics 2010-03-18 Dae San Kim , Kyoung Ho Park

Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…

Number Theory · Mathematics 2014-09-30 Jakub Byszewski , Maciej Ulas

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…

Combinatorics · Mathematics 2010-09-21 Giuseppe Scollo

The explicit formulas for the sums of positive powers of the integers $s_i$ unrepresentable by the triple of integers $d_1,d_2,d_3\in {\mathbb N}, \gcd(d_1,d_2,d_3)=1$, are derived.

Number Theory · Mathematics 2007-05-23 Leonid G. Fel , Boris Y. Rubinstein

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

Number Theory · Mathematics 2024-01-04 Yuhui Liu

Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…

Number Theory · Mathematics 2022-04-25 Roudy El Haddad

We present a remarkably simple and surprisingly natural interpretation of the values of zeta functions at negative integers and zero. Namely we are able to relate these values to areas related to partial sums of powers. We apply these…

Number Theory · Mathematics 2022-09-12 Ján Mináč , Nguyen Duy Tân , Nguyen Tho Tung

The problem of simplicity of Fermat number-twins $f_{n}^{\pm}=2^{2^n}\pm3$ is studied. The question for what $n$ numbers $f_{n}^{\pm}$ are composite is investigated. The factor-identities for numbers of a kind $x^2 \pm k $ are found.

General Mathematics · Mathematics 2007-07-09 Boris V. Tarasov

The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)

Number Theory · Mathematics 2021-09-22 Robert J Sibner

A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…

Statistical Mechanics · Physics 2009-11-10 V. I. Yukalov , S. Gluzman , D. Sornette

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

Number Theory · Mathematics 2014-10-01 Jhon J. Bravo , Carlos A. Gómez , Florian Luca

We study the decomposition of tensor powers of two dimensional irreducible representations of quantum $\mathfrak{sl}_2$ at even roots of unity into direct sums of tilting modules. We derive a combinatorial formula for multiplicity of…

Representation Theory · Mathematics 2024-07-30 Anna Lachowska , Olga Postnova , Nicolai Reshetikhin , Dmitry Solovyev

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

Number Theory · Mathematics 2023-05-09 José L. Cereceda

We show that the generalized Fermat equations with signatures (5,5,7), (5,5,19), and (7,7,5) (and unit coefficients) have no non-trivial primitive integer solutions. Assuming GRH, we also prove the nonexistence of non-trivial primitive…

Number Theory · Mathematics 2014-01-28 Sander R. Dahmen , Samir Siksek

Freiman and Scourfield proved that any large enough integer can be written as a sum of a certain number of ascending even powers. We use the circle method to provide the first explicit bound on this number, and show that any large enough…

Number Theory · Mathematics 2020-01-09 Chan Ieong Kuan , Didier Lesesvre , Xuanxuan Xiao