- #1

- 1,030

- 4

What is the smallest n such that

[tex]\lg {n\choose0.15n} + 0.15n \geq {112}[/tex]

[tex]\lg {n\choose0.15n} + 0.15n \geq {112}[/tex]

Last edited:

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- B
- Thread starter Dragonfall
- Start date

- #1

- 1,030

- 4

What is the smallest n such that

[tex]\lg {n\choose0.15n} + 0.15n \geq {112}[/tex]

[tex]\lg {n\choose0.15n} + 0.15n \geq {112}[/tex]

Last edited:

- #2

member 587159

What is lg?What is the smallest n such that

[tex]\lg {n\choose0.15n} + {n\choose0.15n} \geq {112}[/tex]

- #3

- 1,030

- 4

What is lg?

Log base 2

- #4

member 587159

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

- #5

- 1,030

- 4

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...

- #6

member 587159

You can try to do:

2^LH = 2^RH

But I think the best approach is a numerical method.

2^LH = 2^RH

But I think the best approach is a numerical method.

Share:

- Last Post
- Math Proof Training and Practice

- Replies
- 5

- Views
- 135