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

Mingjang Chen

doi:10.1080/0025570X.2019.1637663

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 journal › Article › peer-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 language	English
Pages (from-to)	286
Number of pages	1
Journal	Mathematics Magazine
Volume	92
Issue number	4
DOIs	https://doi.org/10.1080/0025570X.2019.1637663
State	Published - 19 Sep 2019

Keywords

MSC: Primary 05A19

Access to Document

10.1080/0025570X.2019.1637663

Cite this

@article{ed09420a782b4927b368665387948825,

title = "Proof Without Words: Sums of Consecutive Powers of k Via a Perfect k-ary Tree",

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

keywords = "MSC: Primary 05A19",

author = "Mingjang Chen",

year = "2019",

month = sep,

day = "19",

doi = "10.1080/0025570X.2019.1637663",

language = "English",

volume = "92",

pages = "286",

journal = "Mathematics Magazine",

issn = "0025-570X",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

T1 - Proof Without Words

T2 - Sums of Consecutive Powers of k Via a Perfect k-ary Tree

AU - Chen, Mingjang

PY - 2019/9/19

Y1 - 2019/9/19

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

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

KW - MSC: Primary 05A19

UR - http://www.scopus.com/inward/record.url?scp=85073208873&partnerID=8YFLogxK

U2 - 10.1080/0025570X.2019.1637663

DO - 10.1080/0025570X.2019.1637663

M3 - Article

AN - SCOPUS:85073208873

SN - 0025-570X

VL - 92

SP - 286

JO - Mathematics Magazine

JF - Mathematics Magazine

IS - 4

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this