Generate Euler's Totient Number Sequence
Create a list of Euler's φ numbers. Runs entirely in your browser, so your data never leaves your device.
Output
The result appears here as you type.
How to use Generate Euler's Totient Number Sequence
- 1. Set how many terms. Enter How many terms to decide how many values of Euler's totient function to compute, starting from phi(1).
- 2. Set a separator. Choose Separator, a comma or newline, to match how you want to read or paste the phi values, whether as a compact row or a stacked column.
- 3. Copy the results. The tool counts how many integers up to each n are coprime to n and prints that count as phi(n). Copy the sequence for a number theory or cryptography exercise.
When to use Generate Euler's Totient Number Sequence
Generate Euler's Totient Number Sequence lists phi(n) for a run of integers, the count of numbers up to n that share no common factor with n. It removes the coprime-counting work whenever this function shows up in a modular arithmetic or cryptography problem.
- Working through RSA key generation by hand. A student learning how RSA computes phi(p times q) from two primes wants a reference table of totient values to check intermediate steps of a worked example.
- Verifying a totient function implementation. A developer who coded phi(n) for a cryptography library tests the function output against the known sequence to make sure the coprime count is correct for small values.
- Studying Euler's theorem in number theory. Someone working through a proof that relies on Euler's theorem wants concrete phi(n) values to plug into the modular exponentiation formula and confirm the result matches expectations.
- Building a table for a discrete math course. An instructor preparing lecture notes on multiplicative functions wants the first ten or twenty totient values printed alongside their prime factorizations for a comparison table.
Examples
φ(1) through φ(10)
Output
1, 1, 2, 2, 4, 2, 6, 4, 6, 4
About the Generate Euler's Totient Number Sequence tool
Generate Euler's Totient Number Sequence is a free online tool that works entirely inside your web browser. Create a list of Euler's φ numbers. Because the processing happens on your own device, nothing you enter is uploaded, logged or stored anywhere.
This page is one of 234 Math utilities on EditSafely. Each one does a single job well, and all of them follow the same rule: your input stays on your machine.
You can shape the output with 2 settings, including How many terms and Separator, and the result refreshes the moment you change one. A worked example further down the page shows exactly what the tool produces for a real input.
Because nothing leaves your device, the tool is suitable for sensitive content such as internal documents, credentials or customer data. It also responds instantly, since every keystroke is handled on your own machine rather than by a remote API.
Frequently asked questions
Is Generate Euler's Totient Number Sequence free to use?
Yes, it is completely free. All 2,658 tools on EditSafely work without an account, a subscription or usage limits.
Does the generator send anything to a server?
Everything happens locally. Your browser downloads the tool's code once, then does all the processing itself; nothing you enter is transmitted, stored or logged. You can even go offline after the page loads and it will still work.
How do I get a different result?
Run the generator again. Each run is computed fresh on your device, and any options you change are applied to the next result immediately.
Do I need to sign up or install anything?
No. The tool works in any modern browser on desktop, tablet or phone. There is no account to create, no extension to add and no software to install.
How do I use the result?
The output panel has a one-click copy button, and you can keep refining the input while you work; the result updates in place as you type.