comparism
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Listen, you must avoid using calculators.Because we can find $300! > 100^{300}$ by large computer.So all kinds of calculations must be avoided.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
- nafistiham
- Posts:829
- Joined:Mon Oct 17, 2011 3:56 pm
- Location:24.758613,90.400161
- Contact:
Re: comparism
and, I think it shouldn't have been
\[In(n!)\approx nIn(n)-n\]
but,
\[ln(n!)\approx nln(n)-n\]
\[In(n!)\approx nIn(n)-n\]
but,
\[ln(n!)\approx nln(n)-n\]
\[\sum_{k=0}^{n-1}e^{\frac{2 \pi i k}{n}}=0\]
Using $L^AT_EX$ and following the rules of the forum are very easy but really important, too.Please co-operate.
Using $L^AT_EX$ and following the rules of the forum are very easy but really important, too.Please co-operate.
Re: comparism
You can find $ln 100$ approximately without using calculatorsPhlembac Adib Hasan wrote:Listen, you must avoid using calculators.Because we can find $300! > 100^{300}$ by large computer.So all kinds of calculations must be avoided.
Please read Forum Guide and Rules before you post.
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
Use $L^AT_EX$, It makes our work a lot easier!
Nur Muhammad Shafiullah | Mahi
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: comparism
Many persons have given proofs,but every proof depends on calculators at some steps.BUT IT IS NOT FAIR.The problem asks for such a proof that uses only logic, no use of calculator.
We have to prove $ 300! > 100^{300} $.We can prove a stronger result :\[n!>\left (\frac {n} {3}\right )^n \]for every positive integer.Induction is the easiest way to prove this.
We have to prove $ 300! > 100^{300} $.We can prove a stronger result :\[n!>\left (\frac {n} {3}\right )^n \]for every positive integer.Induction is the easiest way to prove this.
Last edited by Phlembac Adib Hasan on Fri Jan 27, 2012 4:31 pm, edited 1 time in total.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: comparism
Yes, I know it.But this must be avoided in a pure proof.*Mahi* vaia wrote:I hope you know $ln 10 \approx 2.3$
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: comparism
I found another proof of this problem using Cauchy.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: comparism
Go to viewtopic.php?f=27&t=1622.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules