Question

Find the number of integers (which may be BigIntegers!) in the BigIntPrimes.txt file that are prime. Report that count as your answer to this quiz.

Again, write your own "isPrime" function that accepts a BigInteger as the parameter. The only BigInteger operations permitted are compareTo, add, mod, and sqrt. You may not use the BigInteger isProbablePrime() method.

this is what we have on the file:

81255
60000
40788
540
87507
50890
11556
54614
63146
4538
5419
39965
65894
57760
33168
55232
22928
16397
67014
96812
57520
82701
92419
30692
8518
83922
87250
26590
13588
49749
23484
60513
87201
52640
74415
31209
43388
61431
88597
8633
47366
17039
78165
60080
69557
64868
62014
67142
16661

Advance java

"Please I need the hold program which is find all the BigInteger on a file and output the number of  BigInteger within that file."

Answer 1

Program screenshots:

Sample output:

Code to copy:

// Import the required packages.

import java.math.BigInteger;

import java.io.*;

// Define the Main class.

class Main

{

    // Define the method to check if the number

    // is prime or not.

    public static boolean isPrime(BigInteger bi)

    {

        // Compute the square root of the number.

        BigInteger root = bi.sqrt();

        // Declare the required variables/objects.

        int i = 2;

        BigInteger divisor = BigInteger.valueOf(i);

        // Start the loop while the value of the divisor

        // is less than or equal to the root.

        while (divisor.compareTo(root) <= 0)

        {

            // Return false if the value of bi mod divisor

            // is equal to 0.

            if (bi.mod(divisor).compareTo(BigInteger.ZERO) == 0)

            {

                return false;

            }

            // Otherwise, increment the value of i and

            // update the value of the divisor with the

            // incremented value of the variable i.

            i = i + 1;

            divisor = BigInteger.valueOf(i);

        }

        // Return true if there are no factors of the

        // given number.

        return true;

    }

    // Define the main() method.

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

    {

        // Create an object of the File class.

        File infile = new File("BigIntPrimes.txt");

        // Open the file in read mode.

        BufferedReader br = new BufferedReader(new FileReader(infile));

        // Declare the required variables.

        String line;

        int count = 0;

        // Start the loop to read the content

        // of the file.

        while ((line = br.readLine()) != null)

        {

            // Create an object of the BigInteger class

            // of the current value.

            BigInteger value = new BigInteger(line);

            // Increment the value of count if the

            // method isPrime() returns true for

            // the current value.

            if (isPrime(value) == true)

            {

                count++;

            }

        }

        // Close the input file.

        br.close();

        // Display the number of primes that are found in the file.

        System.out.println("The number of integers in the BigIntPrimes.txt file that are prime = " + count);

    }

}

Sample input file ("BigIntPrimes.txt"):

81255

60000

40788

540

87507

50890

11556

54614

63146

4538

5419

39965

65894

57760

33168

55232

22928

16397

67014

96812

57520

82701

92419

30692

8518

83922

87250

26590

13588

49749

23484

60513

87201

52640

74415

31209

43388

61431

88597

8633

47366

17039

78165

60080

69557

64868

62014

67142

16661