algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 21:14:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2020-10-24 10:23:28 +00:00
parent a23bac99e8
commit 5d59a2e828
219 changed files with 13758 additions and 14582 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
Others/EulersFunction.java
View File

@ -2,26 +2,27 @@ package Others;
/**
* You can read more about Euler's totient function
* <p>
* See https://en.wikipedia.org/wiki/Euler%27s_totient_function
*
* <p>See https://en.wikipedia.org/wiki/Euler%27s_totient_function
*/
public class EulersFunction {
// This method returns us number of x that (x < n) and gcd(x, n) == 1 in O(sqrt(n)) time complexity;
public static int getEuler(int n) {
int result = n;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0) n /= i;
result -= result / i;
}
}
if (n > 1) result -= result / n;
return result;
// This method returns us number of x that (x < n) and gcd(x, n) == 1 in O(sqrt(n)) time
// complexity;
public static int getEuler(int n) {
int result = n;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0) n /= i;
result -= result / i;
}
}
if (n > 1) result -= result / n;
return result;
}
public static void main(String[] args) {
for (int i = 1; i < 100; i++) {
System.out.println(getEuler(i));
}
public static void main(String[] args) {
for (int i = 1; i < 100; i++) {
System.out.println(getEuler(i));
}
}
}