I originally created this as a short to-do list of study topics for becoming a software engineer, but it grew to the large list you see today. After going through this study plan, I got hired as a ...
less than n, which are co-prime to n, i.e. ETF(n) = frequency of x where gcd(x,n) = 1 and 1<=x<=n. Brute force approach : Iterate over all elements < n and check if it's co-prime to n.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results