Two new blog posts by Brent Yorgey concern the Euler totient function: mathlesstraveled.com/2019/05/0 and mathlesstraveled.com/2019/05/1

Computing it quickly would break RSA; Brent describes using factoring to do better than brute force. The problem is clearly in . I recently visited UCLA where Igor Pak asked me for natural candidates of -intermediate problems. I think this is one, and Igor thinks the prime-counting function is another, but neither is very combinatorial. Anyone have better candidates?

Sign in to participate in the conversation
Mathstodon

A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.

Use \( and \) for inline LaTeX, and \[ and \] for display mode.