I’ve taken a few implementations apart and I’ve tried to figure out what the intention of Euler’s Phi function is. I think I’ve got it. I found an interesting implementation in Ruby here but it wasn’t satisfactory. Sure, the code was incredibly minimalistic, but it was also recursive and overflowed the stack for anything over 7704 iterations. I didn’t like the inflexibility of it. So I rewrote it in big ugly moron code that isn’t recursive, but is capable of scaling to some decently large totients. I might see if I can code something similar in Rust, just for shits and giggles.

By the way, the output makes for some damned interesting graphs.

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36  # encoding: UTF-8 usage = < is the number you want to begin at. (Duh.) is where you expect to stop. (Fucking retard.) ELSTRINGSTART def totient_phi_new(n) c = 0 n.downto(1) { |x| if x.gcd(n) == 1 c += 1 end } c end if ARGV.empty? puts usage exit end if ARGV.length > 2 or ARGV.length == 1 puts usage exit end x = ARGV[0].to_i y = ARGV[1].to_i x.upto(y) do |t| puts "#{t}, #{totient_phi_new(t)}" end

I’m such a fucking brocoder. Eugh.