This problem involves finding the number of ways to arrange the letters of the word 'EQUATION' under a specific condition: all the vowels must stay together, and all the consonants must also stay together.
First, let's identify the vowels and consonants in the word EQUATION:
The condition requires that all vowels are grouped together and all consonants are grouped together. We can think of these groups as single units:
Now, we need to arrange these two blocks. The possible arrangements of these blocks are:
There are 2 possible ways to arrange these two blocks.
Next, we calculate how many ways the letters can be arranged within each block:
To find the total number of arrangements satisfying the condition, we use the multiplication principle. We multiply the number of ways to arrange the blocks by the number of ways to arrange the letters within each block:
Total Arrangements = (Ways to arrange the 2 blocks) \(\times\) (Ways to arrange vowels within their block) \(\times\) (Ways to arrange consonants within their block)
Total Arrangements = \(2! \times 5! \times 3!\)
Total Arrangements = \(2 \times 120 \times 6\)
Total Arrangements = \(1440\)
Therefore, there are 1440 distinct arrangements of the letters of the word EQUATION where all vowels are together and all consonants are together.
If the number of selections of r as well as (n + r) things from 5n different things are equal, then what is the value of r?
The following figure is made with nine squares of length 1 cm each.

A student is standing at point P. The total number of shortest paths to reach point Q from point P, if the student walks along the boundaries of the squares only, is:
Consider the following statements (all the angles are measured in degrees) :
1. If two supplementary angles are $4x + 40$ and $10x$, then $x$ is;
2. The complementary angle of $\frac{4}{5} \times 45$ is :
3. If two complementary angles are in the ratio of $4 : 5$, then the smallest angle is :
Which of the following is correct?
Codes:
1 2 3
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 ?