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.
Before applying brute force, let us simplify matters. We must have ⌊ 4 n + 2 0 1 9 ⌋ 4 n + 2 0 1 9 4 n + 2 0 1 9 ≤ n + n + 1 ≤ 1 + ⌊ 4 n + 2 0 1 9 ⌋ ≤ n + n + 1 + 1 ≤ 2 n + 1 + 1 ≤ 4 n + 5 + 4 n + 1 and hence n ≥ ( 4 2 0 1 4 ) 2 − 1 = 2 5 3 5 1 1 . 2 5 , so that n ≥ 2 5 3 5 1 2 . This cuts the number of tests until we find the answer of 2 5 4 5 2 0 down to size.