Anti-primes: Difference between revisions

No change in size ,  11 months ago
Line 3,020:
 
DivisorCount :: proc(v: int) -> int {
total := 1
a := v
for (a % 2 == 0) {
Line 3,026:
a /= 2
}
for p := 3; ((p * p) <= a); p += 2 {
count := 1
for (a % p == 0) {
Line 3,032:
a /= p
}
p += 2
total *= count
}
37

edits