Here's an interesting puzzle: A cabinet with ten drawers, each numbered 1 to 10, stands in an otherwise empty room in a prison. The warden enters the room, writes the name of 10 different inmate numbers on separate cards & distributes the pieces randomly so that each drawer contains one prisoner's unique number. Said inmates with their numbers placed were invited to a room in shackles. They're tasked to enter the room, one after the other, and given 5 tries (opening 5 drawers) to find their inmate number among the cabinet. When they're done, they will exit to an isolated waiting room where they cannot speak of their findings to anyone that has yet to attempt the task. The warden adds a hope-

[S1 Science / S3 Physics: Density and Buoyant Force] Hey, happy holidays! You might have seen a while ago that your friends were toying around with a stickman that comes to life. How is that possible? Well, only one way to find out, isn't there? Steve Mould is here to give your dry erase markers an all-new purpose. You can enjoy this cool science trick with the whole family for the holidays.

[P6 - S2 Maths: Circles] Hey, hope you enjoyed the two-week suspense. Please don't agonise over it like my kids did. Kept you waiting, huh? Haha. Here's the solution as promised: Wow, that's a mouthful! Thankfully, Professor Ben Sparks has a much more geometric (and intuitive) explanation, right here: Isn't it wonderful how the event horizons intersect and allow the duck / mouse to escape? For those interested in higher level mathematics, the predator will always win if their speed is at least (𝜋 + r) time faster than the mouse. Bonus question: Prove that the prey can no longer escape when the predator's speed is equal to (𝜋 + r). You may opt for a visual proof, a direct proof or a proof