Permutations-(AKS)

VITEEE Coaching › Algebra questions › Permutations-(AKS)

A 15-letter word is to be formed by using 5A's, 5B's and 5C's.....Such dat there are no A's in the 1st 5 places, no B's in the next 5 places and no C's in the last 5 places. How many such words are possible?

AKS solved dis for me - but I failed to get the soln at home...[2]

#Mathematics #Algebra

UP 0 DOWN 0 1 5
Post on FacebookPost anonymously?

5 Answers

Ankur Jay ·2010-01-05 09:40:28

Well dude, the first answer i would give is 0. Cuz there is no sensible word that can be formed from that group of letters [3].

However, if you are asking the permutations possible according to the conditions you posted ,there are only 2 ways.

BBBBB CCCCC AAAAA and CCCCC AAAAA BBBBB

UP 0 DOWN 0
Post on FacebookPost anonymously?

Maths Musing ·2010-01-05 10:31:03

erm--- this can also be a part --- cccbb aaacc bbbaa

UP 0 DOWN 0
Post on FacebookPost anonymously?

Devil ·2010-01-06 01:08:33

Nope Ankur [3] [4]

UP 0 DOWN 0
Post on FacebookPost anonymously?

Devil ·2010-01-16 09:25:12

UP 0 DOWN 0
Post on FacebookPost anonymously?

eureka123 ·2010-01-21 09:18:03

short on time...so copy paste.....

dont curse me plzz.[2]

UP 0 DOWN 0
Post on FacebookPost anonymously?

Your Answer

Basic Integral Calculus Operators Symbols Matrix Cases

√ √ || {} [] () → ~ ^ x x x → → ln log lg lim lim cos sin tan cot arcsin arccos arctan

∫ ∫ ∫ ∫ ∫ ∬ ∬ ∬ ∬ ∬ ∭ ∭ ∭ ∭ ∭ ⨌ ⨌ ⨌ ⨌ ⨌

∑ ∑ ∑ ∑ ∑ ∮ ∮ ∮ ∮ ∮ ∏ ∏ ∏ ∏ ∏ ∐ ∐ ∐ ∐ ∐

+ - × ÷ ± ∓ = ∪ ∩ ≠ ∼ ≈ ∅ ∀ ∃ ∈ ∋ ∝ ≤ ≥ ≃ ≅ ≡ < > ≪ ≫ ⊂ ∉ ⊃ ⊆ ⊇ ⇒ ⇐ ⇔ ⇒ ⇐ ⇔ ⇑ ⇓ ⇕ → ← ↔ → ← ↔ ↑ ↓ ↕ ↖ ↗ ↘ ↙ ↪ ↩ ⇀ ↼ ⇁ ↽

° ∂ ∞ α β γ δ θ λ μ ν ξ π ρ σ φ ω ε ƒ κ τ υ Γ Δ Λ Σ Π Ω

Close [X]

Permutations-(AKS)

5 Answers

Your Answer

Add Image

Similar Questions