which one is smaller n pow 2, 1000 pow n, n pow n, n pow 1000 , when n value is nearer to infinite
-
hi! i have a question. that is we have ha a problem "which one is smaller n pow 2, 1000 pow n, n pow n, n pow 1000 , when n value is nearer to infinite" plz also give reason along with answer Best Regards, Huma Satti
-
hi! i have a question. that is we have ha a problem "which one is smaller n pow 2, 1000 pow n, n pow n, n pow 1000 , when n value is nearer to infinite" plz also give reason along with answer Best Regards, Huma Satti
Exponential functions are larger then powers of a number when n is nearer infinity
Giorgi Dalakishvili #region signature my articles #endregion
-
hi! i have a question. that is we have ha a problem "which one is smaller n pow 2, 1000 pow n, n pow n, n pow 1000 , when n value is nearer to infinite" plz also give reason along with answer Best Regards, Huma Satti
Try looking at the logarithms of these values and comparing them. You should easily see the answer.
-
Exponential functions are larger then powers of a number when n is nearer infinity
Giorgi Dalakishvili #region signature my articles #endregion
:confused: He's not comparing exponential functions.
-
hi! i have a question. that is we have ha a problem "which one is smaller n pow 2, 1000 pow n, n pow n, n pow 1000 , when n value is nearer to infinite" plz also give reason along with answer Best Regards, Huma Satti
My guess is
n pow 2
your task is to proof it (by induction?) :)
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler. -- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong. -- Iain Clarke -
Exponential functions are larger then powers of a number when n is nearer infinity
Giorgi Dalakishvili #region signature my articles #endregion
THNX ALOT 4 UR HELP
-
Try looking at the logarithms of these values and comparing them. You should easily see the answer.
THNX ALOT 4 UR HELP SO NICE OV U
-
My guess is
n pow 2
your task is to proof it (by induction?) :)
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler. -- Alfonso the Wise, 13th Century King of Castile.
This is going on my arrogant assumptions. You may have a superb reason why I'm completely wrong. -- Iain ClarkeSO NICE OV U THNX ALOT OV UR HELP
-
hi! i have a question. that is we have ha a problem "which one is smaller n pow 2, 1000 pow n, n pow n, n pow 1000 , when n value is nearer to infinite" plz also give reason along with answer Best Regards, Huma Satti
huma satti wrote:
when n value is nearer to infinite
Is n interger? real number? complex number? What interval are we talking about? Positive or negative infinity? I'd give it back to teacher and say that (s)he formulated the problem too vaguely :P
[My Blog]
"Visual studio desperately needs some performance improvements. It is sometimes almost as slow as eclipse." - Rüdiger Klaehn
"Real men use mspaint for writing code and notepad for designing graphics." - Anna-Jayne Metcalfe -
hi! i have a question. that is we have ha a problem "which one is smaller n pow 2, 1000 pow n, n pow n, n pow 1000 , when n value is nearer to infinite" plz also give reason along with answer Best Regards, Huma Satti
huma satti wrote:
when n value is nearer to infinite
(just for the sake of argumentation, I'm pretty certain there are some mathematical proof of each ...) Does it really make a difference when n is near infinity ? the results will be infinity anyway.
Maximilien Lincourt Your Head A Splode - Strong Bad
-
huma satti wrote:
when n value is nearer to infinite
(just for the sake of argumentation, I'm pretty certain there are some mathematical proof of each ...) Does it really make a difference when n is near infinity ? the results will be infinity anyway.
Maximilien Lincourt Your Head A Splode - Strong Bad
Maximilien wrote:
Does it really make a difference when n is near infinity ? the results will be infinity anyway.
I think the question is about the asymptotic properties of the various quantities. In a practical sense the exercise is useful for comparing orders of algorithms. Aside from that, if n is infinity then you can't compare them, no. "Close to infinity" just means "very large but not infinity".
-
Try looking at the logarithms of these values and comparing them. You should easily see the answer.
I assume you mean the derivatives? Once upon a time I learned about something that I recall as l'Hôpital's rule[^]. On the other hand, I have no clue what the hell the derivation of n log n is. :~ Do you think Ilidiot knows? :-D
-- Kein Mitleid Für Die Mehrheit