Function numDivisors

project_euler/problem_12/problem12.go:38–46

(n uint)

}

func numDivisors(n uint) uint {
	divisors := uint(0)
	for i := uint(1); i*i <= n; i++ {
		if n%i == 0 {
			divisors += 2
		}
	}
	return divisors
}