Solution

Question 3/Answer/Q3.c

@@ -0,0 +1,38 @@
+/**
+
+Name: Kumar Ashwin
+Email: krashwin00@gmail.com
+Date: 2nd April, 2020
+Version: v1
+Problem Statement: There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc.
+
+**/
+
+#include<stdio.h>
+#include<math.h>
+int main()
+{
+    int m=2,n;
+    int a,b,c,sum,pro;
+    while(a<333)  //as a being the smallest number it must not exceed 333
+    {
+        for(int n=1;n<m;n++)
+        {
+            //Using Euclid's formulae to find out the triplets (a,b,c)
+            a=pow(m,2)-pow(n,2);
+            b=2*m*n;
+            c=pow(m,2)+pow(n,2);
+
+            //finding if the sum of triplets are a multiple of 1000, then we can multiply each digit of triplet to find the numbers when added form 1000.
+            sum=a+b+c;
+            if(1000%sum==0)     
+            {
+                sum=1000/sum;
+                pro=(a*sum)*(b*sum)*(c*sum);
+            }
+        }
+        m++;
+    }
+    printf("abc=%d",pro);
+    return 0;
+}

Question 3/Answer/README.md

@@ -0,0 +1,19 @@
+# Question 3 - Solution
+
+### Execution Instructions
+* **Compiler Details** : gcc
+* Type down the command in the linux terminal ` gcc Q3.c -lm -o run `
+* The above mentioned command will generate an object file which can be run directly on the terminal using ` ./run `
+* `-lm` switch is used to incorporate _math.h_ header file and `-o` switch is used to create an object for the C file.
+
+
+### Input & Output
+
+* **No Input Required**
+* **Output**
+    > abc=31875000
+
+### Author
+* **Kumar Ashwin**
+* **Email:** krashwin00@gmail.com
+