I was asked this question in an interview but I was unable to figure out any solution. I don't know whether the question was right or not. I tried a lot but couldn't reach any solution. Honestly speaking, nothing came to my mind.
A positive integer \$n\$ is a Rocco number if it can be represented either as \$n=p(p+14)\$ or \$n=p(p-14)\$, where \$p\$ is a prime number.
The first 10 Rocco numbers are:
$$32, 51, 95, 147, 207, 275, 351, 435, 527, 627$$
Your code must accept a positive integer as input and determine if it is a Rocco number or not.
- Write a function that calculates and prints the count of Rocco numbers less than or equal to 1 million.
- Write a function that calculates and prints the count of Rocco numbers from the bonus question (above one) that are prime.