#Prove by induction

17 messages · Page 1 of 1 (latest)

rare tulipBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
coarse heath
#

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

lyric dirge
#

tysm for the help

#

ill try

lyric dirge
#

sorry i still dont get how to prove it

lyric dirge
#

+close