and its associate:
In that Puzzle 411 I added two questions -Q3 & Q4- that
Thinking twice that pair of questions, now I see that solving
Q3, Q4 is solved at the same time, which is not the case on the
contrary. So, Q3 is harder than Q4, then again let's post Q4...
Find the smallest 3x3 magic
square M such that p(M) is magic but every entry
k in M is prime -or show that this object is impossible.