UPES B.Tech Admissions 2025
Ranked #42 among Engineering colleges in India by NIRF | Highest CTC 50 LPA , 100% Placements
PERMUTATION AS AN ARRANGEMENT is considered one the most difficult concept.
154 Questions around this concept.
How many different six-letter words can be formed using the letters A, B, C, D, E, F, G without repetition?
In how many distinct ways can 25 students be arranged around a circular table, if 6 students are absent on that day and 10 students went to sports meet?
A group of 8 friends, including 3 siblings, is going to sit in a row for a photo. If the siblings must sit next to each other, in how many different ways can they be arranged?
New: JEE Main 2025 Admit Card OUT; Download Now
JEE Main 2025: Sample Papers | Syllabus | Mock Tests | PYQs | Video Lectures
JEE Main 2025: Preparation Guide | High Scoring Topics | Free Crash Course
In how many ways can the digits 0, 1, 2, 3, 4, and 5 be arranged to form a six-digit number, where the last digit must be even?
How many distinct six-digit numbers can be formed using the digits 1, 2, 3, 4, 5, and 6, where the middle digit must be odd?
A password consists of 5 letters, where each letter can be either a vowel (a, e, i, o, u) or a consonant. In addition, the password must have at least two vowels. How many different passwords are possible?
12 letter words are formed using the letters of the word INTERMEDIATE.
If the number of words that neither begins with $I$ nor ends with $E$ is $\lambda \frac{10 !}{4 !}$, then $\lambda$ is equal to
Ranked #42 among Engineering colleges in India by NIRF | Highest CTC 50 LPA , 100% Placements
Recognized as Institute of Eminence by Govt. of India | NAAC ‘A++’ Grade | Upto 75% Scholarships | Last Date to Apply: 25th Jan
A library has different books and 3 copies of each of the books. The number of ways of selecting one or more books from the library is
No. of ways to arrange Rohan,Saem and Shahid in a row is
What is division into groups?
Permutation basically means the arrangement of things. And when we talk about arrangement then the order becomes important if the things to be arranged are different from each other (when things to be arranged are the same then order doesn’t have any role to play). So in permutations order of objects becomes important.
Arranging n objects in r places (Same as arranging n objects taken r at a time) is equivalent to filling r places from n things.
So the number of ways of arranging n objects taken r at a time = n(n - 1) (n - 2) ... (n - r + 1)
$
\frac{n(n-1)(n-2) \ldots(n-r+1)(n-r)!}{(n-r)!}=\frac{n!}{(n-r)!}={ }^n P_r
$
Where $r \leq n$ and $r \in W$
So, the number of ways arranging n different objects taken all at a time = ${ }^n P_n=n!$.
Example: In how many ways can 5 people be seated at 3 places?
Solution: Basically this question is about arranging 5 people at 3 different places
Let’s think that we are given 3 places, so for the first place we have 5 people to choose from, hence this can be done in 5 ways as all 5 are available.
Now for 2nd place we have 4 people to choose from, hence this can be done in 4 ways.
Similarly, for 3rd place, we have 3 choices.
Since we have to choose for all 3 places, the multiplication rule is applicable, and the total number of ways 5×4×3=120,
This can also be done directly from the notation or formula
${ }^{\mathrm{n}} \mathrm{P}_{\mathrm{r}}$ where $\mathrm{n}=5, \mathrm{r}=3$, so ${ }^5 \mathrm{P}_3=\frac{5!}{2!}=5 \times 4 \times 3=120$
For a set of $n$ distinct objects, the number of possible arrangements (permutations) is given by:
$
P(n)=n!
$
Where $n!$ (read as " n factorial") is the product of all positive integers from 1 to $n$.
"Stay in the loop. Receive exam news, study resources, and expert advice!"