You are given a function ‘secret()’ that accepts a single integer parameter and returns an integer. In your favorite programming language, write a program that determines if this function is an additive function [ secret(x+y) = secret(x) + secret(y) ] for all prime numbers under 100.
pgmcgee / primes Goto Github PK
View Code? Open in Web Editor NEWDetermine if a function is additive over primes under a given number