MathLabs

Problem 1

Prove that for any pair of positive integers kk and nn, there exist kk positive integers m1,m2,…,mkm_1,m_2,\ldots,m_k (not necessarily different) such that 1+2k−1n=(1+1m1)(1+1m2)⋯(1+1mk).1+\frac{2^k-1}{n}=\left(1+\frac{1}{m_1}\right)\left(1+\frac{1}{m_2}\right)\cdots\left(1+\frac{1}{m_k}\right).
Step 5 of 5: Conclude the induction
1+2k−1n=∏i=1k(1+1mi)1+\frac{2^k-1}{n}=\prod_{i=1}^{k}\left(1+\frac{1}{m_i}\right)
Detailed analysis

Every positive integer nn is either odd or even, so one of the two cases above always applies. Together with the base case k=1k=1, this completes the induction on kk and proves the identity for every pair of positive integers k,nk,n.