Inspired by Jeremy Galvagni and this problem
Every integer percentage can be written as , but of course for many of them there is a value that also makes true, because many fractions can be reduced.
If we now allow rounding to the nearest whole percent, this again gives more possibilities and therefore smaller denominators.
Let be the smallest possible value of such that there exists some integer with when rounded to the nearest whole percent.
If we sort all values of by size, what is the sum of the values of that give the 10 largest ?
Submit your answer just without the %. So, if you get 100%, give 100 as the answer.
Details and assumptions
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.
Because of the special rule for rounding that preserves symmetry, q ( p ) and q ( 1 0 0 % − p ) will alway be equal.
Since two values of q are always equal, the 10 largest values we are searching are made up of 5 pairs ( p , 1 0 0 % − p ) . But the sum in each of these pairs is simply 1 0 0 % and so the sum of 5 pairs is 5 ∗ 1 0 0 % = 5 0 0 % .