Question: Prove that each positive integer n has a unique representation in the form n = a_1 1! + a_2 2! + a_3 3! +

Prove that each positive integer n has a unique representation in the form n = a_1 1! + a_2 2! + a_3 3! + · · · + a_t t! for some positive integer t and some integers a1, a2, . . . , at where at 6= 0 and 0 ≤ ai ≤ i for 1 ≤ i ≤ t. (For instance, 61 = 1! + 0 · 2! + 2 · 3! + 2 · 4!. Strong induction is useful for at least one part of this proof.

Step by Step Solution

3.46 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Solution ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!