tomaslibal

# Eulers Totient Function
#
# Description at http://mathworld.wolfram.com/TotientFunction.html
# Algorithm based on http://en.wikipedia.org/wiki/Euler%27s_totient_function
# Interesting property: for a prime number p, epf(p) = p - 1
 
# greatest common divisor of two integers
# @param m int the first number
# @param n int the second number
# @return int the greates common divisor of the two numbers