A rectangular wall is divided into four squares of equal size where there are two rows each having two squares. The top left square is coloured with green. If, including green, there are three colours available and each square is coloured using any one of these three colours such that no two adjacent squares get painted with the same colour; then how many colour combinations are possible ?
This problem involves finding the number of ways to colour a 2x2 grid (4 squares) using 3 available colours, with the constraint that no two adjacent squares share the same colour. The top-left square is pre-assigned a colour (Green).
Let the grid be represented as:
A | B --+-- C | D
We analyze two main cases based on the colours chosen for squares B and C:
The total number of possible colour combinations is the sum of the combinations from Case 1 and Case 2.
Total Combinations = (Combinations from Case 1) + (Combinations from Case 2)
Total Combinations = $2 + 4 = 6$.
If Quantity A is the number of ways to assign a number from 1 to 5 without repetition to each of four people, and Quantity B is the number of ways to assign a number from 1 to 5 without repetition to each of 5 people, then which of the following statements is correct with respect to Quantities A and B?
Which of the following muscles regulates the exit of food from the stomach into the small intestine?
There are 9 cups placed on a table arranged in equal number of rows and columns out of which 6 cups contain coffee and 3 cups contain tea. In how many ways can they be arranged so that each row should contain at least one cup of coffee?
In how many different ways can the letters of the word 'OPTICAL' be arranged so that the vowels always come together?
There are $15$ distinct points on a plain sheet of paper. If $4$ of these points are collinear, find the maximum number of triangles that can be drawn using these points.