The Student Room Group

Trinity Cambridge Admissions Test

1.

Which is greater as nn gets large, f(n)=222nf(n) = {{2^{2}}^{2}}^{n} or g(n)=100100ng(n)={100^{100}}^{n} ?

I feel like I'm missing something quite important in this question.

222n{{2^{2}}^{2}}^{n} is equal to 16n16^{n}, and we can clearly see that if n=1,16<100100n=1, 16<100^{100}, so then as nn gets large g(n)=100100ng(n)={100^{100}}^{n} is greater than f(n)f(n) ?

Scroll to see replies

Reply 1
Original post by Jordan\

1.

Which is greater as nn gets large, f(n)=222nf(n) = {{2^{2}}^{2}}^{n} or g(n)=100100ng(n)={100^{100}}^{n} ?

I feel like I'm missing something quite important in this question.

222n{{2^{2}}^{2}}^{n} is equal to 16n16^{n}, and we can clearly see that if n=1,16<100100n=1, 16<100^{100}, so then as nn gets large g(n)=100100ng(n)={100^{100}}^{n} is greater than f(n)f(n) ?


compare the log of the log of each expression
Original post by TeeEm
compare the log of the log of each expression

I don't really understand how the log of a log works.
Reply 3
Original post by Jordan\
I don't really understand how the log of a log works.


there is the first part

IMG_0001.jpg

hopefully you can finish it off
Original post by Jordan\

1.

Which is greater as nn gets large, f(n)=222nf(n) = {{2^{2}}^{2}}^{n} or g(n)=100100ng(n)={100^{100}}^{n} ?

I feel like I'm missing something quite important in this question.

222n{{2^{2}}^{2}}^{n} is equal to 16n16^{n}, No it isn't.

With a "power tower" you calculate from "top to bottom". E.g.

2224=2216=2655362^{2^{2^4}} = 2^{2^{16}} = 2^{65536}, which is much larger than 16^4.
I never would have got that far in the real test anyway so I might as well just give up now :lol:
(edited 8 years ago)
Original post by Jordan\

1.

Which is greater as nn gets large, f(n)=222nf(n) = {{2^{2}}^{2}}^{n} or g(n)=100100ng(n)={100^{100}}^{n} ?

I feel like I'm missing something quite important in this question.

222n{{2^{2}}^{2}}^{n} is equal to 16n16^{n}, and we can clearly see that if n=1,16<100100n=1, 16<100^{100}, so then as nn gets large g(n)=100100ng(n)={100^{100}}^{n} is greater than f(n)f(n) ?


Here's the clever way I did it, consider h(n)=256256n h(n)=256^{256^n} , which is basically just logs I guess.
(edited 8 years ago)
Original post by Renzhi10122
Here's the clever way I did it, consider h(n)=256256n h(n)=256^{256^n} , which is basically just logs I guess.

I don't really see how i can relate the result from this to the functions given in the question, though?
Original post by Jordan\
I don't really see how i can relate the result from this to the functions given in the question, though?


So clearly, h(n)>g(n)n h(n)>g(n) \forall n . We write
[br]h(n)=256256n[br]=28256n[br]=22328n[br]=228n+3[br] [br]h(n)=256^{256^n}[br]=2^{8*256^n}[br]=2^{2^3*2^{8n}}[br]=2^{2^{8n+3}}[br]
and the result should be clear from this.
Original post by Renzhi10122
So clearly, h(n)>g(n)n h(n)>g(n) \forall n . We write
[br]h(n)=256256n[br]=28256n[br]=22328n[br]=228n+3[br] [br]h(n)=256^{256^n}[br]=2^{8*256^n}[br]=2^{2^3*2^{8n}}[br]=2^{2^{8n+3}}[br]
and the result should be clear from this.


Very nice indeed.


Posted from TSR Mobile
Original post by Renzhi10122
So clearly, h(n)>g(n)n h(n)>g(n) \forall n . We write
[br]h(n)=256256n[br]=28256n[br]=22328n[br]=228n+3[br] [br]h(n)=256^{256^n}[br]=2^{8*256^n}[br]=2^{2^3*2^{8n}}[br]=2^{2^{8n+3}}[br]
and the result should be clear from this.

I got as far as log2[log2h(n)]=8n+3log_2[{log_2{h(n)}}] = 8n+3 and then put it into exponential form of h(n)=228n+3h(n)={{2^{2}}^{8n+3}} but then forgot to compare the two. But I can see now if you consider the graphs of y=2ny=2^{n} and y=8n+3y=8n+3 that when nn is large, 2n2^{n} grows much faster.

Cheers :bl:
Reply 11
Another user to add to my "refuse to help" list ...
Reply 12
Original post by catastrophe exam
:s-smilie: me?


I was not referring to you
Original post by TeeEm
Another user to add to my "refuse to help" list ...

That's a little rude.

I'm still working on your way to be honest, i'm just finding it hard to picture how to get my head around it without using a calculator. Just because I haven't replied yet, it's not very fair to say that!
Original post by DFranklin
No it isn't.

With a "power tower" you calculate from "top to bottom". E.g.

2224=2216=2655362^{2^{2^4}} = 2^{2^{16}} = 2^{65536}, which is much larger than 16^4.

Ah I only considered when n=1n=1 which was silly as the question says as it gets larger :s-smilie:

Do these type of numbers come up much in mathematics in general? (the "power towers")
Reply 15
Original post by Jordan\
That's a little rude.

I'm still working on your way to be honest, i'm just finding it hard to picture how to get my head around it without using a calculator. Just because I haven't replied yet, it's not very fair to say that!



I stopped my own work, wrote an almost complete solution, scanned it, posted it, and you failed even to acknowledge my post, let alone thank me...
Sorry that I am rude, how bad of me ...
I guess I am invisible.
Original post by Jordan\
Ah I only considered when n=1n=1 which was silly as the question says as it gets larger :s-smilie:

Do these type of numbers come up much in mathematics in general? (the "power towers":wink:


q1
http://www.bmoc.maths.org/home/bmo1-2015.pdf
Original post by TeeEm
I stopped my own work, wrote an almost complete solution, scanned it, posted it, and you failed even to acknowledge my post, let alone thank me...
Sorry that I am rude, how bad of me ...
I guess I am invisible.

Well I apologise for not immediately responding, but usually if it's maths I try to work through the advice first for a while until I either get the answer or at least get to the point where I can ask a question that's not stupid~ It's bad enough that I have to ask for help on questions that some people seem to find so easy. I'd rather have replied once I got it from your help, than to have said "Thankyou, but I still can't see it.."

BTW I did try to rep you when you posted it but it said I've rep'd you too much lately
Reply 18
Original post by Jordan\
Well I apologise for not immediately responding, but usually if it's maths I try to work through the advice first for a while until I either get the answer or at least get to the point where I can ask a question that's not stupid~ It's bad enough that I have to ask for help on questions that some people seem to find so easy. I'd rather have replied once I got it from your help, than to have said "Thankyou, but I still can't see it.."

BTW I did try to rep you when you posted it but it said I've rep'd you too much lately


Let us leave it at that.
You could have said, "thanks I will look at it"

Nevertheless I accept you explanation/reasoning as plausible.

That first one is quite a bit easier thank goodness :wink: Quite a few of those questions do seem to be a little like the ones on the Sample Trinity Test~ although I think I did hear that quite a lot of people who do BMO/IMO seem to go to Trinity, don't they?

Quick Reply

Latest