Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public boolean isPrime(int n){
- if(n%2 == 0 && n!= 2){
- return false;
- }
- for(int i = 2; i < n/2; i++){
- if(n%i == 0){
- return false;
- }
- }
- return true;
- }
- public int getPrevPrimeNumber(int number){
- for(int i = number-1; i>2; i--){
- if(isPrime(i)){
- return i;
- }
- }
- return -1;
- }
- public int getNextPrimeNumber(int number){
- int i = number+1;
- while (true){
- if(isPrime(i)){
- return i;
- }
- i++;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement