Let S be the set of real numbers with the property: continuous functions with exists a , so that also and
Let bet the sum of all elements in with
The answer to type in is:
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.
S is the set of all numbers of form n 1 , where n is a positive integer. Hence the answer is 2 5 2 0 × ( 1 1 + 2 1 + … + 1 0 1 ) = 7 3 8 1 .
First let's assume c = n 1 for some integer n ≥ 2 (case n = 1 is trivial) and let f be any function satisfying the problem description. Let g ( x ) = f ( x + c ) − f ( x ) be defined for x ∈ [ 0 , 1 − c ] .
Note that g ( 0 ) + g ( c ) + g ( 2 c ) … + g ( ( n − 1 ) c ) = f ( 1 ) − f ( 0 ) = 0 (by telescoping). Hence there are two values a , b such that g ( a ) ≥ 0 and g ( b ) ≤ (otherwise the sum above would be strictly negative or strictly positive). As g is continuous, Darboux property tells us that it is equal to zero somewhere.
Now, let's assume c is not of form n 1 . Let n be the largest integer such that c n < 1 . Let r = 1 − c n < c .
I will define f in such a way that f ( x + c ) > f ( x ) for all x ∈ [ 0 , 1 − c ] . To define the value of f for x I will express x = a c + b where a is the largest integer that a c ≤ x , hence 0 ≤ b < c .
Let f ( a c + b ) = a − n r b , if b ≤ r and f ( a c + b ) = a − n + ( n + 1 ) c − r b − r otherwise. The only non-trivial issues to check are:
1) f is continuous where b = 0 . To check this, note that f ( a c ) = a regardless if we use b = 0 in the first definition or b = c in the second definition.
2) f is continuous where b = r . To check this note that f ( a c + r ) = a − n regardless if we use b = r in the first definition or in the second definition.
3) f ( x + c ) ≥ f ( x ) for all x . To check this, note that if a is increased by 1 and b does not change, the value of f increases by 1.