From d64bcee1d84b470a5410456f36abbe80896b927b Mon Sep 17 00:00:00 2001
From: Jowin John Chemban <29167718+jowinjohnchemban@users.noreply.github.com>
Date: Mon, 5 Oct 2020 12:36:26 +0530
Subject: [PATCH 1/2] Create prime.c

---
 contribution/jowinjohnchemban/prime.c | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 contribution/jowinjohnchemban/prime.c

diff --git a/contribution/jowinjohnchemban/prime.c b/contribution/jowinjohnchemban/prime.c
new file mode 100644
index 00000000..13cb2379
--- /dev/null
+++ b/contribution/jowinjohnchemban/prime.c
@@ -0,0 +1,24 @@
+ #include<stdio.h>
+
+int main(){
+
+    int num,i,count,n;
+    printf("Enter max range: ");
+    scanf("%d",&n);
+
+    for(num = 1;num<=n;num++){
+
+         count = 0;
+
+         for(i=2;i<=num/2;i++){
+             if(num%i==0){
+                 count++;
+                 break;
+             }
+        }
+
+         if(count==0 && num!= 1)
+             printf("%d,",num);
+    }
+   return 0;
+}

From 74ca0c1c8c7fe79ceda84aebac68df49e2cb555a Mon Sep 17 00:00:00 2001
From: Jowin John Chemban <29167718+jowinjohnchemban@users.noreply.github.com>
Date: Mon, 5 Oct 2020 12:38:10 +0530
Subject: [PATCH 2/2] Create checkifsumofprime.c

---
 .../jowinjohnchemban/checkifsumofprime.c      | 77 +++++++++++++++++++
 1 file changed, 77 insertions(+)
 create mode 100644 contribution/jowinjohnchemban/checkifsumofprime.c

diff --git a/contribution/jowinjohnchemban/checkifsumofprime.c b/contribution/jowinjohnchemban/checkifsumofprime.c
new file mode 100644
index 00000000..31cdbe08
--- /dev/null
+++ b/contribution/jowinjohnchemban/checkifsumofprime.c
@@ -0,0 +1,77 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<conio.h>
+#include<windows.h> //WINDOWS
+
+
+int checkPrime(int n);
+
+int main()
+{
+    int n, i, flag = 0;
+
+    system("CLS");
+    printf("\n\n\n");
+	printf("\n\t ######################################");
+	printf("\n\t #                                    #");
+	printf("\n\t #           CHECK A NUMBER           #");
+	printf("\n\t #           REPRESENTED AS           #");
+	printf("\n\t #      SUM OF TWO PRIME NUMBERS      #");
+	printf("\n\t #                                    #");
+	printf("\n\t ######################################\n");
+
+    Sleep(2000);
+    system("CLS");
+
+	printf("\n Enter a positive integer : ");
+    scanf("%d", &n);
+	printf("\n");
+
+
+    for(i = 2; i <= n/2 && !kbhit() ; ++i)
+    // iterate till i=n/2 and there is no key pressed - interupt
+    {
+        // condition for i to be a prime number
+        if (checkPrime(i) == 1)
+        {
+            // condition for n-i to be a prime number
+            if (checkPrime(n-i) == 1)
+            {
+                // n = primeNumber1 + primeNumber2
+                printf("  %d = %d + %d\n", n, i, n - i);
+                flag = 1;
+            }
+
+        }
+    }
+
+	printf("\a");
+    if (flag == 0)
+        printf(" %d cannot be expressed as the sum of two prime numbers.\a", n);
+        // cannot expressed as sum of two prime numbers
+
+
+	getch();
+	system("CLS");
+	return 0;
+	// EXIT
+}
+
+// Function to check prime number
+int checkPrime(int n)
+{
+    int i, isPrime = 1;
+
+    for(i = 2; i <= n/2; ++i)
+    {
+        if(n % i == 0)
+        {
+            isPrime = 0;
+            break;
+        }
+    }
+
+    return isPrime;
+}
+
+