We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 4746d0c commit 6d91a1eCopy full SHA for 6d91a1e
Maths/EulersTotientFunction.js
@@ -19,7 +19,7 @@ const gcdOfTwoNumbers = (x, y) => {
19
20
const eulersTotientFunction = (n) => {
21
let countOfRelativelyPrimeNumbers = 1
22
- for (let iterator = 2; iterator <= n; iterator++){
+ for ( let iterator = 2; iterator <= n; iterator++ ){
23
if (gcdOfTwoNumbers(iterator, n) === 1)countOfRelativelyPrimeNumbers++
24
}
25
return countOfRelativelyPrimeNumbers
0 commit comments