Abstract

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

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call