Abstract:
Problems related to computer tests of number-theoretic hypotheses are discussed. New machine methods for finding twin primes, perfect and friendly numbers, Goldbach decomposition, and testing the Carmichael hypothesis are proposed.
Keywords:prime numbers, Euler's function, prime numbers are the twins, the algorithm, the perfect number, a friendly number.