Goldbach's conjecture problem
Of course. As a Turning-complete language, you can perform an operation you want.
Anyway, instead of just printing them out if they meet those conditions, just add another condition that checks for primality (is that a word?)
Anyway, instead of just printing them out if they meet those conditions, just add another condition that checks for primality (is that a word?)
closed account (1vRz3TCk)
| primality (is that a word?) |
Yes it is.
| Yes, but I have no idea what that coding/condition would be. |
and now that you have edited the original post no one can help you any more, good move.
Topic archived. No new replies allowed.