| 引用本文： |
-
罗海鹏,黎贞崇,唐贵松.欧拉猜想[J].广西科学院学报,1995,(2):7-9. [点击复制]
- Luo Haipeng,Li Zhenchong,Tang Guisong.Eulerianconjecture[J].Journal of Guangxi Academy of Sciences,1995,(2):7-9. [点击复制]
|
|
| 摘要: |
| 任何可以用8n+3表示的正整数是一个奇数的平方与一个素数的两倍之和,这个被欧拉提出的猜想至今没有得到证明。本文用Pascal语言编写程序,在计算机上验证这个猜想。 |
| 关键词: 欧拉猜想 Pascal程序设计 |
| DOI： |
| 投稿时间：1995-03-20 |
| 基金项目: |
|
| Eulerianconjecture |
|
Luo Haipeng1, Li Zhenchong1, Tang Guisong2
|
| (1.Guangxi Academy of Sciences, Nanning, 530003;2.Computing center of Guangxi, Nanning, 530022) |
| Abstract: |
| 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. |
| Key words: Eulerianconjecture Pascal program design |
