exercism/go/prime-factors/prime.go

22 lines
324 B
Go

package prime
const testVersion = 2
func Factors(fnd int64) []int64 {
var ret []int64
var i int64
foundFactor := true
for i = 2; i < fnd; i++ {
for j := range ret {
if i%ret[j] == 0 {
// Already covered this case, move on
foundFactor = false
}
if !foundFactor {
break
}
}
}
return ret
}