Recent content by miccol999

ok then, that proves that I am completely lost! how would you prove this theorem?

Hi I am currently studying Information Theory. Could I please have anyone's ideas on the following question: Using the Euclidean algorithm, show that coprime numbers always have multiplicative inverses modulo each other. I tried the following proof, using Fermat's little theorem, let me...

that didn't work...how do you get arg(z) in fortran?

I've also tried the following... A=T/(T-2*DELTA) ARGA=ATAN(REAL(AIMAG(A))/REAL(REAL(A))) B=EXP(-CI*NU*LOG(ABS(A))+NU*ARGA) ...since arg(x+iy)=tan^(-1)(y/x). I think I'm not using the right function to find the real and imaginary parts of A, can anyone help at all?

Hi I need help with programming the following: (T/(T-2*d))^(i*Nu)=exp(-i*Nu*ln|T/(T-2*d)| +Nu*arg(T/(T-2*d)) I don't know how to do the arg bit in Fortran90...this is what I've tried so far A=T/(T-2*DELTA) B=EXP(-CI*NU*LOG(ABS(A))+NU*ARG(A)) but obviously it threw back an error...

Given tanA=y/x.....(1) Can anyone tell me how you get the following relations: =>sinA=ay/sqrt(x^2+y^2).....(2) =>cosA=ax/sqrt(x^2+y^2)....(3) where a=(+/-)1 I know tanA=sinA/cosA and sin^2(A)+cos^2(A)=1...and I can see by substituting (2) and (3) into (1) it works, but I really...