Combinatorics and Graph Theory · Problem 3.1.8

Generating Functions — David Guichard

Mathematics — Combinatorics · generating-functions

Problem

Use generating functions to show that every positive integer can be written in exactly one way as a sum of distinct powers of 2.

Related theory

Browse the problem library