Merge pull request #268 from Arkadyuti30/master

prateekiiest · web-flow · commit 774e51828d38 · 2018-01-01T07:30:42.000+05:30
README file for Project_Euler folder added
diff --git a/Competitive Coding/Math/Project_Euler/Problem_21/P21.class b/Competitive Coding/Math/Project_Euler/Problem_21/P21.class
diff --git a/Competitive Coding/Math/Project_Euler/Problem_21/P21.java b/Competitive Coding/Math/Project_Euler/Problem_21/P21.java
@@ -0,0 +1,48 @@
+package problem_21;
+class P21
+{ //Begin class
+
+
+	/***** Function to calculate the sum of proper divisors or factors *****/
+	public static int sumFactors(int num)
+	{ //Begin sumFactors()
+		int sum = 0;
+		
+		for(int i = 1; i<num; i++)
+		{ //Begin for
+			if(num % i == 0)
+				sum += i;
+		} //End for
+		
+		return sum;
+	} //End sumFactors()
+	
+	
+	
+	
+	public static void main(String args[])
+	{ //Begin main()
+		int sum_amicable = 0; 
+		int x = 0; 
+		int y = 0;
+		
+		
+		for(int n = 1; n<=10000; n++)
+		{ //Begin for
+			
+			x = sumFactors(n); //Sum of factors or divisors of n
+			y = sumFactors(x); //Sum of factors or divisors of x
+												
+			/*** 
+			1. Checking if the number is not equal to sum of its factors and if the number is equal to y(sum of factors of x) then the number is added to the sum of amicable numbers
+			
+			2. The other number of the amicable pair is added when it appears in the loop later and checking is done for it		***/
+			
+			if((n != x) && (n == y))  
+				sum_amicable += n;
+
+		} //End for
+		
+		System.out.println("Sum of amicable numbers less than 10000 is:\t"+sum_amicable);
+	} //End main()
+} //End class
diff --git a/Competitive Coding/Math/Project_Euler/Problem_21/README.md b/Competitive Coding/Math/Project_Euler/Problem_21/README.md
@@ -0,0 +1,12 @@
+# Amicable numbers
+
+----------------------------------------------------------------------------------------------
+
+### Problem 21
+
+Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
+If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
+
+For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
+
+Evaluate the sum of all the amicable numbers under 10000.
diff --git a/Competitive Coding/Math/Project_Euler/README.md b/Competitive Coding/Math/Project_Euler/README.md
@@ -0,0 +1,12 @@
+# Project Euler
+
+----------------------------------------------------------------------------------------------
+
+### What is Project Euler?
+
+Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems.
+
+The motivation for starting Project Euler, and its continuation, is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context.
+
+
+Click here to check out the problems: [Project Euler] (https://projecteuler.net/)
diff --git a/Competitive Coding/Math/Project_Euler/amicable_pair(prob 21).java b/Competitive Coding/Math/Project_Euler/amicable_pair(prob 21).java
@@ -0,0 +1,49 @@
+package Euler
+class P21
+{ //Begin class
+
+
+	/***** Function to calculate the sum of proper divisors or factors *****/
+	public static int sumFactors(int num)
+	{ //Begin sumFactors()
+		int sum = 0;
+		
+		for(int i = 1; i<num; i++)
+		{ //Begin for
+			if(num % i == 0)
+				sum += i;
+		} //End for
+		
+		return sum;
+	} //End sumFactors()
+	
+	
+	
+	
+	public static void main(String args[])
+	{ //Begin main()
+		int sum_amicable = 0; 
+		int x = 0; 
+		int y = 0;
+		
+		
+		for(int n = 1; n<=10000; n++)
+		{ //Begin for
+			
+			x = sumFactors(n); //Sum of factors or divisors of n
+			y = sumFactors(x); //Sum of factors or divisors of x
+						
+						
+			/*** 
+			1. Checking if the number is not equal to sum of its factors and if the number is equal to y(sum of factors of x) then the number is added to the sum of amicable numbers
+			
+			2. The other number of the amicable pair is added when it appears in the loop later and checking is done for it		***/
+			
+			if((n != x) && (n == y))  
+				sum_amicable += n;
+
+		} //End for
+		
+		System.out.println("Sum of amicable numbers less than 10000 is:\t"+sum_amicable);
+	} //End main()
+} //End class
diff --git a/Competitive Coding/Math/Project_Euler/p21.class b/Competitive Coding/Math/Project_Euler/p21.class
