- SCMtheory 书籍
- factRI Algorithm on calculating factorial by iterative or recursive way
- Poincare 非线形混沌系统的庞加莱图的画法的代码以及其MATLAB m文件代码
- NS-2-study-in7-days NS2学习资料
- MSP430FR5739_01 在msp430fr5739开发板上闪亮led灯
- const_mem_fun_ref_t This file is dual licensed under the MIT and the University of Illinois Open Kernel Device Driver for linux v2.13.6.
文件名称:4.4
-
所属分类：
- 标签属性：
- 上传时间：2012-11-16
-
文件大小：687byte
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
(4) 简化的歌德巴赫猜想：任何一个大于6的偶数均可以表示为两个素数之和。现从键盘输入一个0～65535之间的无符号整数，试验证歌德巴赫猜想。
如输入数12，输出：
12=5+7
如输入数20,输出：
20=3+17
20=7+13
如输入数7,输出：
Must be even
如输入数3,输出：
Must be greater than or equal to 6-to simplify the GeDeBaHe guess: any more than a 6 even can be expressed as the sum of two prime Numbers. Now from the keyboard a 0 to 65535 between unsigned integer, test certificate GeDeBaHe guess.
If the input number 12, output:
12 = 5+ 7
If the input number 20, output:
20 = 3+ 17
20 = 7+ 13
If the input number 7, output:
Must be even
If the input number 3, output:
Must be greater than or equal to six
如输入数12，输出：
12=5+7
如输入数20,输出：
20=3+17
20=7+13
如输入数7,输出：
Must be even
如输入数3,输出：
Must be greater than or equal to 6-to simplify the GeDeBaHe guess: any more than a 6 even can be expressed as the sum of two prime Numbers. Now from the keyboard a 0 to 65535 between unsigned integer, test certificate GeDeBaHe guess.
If the input number 12, output:
12 = 5+ 7
If the input number 20, output:
20 = 3+ 17
20 = 7+ 13
If the input number 7, output:
Must be even
If the input number 3, output:
Must be greater than or equal to six
(系统自动生成,下载前可以参看下载内容)
下载文件列表
4.4.asm
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。