N is a positive integer.
The first digit of 2 1 0 N is 1 , but the first digit of 2 1 0 ( N − 1 ) is not 1 .
Find the smallest possible value of N .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
My method: 1 0 N l o g 1 0 2 will help write the number in base 1 0 . Let { 1 0 N l o g 1 0 2 } be the mantissa (the decimal part.) Then 1 0 { 1 0 N l o g 1 0 2 } will have the same first digit as 2 1 0 N . Make a simple table. N = 3 0 is the first that doesn't begin with 1 . Continue to N = 9 7 , which ends in 9 and right after that N = 9 8 begins with 1 again.
Problem Loading...
Note Loading...
Set Loading...
We can determine first digits of large numbers by finding their log values to base 10. Because powers of 10 will have whole number log values, numbers with a first digit of 1 will have log values slightly above a whole number, whereas numbers with a high first digit will have log values just below a whole number.
We have lo g 1 0 2 1 0 ≈ 3 . 0 1 0 3 , so lo g 1 0 2 1 0 N = N lo g 1 0 2 1 0 ≈ 3 . 0 1 0 3 N . What we're looking for is a value of N that will push this as close to a whole number as possible without going over (like The Price Is Right!), so that the next N will push it just past a whole. Since the first two decimal digits are 0 1 , we consider something close to N = 9 9 , but to account for the digits 0 3 that follow, we start slightly lower. We find that
∙ N ∙ N ∙ N = 9 6 ⟹ 9 6 lo g 1 0 2 1 0 ≈ 2 8 8 . 9 8 8 8 = 9 7 ⟹ 9 7 lo g 1 0 2 1 0 ≈ 2 9 1 . 9 9 9 1 = 9 8 ⟹ 9 8 lo g 1 0 2 1 0 ≈ 2 9 5 . 0 0 9 4
Verifying 2 9 7 0 ≈ 9 . 9 7 9 2 × 1 0 2 9 1 and 2 9 8 0 ≈ 1 . 0 2 1 9 × 1 0 2 9 5 so the value of N we're looking for is 9 8