1. The problem statement, all variables and given/known data Find all natural numbers such that 2n ≥ (1+n)2, and prove your answer. 2. The attempt at a solution I can see this is true for n=0 and n>5. I try to prove this using induction as follows 20 =1≥ 1=(1+0)2 base case: 26 =64≥ 49=(1+6)2 so it is true for n=6 and suppose 2n ≥ (1+n)2 for all n≥6 then 2n+2 =2n22 ≥4(1+n)2=4n2+8n+4≥n2+6n+9=(n+3)2 I'm not sure if this correct because of the +2? Would I have do to it again with a base case of 7 to ensure every number is accounted for?