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$.
On a chess board, in how many different ways can 6 consecutive squares be chosen on the diagonals along a straight path ?
There are 6 persons arranged in a row. Another person has to shake hands with 3 of them so that he should not shake hands with two consecutive persons. In how many distinct possible combinations can the handshakes take place ?
In a tournament of Chess having 150 entrants, a player is eliminated whenever he loses a match. It is given that no match results in a tie/draw. How many matches are played in the entire tournament?
The letters A, B, C, D and E are arranged in such a way that there are exactly two letters between A and E. How many such arrangements are possible?
There is a numeric lock which has a 3-digit PIN. The PIN contains digits 1 to 7. There is no repetition of digits. The digits in the PIN from left to right are in decreasing order. Any two digits in the PIN differ by at least 2. How many maximum attempts does one need to find out the PIN with certainty?