Skip to content

1.19 Prime Factorial

Farrukh Ahmad edited this page Jan 4, 2016 · 1 revision

A given number n is a factorial prime if it is equal to factorial(n) + 1 for some n and it is prime.

7 prime and is equal to factorial(3) + 1 hence its prime factorial

public class PrimeFactorial {
public static void main(String[] args) {
	int n=7;
	
	System.out.println(primeFactorial(n));
}

static boolean primeFactorial(int n){
	if(!isPrime(n)) return false;
	for(int i=1; i<=n; i++){
		if(factorial(i)+1 == n)
			return true;
	}
	return false;
}

static boolean isPrime(int n){
	if(n==0 || n==1) return false;
	if(n==2) return true;
	for(int i=2; i<n; i++)
	{
		if( n%i == 0 ) return false;
	}
	return true;
}

static int factorial(int n){
	if (n==0) return 1;
	
	return n*factorial(n-1);
}
}

Clone this wiki locally