Coprime

Given a nonnegative integer n, tau(n) is the Ramanujan tau function of n, defined as the coefficient of x^n in the Taylor expansion ofx * prod_{k>=0}(1 - x^k)^24. This is an integer function with fascinating number theoretic properties. For instance, it's multiplicative, meaning tau(m*n) =... Platforms: Matlab

15th July, 2005 : Poly_POWER.m is now corrected !So, for most reasonable cases of Multiple Roots including Multiple Real Roots, Poly_POWER.m should now work. ********************Functional Description of Ch_Rem_Thr_Poly.m :Assume that we need to find a solution c_soln_Polysuch that it satisfies... Platforms: Matlab

Euler_Phi.zip is a suite of the foll Programmes :1) Euler_Phi (n) returns the no of positive integers less than n which are prime to n.2) a_k_mod_m_LCM_Method (a, m, k) : Imagine computing mod(14^26, 45) or mod(56^3005, 1125).This programme computes a_k_mod_m = mod (a^k, m) when a and m are... Platforms: Matlab