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.
Wow. Short and sweet.
Exact same method! It's so lovely!!
Exactly the same! Nice!
The equation can be rewritten as:
s s − 1 = 2 0 1 3 x
So the ratio between x and 2 0 1 3 should be equal to the ratio between s − 1 and s . Since s must be an integer, it would be a factor of 2 0 1 3 or a multiplication of factors of 2 0 1 3 . Since x is merely
( s − 1 ) ( factor or multiplication of the factors of 2013 )
and that the "factor or multiplication of the factors of 2013" is definitely an integer, x would always be an integer if s is an integer.
Listing the factors of 2013:
2 0 1 3 = 3 ∗ 1 1 ∗ 6 1
The number of possible ways of pairing the 3 factors 3 ∗ 1 1 ∗ 6 1 is 7 ways:
3 , 1 1 , 6 1 , 3 ∗ 1 1 , 3 ∗ 6 1 , 1 1 ∗ 6 1 , 1 1 ∗ 6 1 ∗ 3
It also has to be noted that the value of s can also be 1 as 2 0 1 3 can be divisible by 1 .
It also has to be noted that the value of s can be negative.
Therefore, the total number of solutions is 2 ( 7 + 1 ) = 1 6
Using more (simple) algebra, one can proof that s cannot be more than 2 0 1 3
For those who have more general solutions, please post them too.
I missed the "integer " part. Thought it was positive integers.
@Julian Poon ,I think there is a slight glitch in your solution.Correct me if I am wrong.The equation in the question simplifies to 2 0 1 3 − x = s 2 0 1 3 ⟹ s is a factor of 2013 but it could be positive or negative. 2 0 1 3 = 3 ∗ 1 1 ∗ 6 1 . Thus,s could take values: 1 , 3 , 1 1 , 6 1 , 3 ∗ 1 1 , 3 ∗ 6 1 , 1 1 ∗ 6 1 , 3 ∗ 1 1 ∗ 6 1 , − 1 , − 3 , − 1 1 , − 6 1 , − 3 ∗ − 1 1 ∗ − 6 1 . I think the mistake you accidentally made was you also counted, − 3 ∗ − 1 1 , − 3 ∗ − 6 1 , − 1 1 ∗ − 6 1 which are equal to 3 ∗ 1 1 , 3 ∗ 6 1 , 1 1 ∗ 6 1 respectively,which you have already counted.
Log in to reply
@Adarsh Kumar
You might have misinterpreted my solution. I did not count the multiplications of 2 negative numbers but instead I multiplied the number, count how many numbers there are and then × 2 to also count the negative. This way, the repetition of negatives are not accounted for. I might have misunderstood your reply so do please clarify. Thanks
Log in to reply
can you tell me the solutions you got?
Log in to reply
@Adarsh Kumar – s = 3 , 1 1 , 6 1 , 3 3 , 1 8 3 , 6 7 1 , 2 0 1 3 , 1 , − 1 , − 2 0 1 3 , − 6 7 1 , − 1 8 3 , − 3 3 , − 6 1 , − 1 1 , − 3
Log in to reply
@Julian Poon – Ok,I accept my defeat and thanx for clearing my doubt!!:)
x=2013, s=1 does not satisfy original equation. So answer must be 15. Right?
s= 2013 /2013-x; s will be integer if and only if 2013-x is some integer factor of 2013 that integer factor may be positive or negative 2013 factors are 1, 3, 11, 33, 61, 183, 671, 2013 -1, -3, -11, -33, -61, -183, -671, -2013(considering negative also because in the question he mentioned it is integer i.e can be negative also ) therefore total factors are [16] therefore there are 16 ordered pairs possible for the given problem
Problem Loading...
Note Loading...
Set Loading...
It is given that:
s − 2 0 1 3 s x − 1 = 0
⇒ 2 0 1 3 s − s x = 2 0 1 3 ⇒ s ( 2 0 1 3 − x ) = 2 0 1 3
For integer solutions, both s and ( 2 0 1 3 − x ) are integers and since 2 0 1 3 = 3 × 1 1 × 6 1 , there are 8 possible unordered pairs:
For each of these 8 unordered pair there are 2 solutions for s and x and therefore are 1 6 .