You are not logged in.
Pages: 1
Hi, everyone.
I had an interesting problem in class today. Find
Last edited by Bezoux (2014-01-23 06:35:27)
Offline
Hi;
You mean you can not use the well known fact that
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Yes.
Is there a way to prove that that sequence is always lesser than 3 without e?
Offline
Hi;
I am not getting anywhere with the restrictions that are placed on the problem. But starting with
perhaps you could replace the n! with Stirlings formula.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Pages: 1