This chapter illustrates the use of genetic algorithms by solving a number of difficult algorithmic problems. Most of the problems presented in this chapter involve some arithmetic operations and therefore have a mathematical flavor.
9.1 Fundamental Theorem of Arithmetic
A prime number is a whole number greater than 1 whose only factors are 1 and itself. For example, 7 is a prime because it can only be divided by 7 and 1. The number 10 is not a prime because it can be divided by 2 and 5—two prime numbers.
In number theory, there is a theorem called the fundamental theorem ...
