Representation of a 2-power as sum of \(k\) 2-powers: a recursive formula

DOI10.1016/j.jnt.2012.09.013zbMath1284.11048OpenAlexW2153505620MaRDI QIDQ1938563

Antonio Giorgilli, Giuseppe Molteni

Publication date: 21 February 2013

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2012.09.013

zbMATH Keywords

binomial coefficientcongruencesum of digitscompositions into powers of 2

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Elementary number theory (11A99)

Related Items (3)

Compositions into powers of \(b\): asymptotic enumeration and parameters ⋮ The associative-commutative spectrum of a binary operation ⋮ Cancellation in a short exponential sum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lucas' theorem for prime powers
• Cancellation in a short exponential sum
• REPRESENTATION OF A 2-POWER AS SUM OF k 2-POWERS: THE ASYMPTOTIC BEHAVIOR
• Generation and enumeration of all solutions of the characteristic sum condition
• Binomial Coefficients Modulo a Prime

This page was built for publication: Representation of a 2-power as sum of \(k\) 2-powers: a recursive formula