The Intrique of Prime Numbers | Detailed Explanation for Java Kids
Prime numbers are tricky to spot.
A number that looks like a prime may in fact be a multiple of a smaller prime number.
In this math programming tutorial for kids, we explore how Java can be used to verify prime numbers efficiently.
So let's see how to know for sure that a number is a prime.
Of-course there is only one way:
Understanding Prime Number Logic in Java
A prime number is one that can only be divided by itself and one (1).
Let's try to draft a Java algorithm that checks prime numbers, with the number 97 in consideration.
To know for sure whether it is a prime number, we will
recursively (repetitively) divide it by every number between
2 and 96 (97 minus 1).
If none of these divisors gives a remainder of zero, then 97
is certainly a prime number.
Create a new Java class file; File, New File.
Call it CheckPrime.
Type out the adjoining Java code for checking prime numbers.
Base Theory of Quick-Check for Primeness in Java
Since the world is always in a hurry, we can make use of a
little extra speed.
This Java code example shows how to check if a number is prime using a fast algorithm based on complementary factors.
Consider the number 36; Its factors are:
1, 2, 3, 4, 6, 9, 12, 18 and 36.
Every factor of 36, when arranged in ascending or descending
order, can be divided into 2 equal parts at the position of its square-root.
1, 2, 3, 4, |, 9, 12, 18, 36
It is easily seen that every factor of 36 on one side of the
divide has a complementary factor on the other side.
Hence, we can search for only a particular group of
factors, (preferably the more compact group, i.e, between
1 and √36) to see if 36 has any factors.
So! Java Fun Practice Exercise - Check Prime Number
As a fun practice exercise, feel free to try out your own numbers,
and see how the Java code checks the numbers to ascertain which ones are prime numbers.