- #1

- 1,030

- 4

## Main Question or Discussion Point

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:

- 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

Math_QED

Science Advisor

Homework Helper

2019 Award

- 1,393

- 515

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

Log base 2What is lg?

- #4

Math_QED

Science Advisor

Homework Helper

2019 Award

- 1,393

- 515

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

- #5

- 1,030

- 4

Sorry I formulated the inequality wrong. It's fixed now.Does the log contain the sum of both combinations? (Then you should have added more brackets)

The log only contains the binomial.

I think it might be easier just to do this numerically...

- #6

Math_QED

Science Advisor

Homework Helper

2019 Award

- 1,393

- 515

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.

- Last Post

- Replies
- 11

- Views
- 2K

- Last Post

- Replies
- 6

- Views
- 602

- Last Post

- Replies
- 2

- Views
- 1K

- Last Post

- Replies
- 5

- Views
- 2K

- Last Post

- Replies
- 7

- Views
- 610

- Last Post

- Replies
- 5

- Views
- 2K

- Last Post

- Replies
- 2

- Views
- 1K

- Last Post

- Replies
- 3

- Views
- 1K

- Last Post

- Replies
- 5

- Views
- 2K

- Last Post

- Replies
- 1

- Views
- 965