The six cards shown display the number 632579.
One “turn” consists of exchanging the positions of two adjacent cards so, for instance, after one “turn” the cards could show 632759. Starting from the original 632579, what is the least number of “turns” required so that the cards display a number which is divisible by 4?
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
Junior Mathematical Challenge 2000 (2000)
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →Junior Mathematical Challenge 2000 (2000)