Proof Without Words: Sums of Consecutive Powers of k Via a Perfect k-ary Tree

Mingjang Chen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Summary By counting the nodes of a perfect k-ary tree, an identity involving the sums of consecutive powers of k is proved.

Original languageEnglish
Pages (from-to)286
Number of pages1
JournalMathematics Magazine
Volume92
Issue number4
DOIs
StatePublished - 19 Sep 2019

Keywords

  • MSC: Primary 05A19

Fingerprint

Dive into the research topics of 'Proof Without Words: Sums of Consecutive Powers of k Via a Perfect k-ary Tree'. Together they form a unique fingerprint.

Cite this