Induction proof involving log(m+1) terms

  • Context: Graduate 
  • Thread starter Thread starter seeker101
  • Start date Start date
  • Tags Tags
    Induction Proof Terms
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
seeker101
Messages
28
Reaction score
0
Any suggestions on how to simplify the log (m+1) terms that arise when proving the following statement using induction for m >= 1? (log to the base 2)

[PLAIN]http://dl.dropbox.com/u/471735/recurrence%202.png
 
Last edited by a moderator:
Mathematics news on Phys.org
You don't need to use induction, because there is a straightforward method: note that log(m/2) = log(m) - 1 so your disequation becomes simply log(m) > 1 which is obvious for m > 1.