4. Numeral systems. Prime and perfect numbers
** Numeral
systems [1.1.6]
- Positional and non positional systems
- Arabic and Roman numerals
** Binary
numeral system [1.1.6]
- Representation of numbers in a binary number system
- Convert from decimal to binary and vice versa
- Binary addition and subtraction
- Hexadecimal number system
- p-th number system, Horner's
method
** Prime numbers
[1.1.3]
- Definitions
- Cryptography (integer factorization algorithms)
- Checking the primality of a given number n:
- An algorithm for checking if n is divisible by all integers
from 2 to sqrt (n)
- An algorithm for checking if n is divisible by all prime
numbers from 2 to sqtr (n)
- Sieve
of Eratosthenes
- Decomposition of prime divisors (prime factorization)
** Mersenne
primes and Perfect
numbers [1.1.4]
- Definitions
- Finding perfect numbers