Tagged Questions

9
votes
1answer
74 views

Examples of Diophantine equations with a large finite number of solutions

I wonder, if there are examples of Diophantine equations (or systems of such equations) with integer coefficients fitting on a few lines that have been proven to have a finite, but really huge number ...
4
votes
3answers
161 views

Comparing $\large 3^{3^{3^3}}$, googol, googolplex

How to show that $\large 3^{3^{3^3}}$ (Third Ackermann number) is larger than a googol ($\large 10^{100}$) but smaller than googoplex ($\large 10^{10^{100}}$). Thanks much in advance!!!
2
votes
1answer
310 views

How to calculate modulo of large integer (number having 25000 digits)

I'm looking for solution to a problem to calculate modulo of very large number that can contain 25000 digits or less (n) with 10 digit number (m). ( n % m ) ? Pointer to appropriate theory resource ...
4
votes
1answer
85 views

Are there any secure ciphers you can use without a computer?

I have some kids that like encryption schemes such as the Caesar cipher and the Vigenère cipher. I would like to teach them something that's not easily breakable by todays maths and computers, but I ...
4
votes
2answers
203 views

RSA: Creating a key of desired length

Thanks and with respect to the users of this site, I've succeeded in creating an Encryption/Decryption procedure for the RSA algorithm. I also implemented a Miller-Rabin probabilistic primality test. ...
40
votes
7answers
2k views

Is it possible to represent every huge number in abbreviated form?

Consider the following expression. 16313107343153908912074032799466965289077771751767944648966669091376847859711382649033004075188224 This is a 98 decimal digit number. This can be represented as ...