English
Related papers

Related papers: When is 0.999... equal to 1?

200 papers

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

We study decompositions of natural numbers into triangular summands. For instance, we prove that any natural number can be represented as a sum of four triangular numbers, two of them having even indices and the other two having odd…

Number Theory · Mathematics 2016-02-04 Dmitry Krachun

In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.

History and Overview · Mathematics 2023-03-20 Jean-Christophe Pain

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

Classical Analysis and ODEs · Mathematics 2010-03-29 Markus Mueller , Dierk Schleicher

We study new identities related to the sums of adjacent terms in the Pell sequence, defined by $P_{n} := 2P_{n-1}+P_{n-2}$ for $ n\geq 2$ and $P_{0}=0, P_{1}=1$, and generalize these identities for many similar sequences. We prove that the…

We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…

Number Theory · Mathematics 2024-11-26 Noam Kimmel , Vivian Kuperberg

By means of $q$-series, we prove that any natural number is a sum of an even square and two triangular numbers, and that each positive integer is a sum of a triangular number plus $x^2+y^2$ for some integers $x$ and $y$ with $x\not\equiv y…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…

Number Theory · Mathematics 2022-12-08 Katherine Benjamin

We will show in this text that, for all non-negative integers $n$ and $l$, the following equality is verified: \[\sum_{i=0}^{l} {n-i \choose i}{l+i \choose 2i+1}=\sum_{i=0}^{l} {n-i \choose i-1}{l+i \choose 2i}.\] We will first address the…

Combinatorics · Mathematics 2026-04-28 Flavien Mabilat

The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…

Mathematical Physics · Physics 2015-02-09 Alexis De Vos , Stijn De Baerdemacker

We study the existence of different notions of value in two-person zero-sum repeated games where the state evolves and players receive signals. We provide some examples showing that the limsup value (and the uniform value) may not exist in…

Optimization and Control · Mathematics 2016-01-08 Hugo Gimbert , Jérôme Renault , Sylvain Sorin , Xavier Venel , Wiesław Zielonka

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

Estimates are provided for $s$th moments of cubic smooth Weyl sums, when $4\le s\le 8$, by enhancing the author's iterative method that delivers estimates beyond classical convexity. As a consequence, an improved lower bound is presented…

Number Theory · Mathematics 2023-06-01 Trevor D. Wooley

The issue had been raised whether the Fredholm series $z+z^2+...+z^{2^n}+...$ has infinitely many zeroes in the unit disk. We provide an affirmative answer, proving that in fact every complex number occurs as a value infinitely many times.

Complex Variables · Mathematics 2024-04-09 Umberto Zannier , Francesco Veneziano

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…

High Energy Physics - Theory · Physics 2015-06-12 C. Anzai , Y. Sumino

In \cite{[NE]} we introduce $\alpha$-expansions a real numbers in $(0,1]$, given by \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $\alpha>1$ and $d_{i}\in\mathbb{N}$ and discuss ergodic theoretical and dimension…

Dynamical Systems · Mathematics 2026-03-31 Jörg Neunhäuserer

Assuming that the two integrals in the Change of Variable Formula for the Riemann integral on the real line are finite, one can rightfully ask if they have equal value. We give a positive answer to this question. The proof is very easy to…

Classical Analysis and ODEs · Mathematics 2025-06-24 Oswaldo Rio Branco de Oliveira

What is the maximum number of $r$-term sums admitting rational values in $n$-element sets of irrational numbers? We determine the maximum when $r<4$ or $r\geq n/2$ and also in case when we drop the condition on the number of summands. It…

Combinatorics · Mathematics 2025-09-25 Benjamin Móricz , Zoltán Lóránt Nagy

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

Number Theory · Mathematics 2023-06-23 Jörg Brüdern , Olivier Robert

A set $A$ is coarsely computable with density $r \in [0,1]$ if there is an algorithm for deciding membership in $A$ which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least $r$. To any Turing…

Logic · Mathematics 2017-09-29 Matthew Harrison-Trainor