Question

please answer this question fast please fast and those who will give the correct answer i will mark as brainliest and I will follow him/ her and thank many of their answers. ​

Answer 1

$\huge\mathbb\pink{\underline {\underline{Answer}}}$

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++;

}

}

}

$\huge\mathtt\purple{THANK\:YOU}$

Answer 2

Answer:

ANSWER

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++;

}

}

}

JAVASCRIPT