Probabilistic Complexity of Numerically Checking the Binary Goldbach Conjecture in Certain Intervals. Modelling, Analysis and Simulation.

摘要

A heuristic analysis is presented of the complexity of an algorithm which was applied recently to verify the binary Goldbach conjecture for every integer in the interval (4, 10 to the 14th power), as well as for every integer in (10k, 10k + 10-9), for different values of k up to 300. The analysis agrees reasonably well with the experimental observations.