Given an integer \$N\$, print or return integers \$a\$, \$b\$, and \$c\$ that satisfy all of the following conditions, if such integers exist:
- \$a \times b + c = N\$
- \$a\$, \$b\$, and \$c\$ are all prime
- \$a > b > c\$
If no valid combination of integers exist, you should return nothing, 0, None, an empty list, or raise an error.
If multiple valid combinations of integers exists, you can print or return any of them or all of them in a data type of your choosing.
A list of multiple solutions does not need to be sorted, and since we know that \$a > b > c\$, you can return them in any order.
Examples: Input: 17 Output: 5 3 2 Input: 20 Output: None Input: 37 Output: 7 5 2 Input: 48 Output: None Input: 208 Output: [(41, 5, 3), (29, 7, 5)]
This is code golf, so the code with the lowest byte count wins.
Inspired by this Redditor's neat dream.