Modulo behaviour

Revision en1, by WalidMasri, 2016-02-07 22:48:41

Hello everyone!

i was trying to solve this problem , but i faced a problem in modulo which caused me to get WA as a verdict. When computing the formula  , once n is reduced by the modulo operation, the prime divisors (p1,p2... pk) wont remain a divisors of n, hence, getting a non-integer result.

What can i do to avoid such problem?

Thanks!

Tags modulo, euler, number theory

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English WalidMasri 2016-02-09 19:41:29 139
en2 English WalidMasri 2016-02-07 22:57:55 49
en1 English WalidMasri 2016-02-07 22:48:41 507 Initial revision (published)