Arithmetic


Module

1

GCD (Greatest Common Divisor)

Problems:   


Module

2

Prime numbers and factorization of a number into prime factors

Problems:   


Module

3

Extended Euclid's Algorithm

Problems:   


Module

4

The Euler function and other problems in number theory

Problems:   


Module

5

Fast exponentiation

Problems:   


Module

6

number theory

Problems:   


Module

7

Number systems

Problems:   


Module

8

Binary shifts (C++)

Problems:   


Module

9

Workshop on RSA

Problems: