欧拉猜想

Eulerianconjecture

任何可以用８ｎ＋３表示的正整数是一个奇数的平方与一个素数的两倍之和，这个被欧拉提出的猜想至今没有得到证明。本文用Ｐａｓｃａｌ语言编写程序，在计算机上验证这个猜想。

Any positive integer that can be expressed with 8n+3 is the sum of the square of an odd number and the double of a prime. Up to now, the conjecture raised by Euler hasn' t be proved. This paper gave a checking to the conjecture with Pascal Program on computer.