## [Golang] Naive Method for Primality Test

Naive method for primality test in Go: Given a natural number n, if n is divisible by any number from 2 to square root of n, then n is composite. Otherwise n is prime.

read more »Naive method for primality test in Go: Given a natural number n, if n is divisible by any number from 2 to square root of n, then n is composite. Otherwise n is prime.

read more »Calculate politeness of a number online, i.e., the number of ways it can be expressed as the sum of consecutive integers.

read more »Calculate politeness of a number in Go, i.e., the number of ways it can be expressed as the sum of consecutive integers

read more »Online tool for prime factorization and calculating sum of proper divisors. The algorithm is implemented in JavaScript and UI in Vue.js.

read more »Online tool that helps you do prime factorization. The algorithm is implemented in JavaScript and UI in Vue.js.

read more »*Sieve of Eratosthenes* is a simple and ancient method to find prime
numbers up to a given limit. Given a limit, this online demo returns
all prime number below the limit.

Online demo of *sieve of eratosthenes* via Go/GopherJS/gopherjs-vue.

Euler's Totient Function φ(n) counts the positive integers that are relatively prime to n. This online demo use naive method to calculate φ(n) and positive integers coprime to n.

read more »Goldbach's conjecture - Every even integer greater than 2 can be written as the sum of two primes. Given a positive even integer, this online demo returns the two primes.

read more »JavaScript implementation of *Sieve of Eratosthenes*.

Go solution to Project Euler.

read more »Go solution to Quadratic primes - Problem 27 - Project Euler.

read more »2n + 1 = p + 2q always has a solution in primes p and q (not necessarily distinct) for n > 2. This online demo finds p and q for given odd number greater than 5. The demo is written in Go and compiled to JavaScript using GopherJS.

read more »2n + 1 = p + 2q always has a solution in primes p and q (not necessarily distinct) for n > 2. This online demo finds p and q for given odd number greater than 5.

read more »2n + 1 = p + 2q always has a solution in primes p and q (not necessarily distinct) for n > 2. Write a Go program to find p and q for given odd number greater than 5.

read more »Go solution to Non-abundant sums - Problem 23 - Project Euler.

read more »Given a natural number (integer), calculate the number of divisors of it in Go programming language.

read more »Go solution to highly divisible triangular number - Problem 12 - Project Euler.

read more »Go solution to summation of primes - Problem 10 - Project Euler.

read more »Go solution to 10001st prime - Problem 7 - Project Euler.

read more »*Goldbach's conjecture* - Every even integer greater than 2 can be
written as the sum of two primes. Given a positive even integer, write
a Go program to find the two primes.

Euler's totient function implementation in Go programming language.

read more »Go solution to amicable numbers - Problem 21 - Project Euler.

read more »Calculate the sum of all proper divisors (factors) of an integer number in Go programming language.

read more »Go solution to largest prime factor of 600851475143 - Problem 3 - Project Euler.

read more »*Prime Factorization* - Find all prime factors of a given integer
number in Go programming language.

Go implementation of primality test - optimized school method.

read more »Go implementation of *Sieve of Eratosthenes*.