Below program illustrates how to print prime numbers using recursion in Java:

public class PrimeNumbersUsingRecursion {
 
	public static void main(String[] args) {
		printPrimeNumbers(100, 2);
	}
	
	private static void printPrimeNumbers(int max, int num) {
			if(num <= max) {
				if(checkIfPrime(num)){
					System.out.println(num);
				}
				printPrimeNumbers(max, num+1);
			}
	}
	private static boolean checkIfPrime(int n) {
		for(int i=2; i<n; i++) {
			if(n%i == 0) {
				return false;
			}
		}
		return true;
	}
}