date single oğlsund
suM1,
i.e keep adding the digits of sum1 until you arrive at a single digit
.
Return that single digit as output.
Note:
1. Array size ranges from 1 to 10.
2.All the array elements are positive numbers
3. Atleast one uncommon number will be present in the anays.
Example-1
input1: {123, 45, 7890, 67, 2, 90 }
input2:45, 7890, 123
output:
67 + 2 + 90 = 159
1 + 5 + 9 => 15
6
Answers
import java.util.Scanner;
public class FiftyPrimes
{
// Return true if a number n is prime
public static boolean isPrime(long n)
{
// Check division from 2 to sqrt(n)
for (long i = 2; i <= Math.sqrt(n); i++)
{
if (n % i == 0)
{
return false;
}
}
// If no division is found, number is prime
return true;
}
public static void main(String[] args)
{
// Create Scanner object
Scanner sc = new Scanner(System.in);
// Take user input
System.out.print("Enter the starting point: ");
long start = sc.nextInt();
// Close Scanner object
sc.close();
// If start point is less than 2, make it 2
if (start < 2)
{
start = 2;
}
int numberOfPrimes = 0; // Number of primes printed
long number = start; // Number to be tested for prime
// Iterate until 50 primes are printed
while (numberOfPrimes < 50)
{
if (isPrime(number))
{
System.out.println(number);
numberOfPrimes++;
}
number++;
}
}
}