Added test for the PrimeCheck algorithm

[anhpham197]

I saw that there was no testing for PrimeCheck algorithm, so I decided to write some test for the function isPrime (int n) based on All-DU-Paths standard.

dir: src/test/java/com.thealgorithms/maths/PrimeCheckTest

`package com.thealgorithms.maths;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;

public class PrimeCheckTest {

@Test
void test1() {
    Assertions.assertTrue(PrimeCheck.isPrime(2));
}

@Test
void test2() {
    Assertions.assertFalse(PrimeCheck.isPrime(-1));
}

@Test
void test3() {
    Assertions.assertFalse(PrimeCheck.isPrime(4));
}

@Test
void test4() {
    Assertions.assertTrue(PrimeCheck.isPrime(5));
}

@Test
void test5() {
    Assertions.assertFalse(PrimeCheck.isPrime(15));
}

@Test
void test6() {
    Assertions.assertTrue(PrimeCheck.isPrime(11));
}

@Test
void test7() {
    Assertions.assertFalse(PrimeCheck.isPrime(49));
}

}
`

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!