For any real number x , let ⌊ x ⌋ represent the largest integer number less than or equal to x . If 1 < x < 2 2 0 1 5 and 2 2 0 1 5 is a factor of ⌊ 2 2 0 1 5 x ⌋ − ⌊ x ⌋ , find the exact value of the sum of two coprime numbers a and b if b a = 2 0 1 5 ⌊ x ⌋ ⌊ 2 2 0 1 5 x ⌋ − ⌊ x ⌋ .
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.
This problem can be solved very easily if you express x in base 2. When a number is represented in base 10, if you multiply it by a power of 10 then you have to move the decimal point to the right a number of places which is the same as the exponent. In the case that a number is represented in base 2 a similar property applies: if you multiply the number by 2 n then you have to move the decimal point to right n places.
Log in to reply
@Arturo Presa Although I am too late , but if you could help me out by posting your solution , then please do so .
Problem Loading...
Note Loading...
Set Loading...
Let us represent x = ⌊ x ⌋ + r where 0 ≤ r < 1 . Multiplying both sides by 2 2 0 1 5 we obtain 2 2 0 1 5 x = 2 2 0 1 5 ⌊ x ⌋ + 2 2 0 1 5 r . Therefore ⌊ 2 2 0 1 5 x ⌋ = 2 2 0 1 5 ⌊ x ⌋ + ⌊ 2 2 0 1 5 r ⌋ ( ∗ ) Obviously 0 ≤ ⌊ 2 2 0 1 5 r ⌋ < 2 2 0 1 5 . Since 2 2 0 1 5 is a factor of ⌊ 2 2 0 1 5 x ⌋ − ⌊ x ⌋ , using ( ∗ ) we obtain that 2 2 0 1 5 is a factor of the difference ⌊ 2 2 0 1 5 r ⌋ − ⌊ x ⌋ where both terms are not negative integer numbers less than 2 2 0 1 5 . Thus that difference must be 0 and then ⌊ 2 2 0 1 5 r ⌋ = ⌊ x ⌋ . Substituting in ( ∗ ) we get ⌊ 2 2 0 1 5 x ⌋ = 2 2 0 1 5 ⌊ x ⌋ + ⌊ x ⌋ Since ⌊ x ⌋ is not equal to zero, ⌊ x ⌋ ⌊ 2 2 0 1 5 x ⌋ − ⌊ x ⌋ = 2 2 0 1 5 . Hence b a = 2 , that implies that a = 2 and b = 1 . Then the answer is 3.