The problem of primalily proving is one of the most important in number theory and cryptography. In this
article three probabilistic primality tests are given. For each presented test the term "liar" is defined and the
power of probabilistic tests is presented according to amount of liars for testing number in each test.