From bee3bd273994def457f411e9783e1d7fb433d173 Mon Sep 17 00:00:00 2001
From: Rak Laptudirm <68542775+raklaptudirm@users.noreply.github.com>
Date: Fri, 12 Mar 2021 15:41:47 +0530
Subject: [PATCH 1/2] More efficient prime check

---
 Maths/PrimeCheck.js | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Maths/PrimeCheck.js b/Maths/PrimeCheck.js
index c0f626ce60..fdfaf1ccae 100644
--- a/Maths/PrimeCheck.js
+++ b/Maths/PrimeCheck.js
@@ -11,8 +11,9 @@ const PrimeCheck = (n) => {
   // output: boolean
   if (n === 1) return false
   if (n === 0) return false
+  if (n % 2 === 0) return false
 
-  for (let i = 2; i * i <= n; i++) {
+  for (let i = 3; i * i <= n; i+=2) {
     if (n % i === 0) {
       return false
     }

From 8c563a1507c0742d365a5443395c9e56d017ec4b Mon Sep 17 00:00:00 2001
From: Rak Laptudirm <68542775+raklaptudirm@users.noreply.github.com>
Date: Fri, 12 Mar 2021 15:49:01 +0530
Subject: [PATCH 2/2] Style update

---
 Maths/PrimeCheck.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Maths/PrimeCheck.js b/Maths/PrimeCheck.js
index fdfaf1ccae..5cf5240cb4 100644
--- a/Maths/PrimeCheck.js
+++ b/Maths/PrimeCheck.js
@@ -13,7 +13,7 @@ const PrimeCheck = (n) => {
   if (n === 0) return false
   if (n % 2 === 0) return false
 
-  for (let i = 3; i * i <= n; i+=2) {
+  for (let i = 3; i * i <= n; i += 2) {
     if (n % i === 0) {
       return false
     }