Added example of Euler Totient to Math directory

mpeiffer · mpeiffer · commit fea167ebd8b9 · 2019-10-12T16:16:14.000-07:00
diff --git a/Math/EulerTotient.java b/Math/EulerTotient.java
@@ -0,0 +1,31 @@
+public int EulerTotient( int number )
+	{
+		int k, divisor;
+		int gcd = 1;
+		int totiatives = 0;
+
+		// Check all numbers, k, inclusively between 1 and number
+		for( k = 1; k <= number; k++ )
+			{
+			
+				// Check all divisors of k
+				for( divisor = 1; divisor < k; divisor++ )
+				{   
+				
+					// Find greatest common denominator of (n, k)
+					if( k % divisor == 0 && number % divisor == 0 )
+						{
+							gcd = divisor;
+						}
+				}
+		
+				// If gcd is relatively prime, we have found a totient
+				if( gcd == 1 )
+					{
+						totiatives++;
+					}
+
+			}
+
+		return totiatives;
+	}
diff --git a/Math/EulerTotientExample.class b/Math/EulerTotientExample.class
diff --git a/Math/EulerTotientExample.java b/Math/EulerTotientExample.java
@@ -0,0 +1,32 @@
+
+public int EulerTotient( int number )
+	{
+		int k, divisor;
+		int gcd = 1;
+		int totiatives = 0;
+
+		// Check all numbers, k, inclusively between 1 and number
+		for( k = 1; k <= number; k++ )
+			{
+			
+				// Check all divisors of k
+				for( divisor = 1; divisor < k; divisor++ )
+				{   
+				
+					// Find greatest common denominator of (n, k)
+					if( k % divisor == 0 && number % divisor == 0 )
+						{
+							gcd = divisor;
+						}
+				}
+		
+				// If gcd is relatively prime, we have found a totient
+				if( gcd == 1 )
+					{
+						totiatives++;
+					}
+
+			}
+
+		return totiatives;
+	}
