Prime Number Generator

package main

import "fmt"

func isPrime(number int) bool {
	if number < 2 {
		return false
	}
	for divisor := 2; divisor*divisor <= number; divisor++ {
		if number%divisor == 0 {
			return false
		}
	}
	return true
}

func primesUpTo(limit int) []int {
	var primes []int
	for number := 2; number <= limit; number++ {
		if isPrime(number) {
			primes = append(primes, number)
		}
	}
	return primes
}

func main() {
	fmt.Println(primesUpTo(50))
}