Product of Natural Numbers §
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// caleb b
// product of natural numbers
Scanner scan = new Scanner(System.in);
int timesUsed = 0;
while (timesUsed < 3) {
System.out.println("Enter a number: ");
int n = scan.nextInt();
if (n < 0) {
System.out.println("Please enter a positive number.");
continue; }
print_1_to_N_product(n);
timesUsed++;
}
}
public static void print_1_to_N_product(int n) {
int product = 1;
for (int i = 1; i <= n; i++) {
product *= i;
}
System.out.println(product);
}
}
Calculator Function §
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// caleb b
// calculator function
Scanner scan = new Scanner(System.in);
int timesUsed = 0;
while(timesUsed < 4) {
try {
System.out.println("Enter an operation (a, s, m, d): ");
String operation = scan.next();
System.out.println("Enter a number: ");
int a = scan.nextInt();
System.out.println("Enter another number: ");
int b = scan.nextInt();
calculator(operation, a, b);
timesUsed++;
} catch (Exception e) {
System.out.println("Invalid input");
}
}
}
public static void calculator(String operation, int a, int b) {
System.out.println("--------------------");
System.out.println("Result:");
switch (operation) {
case "a":
System.out.println(sum(a, b));
break; case "s":
System.out.println(difference(a, b));
break; case "m":
System.out.println(product(a, b));
break; case "d":
System.out.println(quotient(a, b));
break; default:
System.out.println("Invalid operation");
}
System.out.println("--------------------");
}
public static int sum(int a, int b) {
return a + b;
}
public static int difference(int a, int b) {
return a - b;
}
public static int product(int a, int b) {
return a * b;
}
public static int quotient(int a, int b) {
return a / b;
}
}
Prime Number Checker §
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// caleb b
// prime number checker
int timesUsed = 0;
Scanner scan = new Scanner(System.in);
while (timesUsed < 2) {
System.out.println("Enter a number to check if it is prime: ");
int num = scan.nextInt();
boolean isPrime = is_prime_number(num);
if (isPrime) {
System.out.println(num + " is a prime number.");
} else {
System.out.println(num + " is not a prime number.");
}
timesUsed++;
}
}
public static boolean is_prime_number(int num) {
int i = 2;
while (i < num) {
if (num % i == 0) {
return false;
}
i++;
}
return true;
}
}
View Next Assignment