Can you place distinct numbers from 0 to 9 on a 3x3 grid such that every pair of neighbouring (horizontally and vertically) numbers sum to a prime? Can you find multiple solutions? Note that the placed numbers can only be used once and one number will remain unused. The generated primes can be reused.
Good luck!