Download App

Permutations and Combinations (p-2) — Maths (commerce) STD 11 Commerce / Arts — Question

Maharashtra BoardEnglish MediumSTD 11 Commerce / ArtsMaths (commerce)Permutations and Combinations (p-2)1 Mark
Question
Find n, if : $(n+3) !=110 \times(n+1)$ !
✓

Answer

$
\begin{aligned}
& (n+3) !=110 \times(n+1) ! \\
& \therefore(n+3)(n+2)(n+1) !=110(n+1) ! \\
& \therefore(n+3)(n+2)=(11)(10)
\end{aligned}
$
Comparing on both sides, we get
$
\begin{aligned}
& n+3=11 \\
& \therefore n=8
\end{aligned}
$

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "Solve the following Question.(1 Marks)" from Permutations and Combinations (p-2)→Permutations and Combinations (p-2) — all question types→Maths (commerce) STD 11 Commerce / Arts question papers→Maharashtra Board STD 11 Commerce / Arts question papers→Maharashtra Board question paper generator→

Similar questions

Find the number of ways of dividing 20 objects in three groups of sizes 8,7 and 5.
→
Find the $x$ and $y$-intercepts of the following lines: $2 x-3 y+12=0$
→
If $P(A)=\frac{1}{4}, P(B)=\frac{2}{5}$ and $P(A \cup B)=\frac{1}{2}$. Find the values of the following probabilities.: $P\left(A^{\prime} \cap B^{\prime}\right)$
→
Solve the following inequations: $|7 x-4|<10$
→
For the following G.P.'s, find $S_n$. : $3,6,12,24, \ldots$.
→
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find(A × B) ∩ (A × C)
→
30 objects are to be divided into three groups containing 7, 10, 13 objects. Find the number of distinct ways of doing so.
→
Obtain the equation of the line which is: parallel to the X-axis and making an intercept of 5 on the Y-axis.
→
Evaluate the following limits:

$\lim _{x \rightarrow 2}\left[\frac{x^3-4 x^2+4 x}{x^2-1}\right]$

→
A student finds 7 books of his interest but can borrow only three books. He wants to borrow the Chemistry part II book only if Chemistry Part I can also be borrowed. Find the number of ways he can choose three books that he wants to borrow.
→