algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: update the whole repository

Browse Source 
* fix some bugs
* delete duplicate files
* format code
This commit is contained in:
yanglbme
2019-05-09 19:32:54 +08:00
parent 163db8521a
commit 29948363da
368 changed files with 4372 additions and 30841 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
Others/EulersFunction.java
View File

@@ -1,11 +1,16 @@
// You can read more about Euler's totient function
// https://en.wikipedia.org/wiki/Euler%27s_totient_function
package Others;
/**
* You can read more about Euler's 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) {
if (n % i == 0) {
while (n % i == 0) n /= i;
result -= result / i;
}
@@ -13,6 +18,7 @@ public class EulersFunction {
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));