An Extension of Sylvester’s Theorem on Arithmetic Progressions
Sylvester’s theorem states that every number can be decomposed into a sum of consecutive positive integers except powers of 2. In a way, this theorem characterizes the partitions of a number as a sum of consecutive integers. The first generalization we propose of the theorem characterizes the partit...
Main Authors: | Augustine O. Munagi, Francisco Javier de Vega |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-06-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/15/6/1276 |
Similar Items
-
Exponential sums involving the divisor function over arithmetic progressions
by: Rui Zhang, et al.
Published: (2023-03-01) -
Blackbox polynomial identity testing for depth 3 circuits
by: Kayal, Neeraj, et al.
Published: (2010) -
A note on generating identities for multiplicative arithmetic functions
by: Karol Gryszka
Published: (2024-01-01) -
Minimum Number of Colours to Avoid <i>k</i>-Term Monochromatic Arithmetic Progressions
by: Kai An Sim, et al.
Published: (2022-01-01) -
A General Approach to Sylvester-Polynomial-Conjugate Matrix Equations
by: Ryszard Mazurek
Published: (2024-02-01)