Problem 46

问题描述:

It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.

9 = 7 + 2×12
15 = 7 + 2×22
21 = 3 + 2×32
25 = 7 + 2×32
27 = 19 + 2×22
33 = 31 + 2×12

It turns out that the conjecture was false.

What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?

 

解决问题: 

		int i =33;
		boolean ok = true;
		for(;ok;){
			i=i+2;
			int j;
			if(IsPrime(i)){
			for( j=1; 2*j*j<i; j++){
				if(IsPrime(i-2*j*j)){
					break;
				}
			}
			if(2*j*j>=i){
				System.out.println("j:"+j+".i:"+i);
				ok = false;
			}
			}
		}
		 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值