Smallest Multiple Problem. Project Eular #5

main.go

package main

import "fmt"

func solution() int {
	var min int
	num := 21
	found := false
	for !found {
		var clean bool
		//divisor declaration
		for i := 1; i <= 20; i++ {
			if num%i != 0 {
				clean = false
				break
			} else {
				clean = true
			}
		}

		if clean {
			found = true
			min = num
		}
		num++
	}
	return min
}

func main() {
	min := solution()
	fmt.Println("Min is: ", min)
}