- #1
futb0l
I have trouble understanding the MEANING of each question...
How many ways are there of picking out the name ELLE from the following table by moving from each letter to an adjacent letter ( up or down, left or right, and diagonal steps are allowed, but the same must not be used twice in one ELLE)?
E E E E
E L L E
E L L E
E E E E
---
A cube with edge of length N is painted. The cube is then divided into N^3 cubes of the same size. Among these small cubes, there are some which do not have a painted face, some which have one, two or three painted faces. For what value of N is the number of small cubes which have do NOT have a painted face equal to the number of small cubes which have only one painted face?
How many ways are there of picking out the name ELLE from the following table by moving from each letter to an adjacent letter ( up or down, left or right, and diagonal steps are allowed, but the same must not be used twice in one ELLE)?
E E E E
E L L E
E L L E
E E E E
---
A cube with edge of length N is painted. The cube is then divided into N^3 cubes of the same size. Among these small cubes, there are some which do not have a painted face, some which have one, two or three painted faces. For what value of N is the number of small cubes which have do NOT have a painted face equal to the number of small cubes which have only one painted face?
Last edited by a moderator: