Question

Create a method based program to find if a number is prime and then print all the prime numbers from 1 through 500

Method Name: isPrime(int num) and returns a boolean

Use for loop to capture all the prime numbers (1 through 500)

Create a file to add the list of prime numbers

Working Files:

public class IsPrimeMethod
{
   public static void main(String[] args)
   {
      String input;        // To hold keyboard input
      String message;      // Message to display
      int number;          // Number to check for prime
    
      // Get the number.
    
    
    
    
      // Determine whether it is prime or not.
      if (isPrime(number))
        // print the message the number is prime
        //enter code here
      
      
      else
      // print the message the number is not a prime
      //enter code here
      
      
         
      // Display a message.
    
      JOptionPane.showMessageDialog(null, message);
                    
      System.exit(0);
   }

   /**
      The isPrime method determines whether a number is prime.
      @param num The number to check.
      @return true if the number is prime, false otherwise.
   */

   //create a method called isPrime() that takes and integer variable and returns a boolean
   public static boolean isPrime(int num)
   {
      boolean ___________________ = false;
      int ___________ = 2;
    
      while(_________ < num && !_______________)
      {
         if ((_______ % div) == 0)
            _______________ = true;
         ____________++;
      }
    
      return _________________;
   }
}

import java.util.Scanner;
import java.io.*;

/**
   This program demonstrates a solution to the
   Prime Number List programming challenge.
*/

public class PrimeNumberList
{
   public static void main(String[] args) throws IOException
   {
      int number;          // Number to check for prime
    
      // Open a file.
      PrintWriter outFile = ___________________("PrimeList.txt");
    
      // Write the prime number list.
      for (int i = 1; i <= 100; i++)
      {
         if (______________))
            outFile.println(________);
      }
    
      // Close the file.
      outFile.close();
   }

   /**
      The isPrime method determines whether a number is prime.
      @param num The number to check.
      @return true if the number is prime, false otherwise.
   */
   public static boolean isPrime(int num)
   {
     //Create the method created in problem 1
   }
}

Answer 1

/**********************IsPrimeMethod.java**************************/

import java.util.Scanner;

public class IsPrimeMethod

{

public static void main(String[] args)

{

String input; // To hold keyboard input

String message; // Message to display

int number; // Number to check for prime

  

// Get the number.

System.out.print("Enter the number to check for prime: ");

Scanner sc = new Scanner(System.in);

number = sc.nextInt();

  

  

// Determine whether it is prime or not.

if (isPrime(number))

// print the message the number is prime

//enter code here

System.out.print("The number is prime");

  

else

// print the message the number is not a prime

//enter code here

System.out.print("The number is not a prime");

// Display a message.

message = "Thank you.";

// JOptionPane.showMessageDialog(null, message);

  

System.exit(0);

}

/**

The isPrime method determines whether a number is prime.

@param num The number to check.

@return true if the number is prime, false otherwise.

*/

//create a method called isPrime() that takes and integer variable and returns a boolean

public static boolean isPrime(int num)

{

boolean notPrime = false;

int div= 2;

  

while(div< num && !notPrime)

{

if ((num % div) == 0)

notPrime = true;

div++;

}

  

return !notPrime;

}

}

OUTPUT:

terminated> IsPrimeMethod Java Application] C:Program FilesJ Enter the number to check for prime: 37 The number is prime

/**************************************************************************************************/

/*******PrimeNumberList.java************************/

import java.util.Scanner;

import java.io.*;

/**

This program demonstrates a solution to the

Prime Number List programming challenge.

*/

public class PrimeNumberList

{

public static void main(String[] args) throws IOException

{

int number; // Number to check for prime

  

// Open a file.

PrintWriter outFile = new PrintWriter("PrimeList.txt");

  

// Write the prime number list.

for (int i = 1; i <= 500; i++)

{

if (isPrime(i))

outFile.println(i);

}

  

// Close the file.

outFile.close();

}

/**

The isPrime method determines whether a number is prime.

@param num The number to check.

@return true if the number is prime, false otherwise.

*/

public static boolean isPrime(int num)

{

boolean notPrime = false;

int div= 2;

  

while(div< num && !notPrime)

{

if ((num % div) == 0)

notPrime = true;

div++;

}

  

return !notPrime;

}

}

/*********************OUTPUT FILE**************************/

PrimeList - Notepad File Edit Format View Help 2 7 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191

13791379391173917-337137-77939739397|99-1393 9999|22233455667788901113344556778890012333 1111222222222222222233333333333333334444444

39397|9911393971379719 778890012333 333334444444 56667899

/*If this helps you, please let me know by giving a positive thumbs up. In case you have any queries, do let me know. I will revert back to you. Thank you!!*/