How to find out if there 7 prime subtractors of a number I have a number and i want to find out if i can get that number by adding 7 prime numbers.How can i find that out?
Example
Number:14 
Answer:2 2 2 2 2 2 2

For n sufficiently large $n>=100$ probably less you can substract $2$ and $3$ conveniently to form odd number. Then applying the Weak Golbach Conjecture (which as far as I remember it was proved recently) it is always possible to decompose an odd number into the sum of three prime numbers. 
When n is small you can do a brute force algorithm to find every decomposition and check whether it is valid or not.
