Return to Question

The task here is to write a program that takes two inputs a positive integer n and a positive integer a. It will then decide if a is n-prime. Your program should output two distinct values one for "yes, it is n-prime" and one for "no, it is not n-prime".

The task here is to write a program that takes two inputs, a positive integer n and a positive integer a. It will then decide if a is n-prime. Your program should output two distinct values one for "yes, it is n-prime" and one for "no, it is not n-prime".

Here are lists of the first 30 primes for n=2 to n=12 (1 is the only 1-prime number)

Here are lists of the first 31 primes for n=2 to n=12 (1 is the only 1-prime number)

• n is the smallest n-prime.

• Numbers larger than n are n-prime if they are not divisible by a smaller prime.

• n is the smallest n-prime.

• Numbers larger than n are n-prime if they are not divisible by a smaller n-prime.