#Prove by induction
17 messages · Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close
- Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
Since we are to do strong induction, these should also be helpful in proving that:
a_([(k+1)/2]) > 4*[(k+1)/2]
And
a_([(2k+2)/3]) > 4*[(2k+2)/3]
So their sum
a_([(k+1)/2]) + a_([(2k+2)/3]) > 4*[(k+1)/2] + 4*[(2k+2)/3]
Maybe if we can prove that:
4*[(k+1)/2] + 4*[(2k+2)/3] >= 3k +3, our problem would be finished (why you ask? Think about it yourself)
But wait
Since k>=3
This means that [(k+1)/2] >= [(3+1)/2] = 2 and [(2k+2)/3] >= [(2*3+2)/3] = 2
Yeah idk furthermore
Goodluck
Tho those should be useful
sorry i still dont get how to prove it
+close