B What is the smallest n for a small inequality?

  • B
  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Inequality
Dragonfall
Messages
1,023
Reaction score
5
What is the smallest n such that

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

\lg {n\choose0.15n} + {n\choose0.15n} \geq {112}
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.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top