Try Notedeck free · More Cryptography demos
← Notedeck 密码学 · Euler's totient φ(n) Try in Notedeck

Euler's totient φ(n) — interactive Cryptography demo

Count the integers in 1..n that are coprime to n via the prime-factor product formula

Run this interactive Cryptography demo live below, or download it as a single self-contained HTML file that works offline in any browser or LMS — one of 1,900+ free interactive teaching demos on Notedeck. With Notedeck you upload your own materials and turn them into interactive courseware, question papers with answer keys, and AI-taught lessons.