Month: May 2014

Euler function (Phi) Problem How to Solve: if n is prime then number of relative prime from 1 upto n is n-1. This is represented as phi function. if n and m relatively prime then phi(mn)=phi(n)*phi(m). (proof given bellow as matrix representation of the 1 from mn) The problem was solved by taking the number

Continue Reading “10179” →