Posts Tagged ‘number theory’
Prime numbers
You might remember that for any integer greater than 1, is a prime number if its factors are 1 and itself. The integers 2, 3, 5, and 7 are primes, but 9 is not prime because . The command primep() is useful for testing whether or not an integer is prime:
(%i1) primep(2);
(%o1) [...]
Filed under: mathematics, programming | 6 Comments
Tags: computer algebra system, mathematics, maxima, number theory, open source software, programming, symbolic computation
In studying cryptography, there are occasions in which we need to convert a string of plaintext characters into an integer. The integer corresponding to the plaintext string can then be encrypted using various encryption schemes that operate on numbers. A case in point is the RSA public key cryptosystem. Encryption and decryption [...]
Filed under: cryptography, mathematics, programming | 3 Comments
Tags: education, number theory, PARI/GP, programming
