Design 25 cubes so that each cube's six faces display integer numbers in the range 0,1,...,31 such that:
On each cube, all the numbers are different.
Any given two cubes share exactly one common number.
Please give your answer as 25 lines of six numbers. Bonus question: Use as small a range of numbers as possible.
After seeing the solution, I read that this can be solved using "Projective plane". So my questions are:
- How to solve such a question? (What is the strategy..)
- How can I decide that a given problem (like this) has a solution? For example, given 25 cubes and a set from 1 to 10.. Logically it's impossible to be solved.
- What field of maths does "Projective plane" belong to? I mean, what is (more general) topic in maths that I have to study to understand "Projective plane"?
Note: I don't know what tags do I have to choose for this question.
Here is a simplified version of your problem with the geometrical diagram.
It might be phrased like, how many committees of 3 can be formed by a group of 7 people such that no pair of people serve on two committees.
The figure is called the "Fano Plane" and a finite protective plane.
Your figure will be several orders of magnitude more complicated, but a similar idea.
You might want to look up "the Sunday golfer problem" as it is a well known and very similar problem.