Thread: prime numbers

Yeah so far I only have entering the random number part.

import java.util.Scanner;
public class prog335t
{
public static void main(String[]args)
{
 
Scanner input=new Scanner(System.in);
int n;
System.out.print("Enter an integer greater than or equal to 2: ");
 
n= input.nextInt();

For future reference, please surround your code with either the [highlight=java][/highlight] or Y[code][/code] tags (makes it much more readable). I've edited your post above.

First thing is first, you mentioned in your post above you understand the basics of finding prime numbers....do you have any code which finds prime numbers, or validates a number for being prime? Validating is important, for example a very simple brute-force algorithm to solve the original problem would be to continually increment/decrement the entered value - validating each resulting number until a number validates as being prime.