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
Double Post and incorrect forum.
Giorgi Dalakishvili #region signature my articles #endregion
modified on Monday, May 5, 2008 3:11 AM
-
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
I suggest you do your own homework. I guess you are posting this here because you've been asked to use C# to prove your answer ? How is that not trivial ?
Christian Graus Please read this if you don't understand the answer I've given you "also I don't think "TranslateOneToTwoBillion OneHundredAndFortySevenMillion FourHundredAndEightyThreeThousand SixHundredAndFortySeven()" is a very good choice for a function name" - SpacixOne ( offering help to someone who really needed it ) ( spaces added for the benefit of people running at < 1280x1024 )
-
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, there exist a lot of functions f(x) for which the following holds:
x < y is equivalent to f(x) < f(y)Some of them also require x>0. Examples are square root and logarithm. :)Luc Pattyn [Forum Guidelines] [My Articles]
I dislike the black-and-white voting system on questions/answers. X|
-
Hi, there exist a lot of functions f(x) for which the following holds:
x < y is equivalent to f(x) < f(y)Some of them also require x>0. Examples are square root and logarithm. :)Luc Pattyn [Forum Guidelines] [My Articles]
I dislike the black-and-white voting system on questions/answers. X|
Luc Pattyn wrote:
I dislike the black-and-white voting system on questions/answers.
On the contrary, I like it very much - I think it's simple and elegant :) I wish more people use the system, and very bad questions should perhaps be deleted.
Cheers, Vikram.
The hands that help are holier than the lips that pray.
-
I suggest you do your own homework. I guess you are posting this here because you've been asked to use C# to prove your answer ? How is that not trivial ?
Christian Graus Please read this if you don't understand the answer I've given you "also I don't think "TranslateOneToTwoBillion OneHundredAndFortySevenMillion FourHundredAndEightyThreeThousand SixHundredAndFortySeven()" is a very good choice for a function name" - SpacixOne ( offering help to someone who really needed it ) ( spaces added for the benefit of people running at < 1280x1024 )
"MANHOOS ADAMI": ITS NOT MA HOME WORK OK NA ........... IF U WANA GIV ANS OV IT THN GIV. DNT TRY TO OVER SMART...:-P:mad:
-
Hi, there exist a lot of functions f(x) for which the following holds:
x < y is equivalent to f(x) < f(y)Some of them also require x>0. Examples are square root and logarithm. :)Luc Pattyn [Forum Guidelines] [My Articles]
I dislike the black-and-white voting system on questions/answers. X|
;)
-
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
Well, you could just check with smaller numbers. Lets use 4 to help us out a little: 4^2 = 16 1000^4 = 1000000000000 So, from this it seems 1000^n is greater. n^n has the potential to be greater than n^1000. If n<1000 then n^1000 will be bigger. Since you said the numbers will be massive n^n is definately bigger. And once again assuming n > 1000 n^n is bigger than 1000^n so we end up with (from biggest to smallest) n^n 1000^n n^1000 n^2 So what we can see is that anything to the power of n has the potential to be much larger. So anything^n is at the top. After that you can just sort them by how large the static numbers are (in your case n should be considered larger than any static number) To be honest, i don't really know why you asked this question, and why you asked it here. I see no relation to C#, and you could have just typed some numbers into a calculator to see which is bigger. Infact, its pretty obvious which is going to be the smallest, after you think about it for a bit.
My current favourite word is: Bacon!
-SK Genius
-
Well, you could just check with smaller numbers. Lets use 4 to help us out a little: 4^2 = 16 1000^4 = 1000000000000 So, from this it seems 1000^n is greater. n^n has the potential to be greater than n^1000. If n<1000 then n^1000 will be bigger. Since you said the numbers will be massive n^n is definately bigger. And once again assuming n > 1000 n^n is bigger than 1000^n so we end up with (from biggest to smallest) n^n 1000^n n^1000 n^2 So what we can see is that anything to the power of n has the potential to be much larger. So anything^n is at the top. After that you can just sort them by how large the static numbers are (in your case n should be considered larger than any static number) To be honest, i don't really know why you asked this question, and why you asked it here. I see no relation to C#, and you could have just typed some numbers into a calculator to see which is bigger. Infact, its pretty obvious which is going to be the smallest, after you think about it for a bit.
My current favourite word is: Bacon!
-SK Genius
SK Genius wrote:
To be honest, i don't really know why you asked this question, and why you asked it here.
< snip >Infact, its pretty obvious which is going to be the smallest, after you think about it for a bit.Yup, that's what I thought till I saw these two pages :wtf: http://www.codeproject.com/script/Forums/LatestComments.aspx?fmid=4320368[^] http://www.codeproject.com/script/Forums/View.aspx?fid=326859&msg=2536626[^]
-
"MANHOOS ADAMI": ITS NOT MA HOME WORK OK NA ........... IF U WANA GIV ANS OV IT THN GIV. DNT TRY TO OVER SMART...:-P:mad:
You need to read the forum guidelines. This is obviously a homework question. We only help people who are at least willing to solve the problem. We don't accept text speak nor we do not tolerate people who are rude to other members. Mangoos adami? This is also an English speaking forum. Congrats! You made my list of CP violators.
New feature! Scroll down to see CP offenders! Current rant: "The 50 Greatest Comedy Skits of All-Time!" http://craptasticnation.blogspot.com/[^]
