x m o d ( x + 1 ) + x = 2 0
Find x satisfying the equation above. Submit x + 9 .
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.
x ( m o d ( x + 1 ) ) stands for the remainder of x when divided by x + 1 , which is just x for any positive x , since x ≥ 2 1 ( x + 1 ) .
Therefore, the equation becomes x + x = 2 0 , which solves to x = 1 0 , and 1 0 + 9 = 1 9 .
LaTeX: 2 0
Intelligible Solution: 1 0
Uniqueness: 1 0
Algorithmic Structure: 3
Pics: 0
Animations: 0
Total: 4 3
Awarded 'BRILLIAthon Star' for Problem 3 .
@Yajat Shamji - Hope I'm not late, I was sleeping, timezone differences and all :)
x m o d y Just equals to the value of the remainder, when x is divided by y . Here's a fun GIF to explain the Modulo Operator visually -
Now, Let's look at our problem -
x m o d ( x + 1 ) + x = 2 0
x m o d ( x + 1 ) must be equal to x as for all integers a ⇒ 0 < a < b , a m o d b = a
Simplifying the problem -
x m o d ( x + 1 ) + x x + x 2 x ⇒ x = 2 0 = 2 0 = 2 0 = 1 0
As the answer is x + 9 ⇒ 1 0 + 9 = 1 9
@Yajat Shamji - I'm ready for scores!
LaTeX: 2 0
Intelligible Solution: 1 0
Uniqueness: 0
Algorithmic Structure: 3
Pics: 1
Animations: 0
Total: 3 4
Log in to reply
How is anyone supposed to post a unique solution, enlighten me @Yajat Shamji ?
Log in to reply
@David Vreken posted the first solution, so his is going to be unique...
Log in to reply
@Yajat Shamji – Two words - Timezones and sleep :) Hope you understood, if you didn't, then @mention me
Log in to reply
@A Former Brilliant Member – You know, for a solution to be unique, it needs to be unique from the other fellow competitor's solutions.
Log in to reply
@Yajat Shamji – and it needs me to stay up for too long, so I surrender(leaving the contest), coz I can't post solutions at early morning. Bye @Yajat Shamji
Log in to reply
@A Former Brilliant Member – Do you want me to extend editing till 5 : 0 0 pm?
Log in to reply
@Yajat Shamji – I want to sleep, so thanks but no thanks
Log in to reply
@A Former Brilliant Member – Final offer: 9 : 0 0 pm - is 4 : 0 0 pm in US?...
Log in to reply
@Yajat Shamji – Goodnight :) I don't negotiate :)
Log in to reply
@A Former Brilliant Member – Fine....
Just to let you know, you've lost 1 1 1 points and 2 nd place...
(Not emotionally blackmailing you, ok?)
Log in to reply
@Yajat Shamji – I value my sleep and health over a few points and a small contest (No offense) I don't take it as an emotional blackmail, cause you can't really emotional blackmail me, only villains know how to do that :)
Problem Loading...
Note Loading...
Set Loading...
For integers 0 < n < m , n m o d m = n . Therefore,
x m o d ( x + 1 ) + x x + x 2 x ⟹ x = 2 0 = 2 0 = 2 0 = 1 0
The answer is x + 9 = 1 9 .