Published by Alain Cardinaux on 2021-11-06
What is calcMod-Blk?
CalcMod-Blk is a mathematical app designed for both mathematics teachers and students who are interested in the beauty of numbers. The app offers a range of features including calculating the factorial of an integer, determining the gogol number, finding prime integers of the form 10^n+1, checking if a big integer is prime, determining the divisors of an integer, and performing modulo calculations. The app is limited only by the display and can handle calculations up to 100 digits.
1. Want to know if a big integer is prime ? The change mod function indicates when the number is prime.
2. Want to know the divisors of an integer ? A prime divisor has no inverse modulo this integer.
3. The "change modulo" (change modulo) function indicates when the modulo is prime.
4. The "INV" function calculates the inverse of an integer modulo N.
5. The "n!" button calculates the factorial of an integer from 0 to 2000.
6. The "Mod" operation indicates the residue modulo N.
7. There are no limit to the modulo except the display.
8. This app is intended for both mathematics teachers and/or their students, or if you are interested in the beauty of numbers.
9. You can stoke one number and recall it when you want.
10. Factorial are limited to factorial of 2000.
11. Les commentaires sont disponibles en français (réglages).
12. Liked calcMod-Blk? here are 5 Education apps like calcMod-Light; Canvas Student; ClassDojo; Google Classroom; Duolingo - Language Lessons;
Or follow the guide below to use on PC:
Select Windows version:
Install calcMod-Blk app on your Windows in 4 steps below:
Download a Compatible APK for PC
Download | Developer | Rating | Current version |
---|---|---|---|
Get APK for PC → | Alain Cardinaux | 1 | 2.0 |
Get calcMod-Blk on Apple macOS
Download | Developer | Reviews | Rating |
---|---|---|---|
Get $0.99 on Mac | Alain Cardinaux | 0 | 1 |
Download on Android: Download Android
- Calculates the factorial of an integer from 0 to 2000
- Determines the gogol number
- Finds prime integers of the form 10^n+1
- Checks if a big integer is prime using the change mod function
- Determines the divisors of an integer using the prime divisor function
- Performs modulo calculations with no limit except the display
- Allows stoking and recalling of numbers
- Calculates the residue modulo N using the Mod operation
- Performs modular exponentiation using the pow function
- Calculates the inverse of an integer modulo N using the INV function
- Available in French (settings)