The sum of all real numbers x such that
x = 2 9 1 ( 3 − 2 0 1 3 2 9 x − 1 )
can be written as c a b , where a and c are positive coprime integers and b is a positive integer that is not divisible by the square of a prime. Find a + b + c .
This problem is posed by Zi Song Y .
Details and assumptions
Note: a , b and c could be 1. For example, if the sum is 1 = 1 1 1 , then your answer is a + b + c = 3 .
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.
L e t f ( a , b , c ) = 3 − ( 2 9 ∗ ( a ∗ s q r t ( b ) / c ) − 1 ) ( 1 / 2 0 1 3 ) ) − 2 9 ∗ ( a ∗ s q r t ( b ) / c ) . I v a r i e d v a l u e s o f a , b , c . a = 1 , b = 1 , f ( 1 , 1 , 1 0 ) = − 0 . 0 3 1 . . . . , f ( 1 , 1 , 2 0 ) = + . 0 8 9 . . . . S o c l o s e u p , f ( 1 , 1 , 1 5 ) = + . 0 0 2 3 . . . . f ( 1 , 1 , 1 4 ) = − . 2 4 6 4 2 2 . . . Z e r o b e t w e e n c = 1 4 a n d c = 1 5 . N o z e r o a t a n i n t e g e r . S o b = 1 . b = 2 t o 5 a l s o g a v e n o s o l u t i o n . N e x t t r i e d a = 2 , b = 1 , c = 1 , 1 0 , 2 0 , 2 9 ! ! ! ! g o t 0 , t h e s o l u t i o n . S o a = 2 , b = 1 , c = 2 9 . S t i l l r e q u i r e d t o p r o v e t h a t t h i s i s t h e o n l y s o l u t i o n . N o t e ( a ∗ s q r t ( b ) / c ) = x .
Problem Loading...
Note Loading...
Set Loading...
Given: x = 2 9 1 ( 3 − 2 0 1 3 2 9 x − 1 )
Let 2 9 x − 1 = t 2 0 1 3
⟹ t 2 0 1 3 + t − 2 = 0
Let f ( t ) = t 2 0 1 3 + t − 2 . By Descartes' Rule of Signs , we get,
∙ At max 1 positive real root since number of sign changes in f ( t ) = t 2 0 1 3 + t − 2 is 1
∙ At max 0 negative real roots since number of sign changes in f ( − t ) = − t 2 0 1 3 − t − 2 is 0
Also, t = 1 is a root of f ( t ) and it must be the only real root (by Descartes' Rule of Signs).
⟹ x = 2 9 2
⟹ a + b + c = 3 2