中文
相关论文

相关论文: Sums of Consecutive Integers

200 篇论文

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…

数论 · 数学 2016-02-04 Dmitry Krachun

We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.

综合数学 · 数学 2018-12-11 Wolf Marc , Wolf François , Villemin François-Xavier

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…

数论 · 数学 2013-08-06 Edward Barbeau , Samer Seraj

Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…

组合数学 · 数学 2007-05-23 Robert Milson

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

组合数学 · 数学 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…

交换代数 · 数学 2026-02-03 Pedro Garcia-Sanchez , Christopher O'Neill

Harmonic numbers arise from the truncation of the harmonic series. The $n^\text{th}$ harmonic number is the sum of the reciprocals of each positive integer up to $n$. In addition to briefly introducing the properties of harmonic numbers, we…

历史与综述 · 数学 2021-12-02 N. Karjanto

It is shown that the set of palindromes is an additive basis for the natural numbers in any base. Specifically, we prove that every natural number can be expressed as the sum of $O(d)$ palindromes in base $d$.

数论 · 数学 2022-04-19 Yu Gao

The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…

逻辑 · 数学 2019-05-17 Ruadhan O'Flanagan

In this paper, we prove the finiteness of the number of integer solutions of the decomposable form inequalities. We also study the number of integer solutions of a sequence of decomposable form inequalities.

数论 · 数学 2007-05-23 Kalman Gyory , Min Ru

A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic…

数论 · 数学 2012-02-09 Daniela Bubboloni , Florian Luca , Pablo Spiga

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

组合数学 · 数学 2017-03-02 Andrei K. Svinin

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

组合数学 · 数学 2010-12-17 Milan Janjic

One is expressed as the sum of the reciprocals of a certain set of integers. We give an elegant proof to the fact applying the polynomial theorem and basic calculus.

历史与综述 · 数学 2009-04-15 Yuya Dan

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…

综合数学 · 数学 2021-09-10 Roudy El Haddad

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

综合数学 · 数学 2024-11-20 Eteri Samsonadze

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

逻辑 · 数学 2008-08-08 J. P. Mayberry , Richard Pettigrew

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

综合数学 · 数学 2021-06-08 Marc Wolf , FranÇOis Wolf , FranÇOis-Xavier Villemin

A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.

数论 · 数学 2016-08-24 Kyle Kawagoe , Greg Huber

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

综合数学 · 数学 2008-06-30 Dimitris Sardelis
‹ 上一页 1 2 3 10 下一页 ›