How to find large modulus on Casio fx-991 MS

  • Thread starter Thread starter anes
  • Start date Start date
  • Tags Tags
    Casio Modulus
Click For Summary
SUMMARY

This discussion focuses on calculating large modulus values using the Casio fx-991 MS calculator. Users demonstrate methods for finding modulus with large numbers, specifically using examples like 5^36 mod 97 and 28^12 mod 97. The key takeaway is the technique of breaking down large exponentiations into smaller, manageable calculations using properties of modulus. The final results for the examples provided are confirmed as 50 for 5^36 mod 97 and 4 for 7^12 mod 71.

PREREQUISITES
  • Understanding of modulus operations
  • Familiarity with exponentiation
  • Basic calculator functions
  • Knowledge of properties of modular arithmetic
NEXT STEPS
  • Learn advanced modular exponentiation techniques
  • Research the Chinese Remainder Theorem for solving congruences
  • Explore the use of Python's pow() function for modular arithmetic
  • Study Fermat's Little Theorem for efficient calculations
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in efficient calculations of large modulus values using calculators or programming.

anes
Messages
22
Reaction score
0
Hi pals,
I am looking to find a modulus calculation using my casio fx-991 ms calculator

i know how to find modulus using small numbers

eg: 7 mod 3 = 1. This because 7 = 3(2) + 1, in which 1 is the remainder. To do this process on a simple calculator do the following: Take the dividend (7) and divide by the divisor (3), note the answer and discard all the decimals -> example 7/3 = 2.3333333, only worry about the 2. Now multiply this number by the divisor (3) and subtract the resulting number from the original dividend. so 2*3 = 6, and 7 - 6 = 1, thus 1 is 7mod3


but i need to find
5^36 mod 97

it's answer is 50

but when i do i don't get the full number in calculator it show 1.4500000x 10^34

but i don't know how to calculate mod use this type of result .

please advise me

Thanks
Anes
 
Mathematics news on Phys.org
You'll have to do some calculations yourself, I think.

5^36 = (5^3)^12 = 125^12
125^12 mod 97 = (125 mod 97)^12 mod 97 (using computer notation, not mathematical notation).
125 mod 97 is easy to evaluate.
You can repeat those steps until the number is small enough for the calculator.
 
Dear Mentor ,
I don't get your point fully . please solve (28)^12 mod 97 in next step.

Thanks
Anes
 
(28)^12 = (28^2)^6 for example. You can just repeat that step.
 
Thanks dear mentor i got the ultimate answer now

(28^2 mod 97)^6 mod 97 = (8)^6 mod 97 = 262,144 mod 97

which can find by

262,144/97 = 2702.515 take this 2702 as X

262,144 - 97*2702( we call it as X) = 50 (Ans)

Thanks a lot i believe my answer is good for those who look in futureAnes
 
For make this problem easeful , i gave 1 more example

5^58 mod 97

(5^2 mod 97)^29 mod 97

(25 mod 97)^29 mod 97
(25)^29 mod 97
25. (25)^8 mod 97 // because 29 cannot be factorized further
25.(25^4 mod 97)^7 mod 97

25.(6)^7 mod 97

25.91 mod 97

= 44(Ans)

Hope all understand

Thanks a lot
 
How can I get the solutions for solving (7^12) mod 71 ?? Correct answer is: 4, But I m getting a wrong answer...Anybody help me.
 
Please open a new thread for new questions, this thread is from 2014. Anyway, the existing posts should help.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 12 ·
Replies
12
Views
3K
Replies
1
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 55 ·
2
Replies
55
Views
6K
  • · Replies 14 ·
Replies
14
Views
2K