eulerFive.go

func smallestMult() {
	fmt.Println("searching for ans.")
	res := 1
	for i := 1; i <= 20; i++ {
		j := maxPowPrime(i)
		if j == 0 {
			continue
		}
		res *= j
	}
	fmt.Println(res, "is the answer")
}

func maxPowPrime(x int) int {
	//checks if prime in the first place
	for y := 2; y < x; y++ {
		if (x % y) == 0 {
			return 0
		}
	}
	pow := 2
	p := int(math.Pow(float64(x), float64(pow)))
	last := x
	for p < 20 && x > 1 {
		pow++
		last = p
		p = int(math.Pow(float64(x), float64(pow)))
	}
	return last
}