Create primalityTest.go (#179)

* Create the prime_check.go

* Added test file

Author: vedantmamgain

math/prime_check/prime_check.go

@@ -0,0 +1,34 @@
+//A primality test is an algorithm for determining whether an input number is prime.Among other fields of mathematics, it is used for cryptography.
+//Unlike integer factorization, primality tests do not generally give prime factors, only stating whether the input number is prime or not.
+//Source - Wikipedia https://en.wikipedia.org/wiki/Primality_test
+package main
+
+func NaiveApproach(n int) bool {
+	if n < 2 {
+		return false
+	}
+	for i := 2; i < n; i++ {
+
+		if n%i == 0 {
+			return false
+		}
+	}
+	return true
+}
+
+func PairApproach(n int) bool {
+	if n < 2 {
+		return false
+	}
+	for i := 2; i*i <= n; i++ {
+		if n%i == 0 {
+			return false
+		}
+	}
+	return true
+}
+
+//goos: windows
+//goarch: amd64
+//BenchmarkNaiveApproach-12       660980034                1.81 ns/op
+//BenchmarkPairApproach-12        664641356                1.82 ns/op

math/prime_check/prime_check_test.go

@@ -0,0 +1,44 @@
+package main
+
+import (
+	"testing"
+)
+
+func TestTableNaiveApproach(t *testing.T) {
+	var tests = []struct {
+		input    int
+		expected bool
+	}{
+		{2, true},
+		{3, true},
+		{1, false},
+		{10, false},
+		{23, true},
+	}
+
+	for _, test := range tests {
+		if output := NaiveApproach(test.input); output != test.expected {
+			t.Error("Test Failed: {} inputted, {} expected, recieved: {}", test.input, test.expected, output)
+		}
+	}
+
+}
+func TestTablePairApproach(t *testing.T) {
+	var tests = []struct {
+		input    int
+		expected bool
+	}{
+		{2, true},
+		{3, true},
+		{1, false},
+		{10, false},
+		{23, true},
+	}
+
+	for _, test := range tests {
+		if output := PairApproach(test.input); output != test.expected {
+			t.Error("Test Failed: {} inputted, {} expected, recieved: {}", test.input, test.expected, output)
+		}
+	}
+
+}