Exephy
Badges: 3
Rep:
?
#1
Report Thread starter 5 years ago
#1
Hey, I'm stuck on this question:
Find the smallest integer satisfying the inequality 2n>100643
I tried the following:
nlog2>643log100
n>(643log100)/(log2) which comes out as 4271 which is pretty ridiculous considering.
could anyone give me a helping hand here? thanks!
0
reply
whydoidothis?
Badges: 21
Rep:
?
#2
Report 5 years ago
#2
4272 is the right answer yeah.
You get n>4271.99
so the smallest integer it can be is 4272.

You were right basically.
1
reply
Exephy
Badges: 3
Rep:
?
#3
Report Thread starter 5 years ago
#3
(Original post by whydoidothis?)
4272 is the right answer yeah.
You get n>4271.99
so the smallest integer it can be is 4272.

You were right basically.
Oh, my bad. I plugged it back in (2^4273-100^643) and got some huge number like 10^1300, I just guessed it would be smaller if I was right. Anyway, thanks
0
reply
X

Quick Reply

Attached files
Write a reply...
Reply
new posts
Back
to top
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise

Should there be a new university admissions system that ditches predicted grades?

No, I think predicted grades should still be used to make offers (519)
33.75%
Yes, I like the idea of applying to uni after I received my grades (PQA) (636)
41.35%
Yes, I like the idea of receiving offers only after I receive my grades (PQO) (313)
20.35%
I think there is a better option than the ones suggested (let us know in the thread!) (70)
4.55%

Watched Threads

View All