What is the smallest n for a small inequality?

  • Context: High School 
  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Inequality
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
5 replies · 1K views
Dragonfall
Messages
1,023
Reaction score
5
What is the smallest n such that

[tex]\lg {n\choose0.15n} + 0.15n \geq {112}[/tex]
 
Last edited:
Mathematics news on Phys.org
Dragonfall said:
What is the smallest n such that

[tex]\lg {n\choose0.15n} + {n\choose0.15n} \geq {112}[/tex]
What is lg?
 
Math_QED said:
What is lg?

Log base 2
 
Dragonfall said:
Log base 2
Does the log contain the sum of both combinations? (Then you should have added more brackets)
 
Math_QED said:
Does the log contain the sum of both combinations? (Then you should have added more brackets)

Sorry I formulated the inequality wrong. It's fixed now.

The log only contains the binomial.

I think it might be easier just to do this numerically...
 
You can try to do:

2^LH = 2^RH

But I think the best approach is a numerical method.