calcMod-RSA

This app is an improve iPad version of calcmod-ProX.
What are all the digits of the factorial of 100 and how many digits ?

What is the gogol number ?
Want to know if a big integer is prime ? The change mod function indicates when the number is prime.
Want to know the divisors of an integer ? A prime divisor has no inverse modulo this integer.
This is a modulo calculator overpowering almost limitless! (only display is limited !)
With modulo gogol, calculus are exact until 100 digits !

The "n!" button calculates the factorial of an integer from 0 to 800. Factorial are limited to factorial of 800, but the calculator could calculate them to over 1000 !

You can stoke one number and recall it when you want.
The "Mod" operation indicates the residue modulo N.
The "pow" function allow modular exponentiation (as + - *)
The "INV" function calculates the inverse of an integer modulo N.

The "change modulo" (change modulo) function indicates when the modulo is prime. There are no limit to the modulo except the display.
The "modulo gogol" button set a modulo to 10^100 (gogol number).
You can generate Rsa modulos of 128 bits, 256 bits and 512 bits (and see their factor p and q).
You can then makes every calculs for cipher and decipher messages (numbers) with RSA theorem.

All informations are displayed and you can follow Many Examples.

This app is intended for both mathematics teachers and/or their students, or if you are interested in the beauty of numbers and understand RSA theorem.
---
Les commentaires sont disponibles en français (sélection dans les réglages)