Here you can find the source of ceilPrime(long p)
static long ceilPrime(long p)
//package com.java2s; /*//from ww w . j a v a2 s .com * Copyright 2014 OpenRQ Team * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ public class Main { static long ceilPrime(long p) { if (p == 1) p++; while (!isPrime(p)) p++; return p; } static boolean isPrime(long n) { // check if n is a multiple of 2 if (n % 2 == 0) return false; // if not, then just check the odds for (long i = 3; i * i <= n; i += 2) if (n % i == 0) return false; return true; } }