Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,923 questions

51,856 answers

573 users

How to calculate the Nth prime number in Go

2 Answers

0 votes
// 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73

package main

import (
	"fmt"
)

func GetTheNthPrimeNumber(nth int) int {
	prime := 1
	count := 0

	for count < nth {
		prime++
		isPrime := true
		for i := 2; i <= prime; i++ {
			if prime % i == 0 && i != prime {
				isPrime = false
				break
			}
		}
		if isPrime {
			count++
		}
	}

	return prime
}

func main() {
	nth := 9

	fmt.Printf("Nth prime: %d\n", GetTheNthPrimeNumber(nth))
}



/*
run:

Nth prime: 23

*/

 



answered Aug 27, 2024 by avibootz
0 votes
// 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73

package main

import (
	"fmt"
)

func GetTheNthPrimeNumber(nth int) int {
	prime := 1
	count := 0

	for count < nth {
		prime++
		i := 2
		for ; i <= prime; i++ {
			if prime%i == 0 {
				break
			}
		}
		if i == prime {
			count++
		}
	}

	return prime
}

func main() {
	nth := 9

	fmt.Printf("Nth prime: %d\n", GetTheNthPrimeNumber(nth))
}



/*
run:

Nth prime: 23

*/

 



answered Aug 27, 2024 by avibootz

Related questions

1 answer 172 views
1 answer 96 views
1 answer 97 views
1 answer 94 views
2 answers 107 views
1 answer 85 views
1 answer 80 views
...