English
Related papers

Related papers: Universal sums of generalized heptagonal numbers

200 papers

We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.

Probability · Mathematics 2017-03-24 Percy Deift , Thomas Trogdon

We continue our recent work on additive problems with prime summands: we already studied the \emph{average} number of representations of an integer as a sum of two primes, and also considered individual integers. Furthermore, we dealt with…

Number Theory · Mathematics 2019-07-16 Alessandro Languasco , Alessandro Zaccagnini

This paper offers a solution method that allows one to find exact values for a large class of convergent series of rational terms. Sums of this form arise often in problems dealing with Quantum Field Theory.

Mathematical Physics · Physics 2007-05-23 Costas Efthimiou

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

We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.

Number Theory · Mathematics 2017-07-24 Vandita Patel

We provide numerical procedures for possibly best evaluating the sum of positive series. Our procedures are based on the application of a generalized version of Kummer's test.

Classical Analysis and ODEs · Mathematics 2022-04-26 Vyacheslav M. Abramov

A positive integer $n$ is said to be a Zumkeller number or an integer-perfect number if the set of its positive divisors can be partitioned into two subsets of equal sums. In this paper, we prove several results regarding Zumkeller numbers.…

Number Theory · Mathematics 2023-11-28 Sai Teja Somu , Andrzej Kukla , Duc Van Khanh Tran

There is consensus that sums $S_n={ {\Sigma }_{k=1}^n R_{0k} e^{i \theta_k}}$ of complex exponential terms, despite their mathematical significance, only possess closed-form representations for specific values of n and special values of…

Number Theory · Mathematics 2025-10-10 Terence R. Smith

In this article, we study a sum of squares of integers except for a fixed one. For any nonnegative integer $n$, we find the minimum number of squares of integers except for $n$ whose sums represent all positive integers that are represented…

Number Theory · Mathematics 2025-04-07 Wonjun Chae , Yun-seong Ji , Kisuk Kim , Kyoungmin Kim , Byeong-Kweon Oh , Jongheun Yoon

We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{\alpha,\beta}$, where $\alpha>1$ is irrational and of finite type.

Number Theory · Mathematics 2015-06-26 William D. Banks , Ahmet M. Guloglu , C. Wesley Nevans

Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. A natural generalization of this theorem is to look at the sequence defined as follows: for $n\ge 2$, let $F_{n,1} =…

Number Theory · Mathematics 2020-06-05 Hung Viet Chu

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

Number Theory · Mathematics 2021-05-28 Jianya Liu , Lilu Zhao

In light of Kim's conjecture on regular polytopes of dimension four, which is a generalization of Waring's problem, we establish asymptotic formulas for representing any sufficiently large integer as a sum of numbers in the form of those…

Number Theory · Mathematics 2024-12-19 Anji Dong , The Nguyen , Alexandru Zaharescu

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

Computational Complexity · Computer Science 2010-12-20 Hector Zenil

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

Number Theory · Mathematics 2021-01-20 Janyarak Tongsomporn , Saeree Wananiyakul , Jörn Steuding

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

General Mathematics · Mathematics 2021-09-10 Roudy El Haddad

We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…

Number Theory · Mathematics 2008-10-30 M. Bruschi

Inspired by the fact that the sum of the cubes of the first $n$ naturals is equal to the square of their sum, we explore, for each $n$, the Diophantine equation representing all non-trivial sets of $n$ integers with this property. We find…

Number Theory · Mathematics 2013-08-06 Edward Barbeau , Samer Seraj

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties…

Number Theory · Mathematics 2015-11-10 Daniel Krenn , Dimbinaina Ralaivaosaona , Stephan Wagner