Recursive program for prime number

Given a number n, check whether it's prime number or not using recursion.
Examples: 
 

Input : n = 11
Output : Yes

Input : n = 15
Output : No

The idea is based on school method to check for prime numbers.
 

No