Function Problem7

project_euler/problem_7/problem7.go:16–27

(n uint)

import "github.com/TheAlgorithms/Go/math/prime"

func Problem7(n uint) int64 {
	count, i := uint(0), int64(1)

	for count < n {
		i++
		if prime.OptimizedTrialDivision(i) {
			count++
		}
	}

	return i
}