Abstract: Convergence of genetic algorithms with selection and mutation operators alone is analysed in the paper. The evolutionary formula of the probability density of the population in continuous space is given in a simple and direct way. A sufficient condition on which the evolutionary process converges to the global optimum in discrete space is presented.