Closed yenapple closed 4 years ago
Given different positive integers b_1, b_2, ...b_k, and for n > k define b_n to be the least positive integer that is NOT expressible as the sum of some terms (all distinct) among b1 ~ b(n-1).
Prove that b_(n+1) = 2*b_n for sufficiently large n.
Source : Izho 2017
Given different positive integers b_1, b_2, ...b_k, and for n > k define b_n to be the least positive integer that is NOT expressible as the sum of some terms (all distinct) among b1 ~ b(n-1).
Prove that b_(n+1) = 2*b_n for sufficiently large n.
Source : Izho 2017