Browse

algorithms

requests

all requests

users

all users

Learn

language

website

Create

ready to experiment?

use algorithmatic.com's in-browser integrated-development-environment here. The IDE offers syntax-highlighting, realtime validation, syntax-autocompletion, autocompletion for external-calls, interpreter and basic debugging.

Account

signin

algorithmatic.com uses OpenID - that means you don't need to register, probably you already have an OpenID, you just need to enable it.
Click here to sign in

Euler's Totient Function

execute this algorithm

.. or ..

view and edit the code

Output

type in the input above and click 'Execute'
the result will be outputted here

Related Algorithms

+1

Extended Euclidean by ANaimi 6 months and 5 days ago
+2

Prime Factorization by ANaimi 6 months and 5 days ago
+1

Modular Exponentiation by ANaimi 3 months and 2 weeks ago

Discussion

Nice implementation, enjoy that you continue to push the reuse of code here. Also, is this on its own or a lead up to the Project Euler Problem? (remember doing that a few years back) -- just seems a rather novel algorithm to handle, fun though.

6 months ago by bh3

Thanks bh3!
This one is on its own.
I will need this to implement RSA.

5 months and 4 weeks ago by ANaimi

Version 1

The totient of a positive integer n is defined to be the number of positive integers less than or equal to n that are coprime to n.

This implementation depends on PrimeFactorization algorithm.

See http://en.wikipedia.org/wiki/Euler%27s_totient_function

By ANaimi

6 months ago

implementations

one version available

rated by

one user - list?

viewed by

5 users - list?

favorited by

0 users - list?

last activity

5 months and 4 weeks ago