Java 程序检查一个数是否可以表示为两个素数之和
javaobject oriented programmingprogramming更新于 2024/4/15 11:56:17
在本文中,我们将了解如何检查一个数是否可以表示为两个素数之和。素数是只有两个因数 1 和它本身的特殊数,不能被任何其他数整除。
如果一个数的唯一因数是 1 和它本身,那么它就是素数。11 是素数。它的因数是 1 和 11 本身。素数的一些例子是 2、3、5、7、11、13 等等。2 是唯一的偶素数。所有其他素数都是奇数。
下面是相同的练习 −
输入
假设我们的输入是 −
输入数字 : 43
输出
所需的输出是 −
这个数字可以表示为两个数之和素数。 可能的解决方案是: 43 = 2 + 41
算法
步骤 1 - 开始 步骤 2 - 声明两个整数值,即 my_input 和 i 步骤 3 - 从用户读取所需值/定义值 步骤 4 - 定义一个函数 IsPrime,该函数接受一个整数值并检查该值是否为素数。 步骤 5 - 使用 for 循环,从 2 迭代到 ‘my_input’ 值的一半,检查 ‘i’ 值和 ‘my_input’ – ‘i’ 值是否都是素数。如果是,则存储这两个值。 步骤 6 - 显示结果 步骤 7 - 停止
示例 1
import java.util.Scanner;
public class SumOfPrimes {
public static void main(String[] args) {
int my_input, i;
boolean my_temp = false;
my_input = 43;
System.out.println("Required packages have been imported");
Scanner my_scanner = new Scanner(System.in);
System.out.println("A reader object has been defined ");
System.out.print("Enter the number : ");
my_input = my_scanner.nextInt();
for (i = 2; i <= my_input / 2; ++i) {
if (IsPrime(i)) {
if (IsPrime(my_input - i)) {
System.out.println("The number can be expressed as sum of two prime numbers.");
System.out.println("The possible solutions are :");
System.out.printf("%d = %d + %d\n", my_input, i, my_input - i);
my_temp = true;
}
}
}
if (!my_temp)
System.out.println(my_input + " cannot be expressed as the sum of two prime numbers.");
}
static boolean IsPrime(int num) {
boolean my_prime = true;
for (int i = 2; i <= num / 2; ++i) {
if (num % i == 0) {
my_prime = false;
break;
}
}
return my_prime;
}
}
输出
Required packages have been imported A reader object has been defined Enter the number : 43 The number can be expressed as sum of two prime numbers. All the possible solutions are : 43 = 2 + 41
示例 2
这里,整数已经被预先定义,并且它的值被访问并显示在控制台上。
public class SumOfPrimes {
public static void main(String[] args) {
int my_input, i;
boolean my_temp = false;
my_input = 43;
System.out.println("The number is defined as " +my_input);
for (i = 2; i <= my_input / 2; ++i) {
if (IsPrime(i)) {
if (IsPrime(my_input - i)) {
System.out.println("The number can be expressed as sum of two prime numbers.");
System.out.println("The possible solutions are :");
System.out.printf("%d = %d + %d\n", my_input, i, my_input - i);
my_temp = true;
}
}
}
if (!my_temp)
System.out.println(my_input + " cannot be expressed as the sum of two prime numbers.");
}
static boolean IsPrime(int num) {
boolean my_prime = true;
for (int i = 2; i <= num / 2; ++i) {
if (num % i == 0) {
my_prime = false;
break;
}
}
return my_prime;
}
}
输出
The number is defined as 43 The number can be expressed as sum of two prime numbers. All the possible solutions are : 43 2 + 41
相关文章
有用资源
java 参考教程 - 该教程包含有关 java 的更多信息:https://www.cainiaomax.com/java/

