pranitb10
diff --git a/‎Math/EulerTotient.java
Copy file name to clipboard
+31Lines changed: 31 additions & 0 deletions b/‎Math/EulerTotient.java
Copy file name to clipboard
+31Lines changed: 31 additions & 0 deletions
diff --git a/‎Math/EulerTotientExample.class
Copy file name to clipboard
446 Bytes b/‎Math/EulerTotientExample.class
Copy file name to clipboard
446 Bytes
diff --git a/‎Math/EulerTotientExample.java
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions b/‎Math/EulerTotientExample.java
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions
@@ -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;
+	}
@@ -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;
+	}