text1: When using a probabilistic algorithm, how is the probability that the number is composite expressed mathematically?
text2: If we repeat the test n times and pass every time, then the probability that our number is composite is 1/(1-p)n, which decreases exponentially with the number of tests, so we can be as sure as we like (though never perfectly sure) that the number is prime.