Problem:
You are given a function 'secret()' that accepts a single integer parameter and returns an integer. In Java, write a program that determines if this function  is an additive function [ secret(x+y) = secret(x) + secret(y) ] for all prime numbers under N where N is a given integer.