What is the largest integer such that the above inequality is true?
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.
lo g 1 0 + lo g 2 0 > 2 lo g N
Using the rule: lo g b a + lo g b c = lo g b a c
lo g 2 0 0 > 2 lo g N
Using the rule: a lo g b = lo g b a
lo g 2 0 0 > lo g N 2
Then, you can drop the logarithms because if lo g b a = lo g b c , then a = c .
2 0 0 = N 2
Taking the square root of 2 0 0 is 1 0 2 , which is approximately 1 4 . 1 4 . Therefore, the largest N is 1 4 .