 In the latter case, by testing \(a_1 ,\ldots ,a_N\), we can find \(n \le N\) such that \(a_n = 1\). Thus the computational interpretation of (*) enables us to decide whether there exists \(n\) such that \(a_n = 1\); in other words, it enables us to decide the status of the Goldbach Conjecture. An example of this type, showing that a constructive proof of some classical result \(P\) would enable us to solve the Goldbach conjecture (and, by similar arguments, many other hitherto open problems, such as the Riemann hypothesis), is called a Brouwerian example for, or even a Brouwerian counterexample to, the statement \(P\) (though it is not a counterexample in the normal sense of that word).