- Is it possible to prove or disprove that when given an even number, say N, that the first prime which describes a Goldbach pair that totals "N" may be p1 <= INT(2*SQRT(N))?

Bill

---------------------------------

Do you Yahoo!?

The New Yahoo! Shopping - with improved product search

[Non-text portions of this message have been removed] - --- William Bouris wrote:
> Is it possible to prove or disprove that when given an

Disprove:

> even number, say N, that the first prime which describes

> a Goldbach pair that totals "N" may be p1 <= INT(2*SQRT(N))?

N=992. P1=73. P1 > INT(2*SQRT(N)).