Congruence makes my day
a a a . . . . m times ≡ 0 m o d ( am )
for all prime a’s
The congruence above is __________ .
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.
1 solution
LOL yes :))
Log in to reply
You can define the hyperoperation as Tetration operator. so
n a = m times a a … a
can you plz tell that from where have you studied modular arithmetic ,you go in some coaching institute
Log in to reply
I do not go to any coaching institute , I have studied it on my own ....
For basics you may see Brilliant Wikis .... then for little higher NT you may see Elementary NT by Burton,....
Log in to reply
@A Former Brilliant Member – have you appeared in tallentex ,Olympiads by hbcse RMO and NMTC ,if appeared what were your ranks in those exam ,,please tell
J'ai choisi a=5, m=10k. Cela a rendu facile
Log in to reply
You have a counterexample whenever m isn't a power of a .
Log in to reply
Oui! Belle observation
Log in to reply
@Department 8 – That's german?
Log in to reply
@Kushagra Sahni – No i think its French
Log in to reply
@A Former Brilliant Member – Yes,that's French.
@Kushagra Sahni – Mais oui, c'est français, nicht Deutsch ;)
Google Translate jedermann?
Log in to reply
J'étudie la langue français à l'école
Log in to reply
@Department 8 – Magnifique! La langue de la philosophie, les mathématiques ... et de l'amour! ;)
Log in to reply
@Otto Bretscher – How many languages do you know comrade !!! @Otto Bretscher
Log in to reply
@A Former Brilliant Member – Indians also know atleast 3, Hindi English and the language of their ethnic community like Punjabi in my case.
Let a = 2 and m = 3 . Then 2 2 2 fails to be divisible by 6.