Conceptual Doubt

Revision en1, by vbansal027, 2016-08-14 15:01:18

Can somebody please explain, why in the following question,
http://mirror.codeforces.com/problemset/problem/576/A are we checking with all the powers of a prime whether the given number is divisible or not? why don't we stop, for a prime factor, as soon as we find its first power that is either greater than n or doesn't divide it completely ?

Tags number theory

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English vbansal027 2016-08-14 15:01:18 357 Initial revision (published)