Rank: 4971 based on 2 downloads (last 30 days) and 1 file submitted
photo

Michael Neve

E-mail

Personal Profile:
Professional Interests:

 

Watch this Author's files

 

Files Posted by Michael
Updated   File Tags Downloads
(last 30 days)
Comments Rating
16 Oct 2001 big x^y modulo function provide the solution when the normal mod function can't because the input is to big Author: Michael Neve modulo, exponentiation, cryptology, solution 2 4
  • 5.0
5.0 | 2 ratings
Comments and Ratings on Michael's Files View all
Updated File Comment by Comments Rating
11 Nov 2007 big x^y modulo function provide the solution when the normal mod function can't because the input is to big Author: Michael Neve Stepanek, Pavel

Sorry, mod(8^51,103) should produce 1.

11 Nov 2007 big x^y modulo function provide the solution when the normal mod function can't because the input is to big Author: Michael Neve Stepanek, Pavel

thank you, that is the what I need. I am very surprised, that standard mod function in Matlab does not work well for me, even if input is relatively small, e.g. mod(8^51,103) produce
 1.267650600228229e+030 instead of 58. Has anybody idea, why it is so?

08 May 2005 big x^y modulo function provide the solution when the normal mod function can't because the input is to big Author: Michael Neve n/a, bennyboss

many thanks! I must say the same, exactly what I need.

03 Jun 2004 big x^y modulo function provide the solution when the normal mod function can't because the input is to big Author: Michael Neve UNAL, Muhammet

thank you! exactly what I need

Top Tags Applied by Michael
cryptology, exponentiation, modulo, solution
Files Tagged by Michael
Updated   File Tags Downloads
(last 30 days)
Comments Rating
16 Oct 2001 big x^y modulo function provide the solution when the normal mod function can't because the input is to big Author: Michael Neve modulo, exponentiation, cryptology, solution 2 4
  • 5.0
5.0 | 2 ratings

Contact us at files@mathworks.com