Problem: the function f ( p ) represents the number of ways that prime numbers can be uniquely summed to form a certain number p such that p = a + b + c + d … where those summed variables are each prime and a ≤ b ≤ c ≤ d . . . for instance f ( 8 ) = 3 and the unique ways are 2 + 2 + 2 + 2 and 2 + 3 + 3 and 3 + 5 . what is f ( 12 ) ?
Rationale: so we can start with 2 and check whether sum of two primes is primes is even . 1 ) 2 ( 6 times ) 2 ) 2 ( 3 times ) + 3 ( 2 times ) 3 ) 2 ( 2 times ) + 3 + 5 4 ) 2 + 3 + 7 5 ) 2 + 5 + 5 6 ) 3 ( 4 times ) 7 ) 5 + 7 answer : d
annotated_formula: add(divide(12, const_4), const_4)