Consider the divisors of 30: 1,2,3,5,6,10,15,30.
It can be seen that for every divisor d of 30, d+30/d is prime.
Find the sum of all positive integers n not exceeding 100 000 000such that for every divisor d of n, d+n/d is prime.
Use Cmd instead of Ctrl if you're on a Mac.
| g | Focus editor |
| Ctrl-Enter | Run the test with current code |
| Ctrl-Shift-K | Reset the editor |
| Ctrl-Shift-L | Clear console output |
| Ctrl-Shift-X | Show the solution |
| [ | Previous challenge |
| ] | Next challenge |
| T | Back to top page |
| ? | Show this dialog |
| ESC | Hide this dialog |
| Shift-ESC | Blur focus from editor |