Project Euler #3 Implementation in golang.

main.go

package main

import (
	"fmt"
)

func primeNumbers(n int, pChan chan int) {
	defer close(pChan)
	for i := 2; i <= n; i++ {
		prime := true
		for j := 2; j <= i-1; j++ {
			if i%j == 0 {
				prime = false
				break //since we know this isnt a clean guy
			}
		}
		if prime {
			pChan <- i
		}
	}
}

func solution(n int) int {
	pChan := make(chan int)
	go primeNumbers(n, pChan)
	var max int
	for v := range pChan {
		if n%v == 0 {
			n /= v
			if v > max {
				max = v
			}
		}
		if n <= 1 {
			break
		}
	}
	fmt.Println("Max value is: ", max)
	return max
}

func main() {
	k := solution(600851475143)
	fmt.Println("Largest Prime Factor is: ", k)
}