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.
Really very good jump for you that you've gotten to level 5 in NT so soon! Keep it up! Was it only Brilliant that helped you or..anything else? Adarsh Kumar
Log in to reply
Actually yes.But I have read many books on NT like the 104 NT problems.
Log in to reply
and thank you.
Which others apart from 104 NT? Like any ones...which helped you to write olympiad level proofs? Adarsh Kumar
Log in to reply
@Jayakumar Krishnan – no sorry nothing else than this.104 NT problems didn't give me much info about modular arithmetic,I mainly learned it from Brilliant.
Indeed its the elegant one
asem, ane pake wolfram :v
gapapa bang....... yg penting dpt poin
According to Wilson's theorem: (p-2)! = 1(mod 103) Thus, (103-2)! = 1(mod103) =(101)! = 1(mod 103)
Actually Wilson's theorem states (p-1)! = -1(mod 103), on simplifying we get what u have said..... but,, this was a nice problem
Problem Loading...
Note Loading...
Set Loading...
By Wilson's theorem we have that 102!=-1(mod103).But 102!(mod103)=101!(mod103) x 102(mod103)=-1.102(mod103)=-1.Now if and only if 101!(mod103)=1 is this possible.