This document contains 14 problems involving permutations and combinations of letters, numbers, people, and cards arranged under certain conditions:
1. The number of arrangements of the letters in 'SECTION' such that the first letter is a vowel.
2. The number of arrangements such that the first letter is a consonant.
3. The number of arrangements such that the first and last letters are vowels.
It then continues to solve similar permutation and combination problems involving arranging letters, forming numbers using given digits, arranging people in a line under certain conditions, and arranging cards in a row where some must be next to each other. The document provides the number of possible arrangements for each problem.
This document contains 14 problems involving permutations and combinations of letters, numbers, people, and cards arranged under certain conditions:
1. The number of arrangements of the letters in 'SECTION' such that the first letter is a vowel.
2. The number of arrangements such that the first letter is a consonant.
3. The number of arrangements such that the first and last letters are vowels.
It then continues to solve similar permutation and combination problems involving arranging letters, forming numbers using given digits, arranging people in a line under certain conditions, and arranging cards in a row where some must be next to each other. The document provides the number of possible arrangements for each problem.
This document contains 14 problems involving permutations and combinations of letters, numbers, people, and cards arranged under certain conditions:
1. The number of arrangements of the letters in 'SECTION' such that the first letter is a vowel.
2. The number of arrangements such that the first letter is a consonant.
3. The number of arrangements such that the first and last letters are vowels.
It then continues to solve similar permutation and combination problems involving arranging letters, forming numbers using given digits, arranging people in a line under certain conditions, and arranging cards in a row where some must be next to each other. The document provides the number of possible arrangements for each problem.
6.1.4 Permutations of n different objects under given conditions.
1. In how many ways can all the letters in the word
SECTION be arranged without repetition such that the irst letter is !owel "
#$1%&' $. In how many ways can all the letters in the word SECTION be arranged without repetition such that the irst letter is consonant " #$((&' ). In how many ways can all the letters in the word SECTION be arranged without repetition such that the irst and last letters are !owels " #*$&' +. In how many ways can all the letters in the word SECTION be arranged without repetition such that the three letters in the middle are !owels " #1++' ,. In how many ways can all the letters in the word SECTION be arranged without repetition such that the irst letter is a !owel and last letter is a consonant "
#1++&' %. In how many ways can all the letters in the word SECTION be arranged without repetition such that the irst letter is E and last letter is T " #1$&' *. In how many ways can all the letters in the word SECTION be arranged without repetition such that the !owels placed ad-acent to each other " #*$&' (. In how many ways can all the letters in the word SECTION be arranged without repetition such that the !owels separated rom each other " #+)$&' Permutations & Combinations + .. /ow many i!e0digit e!en numbers that can be ormed using the digits $1 )1 +1 % and * without repetition. #*$' 1&. /ow many i!e0digit odd numbers that can be ormed using the digits $1 )1 +1 % and * without repetition. #+(' 11. /ow many i!e0digit numbers that are greater than +&&&& can be ormed using the digits $1 )1 +1 % and * without repetition. #*$' 1$. /ow many i!e0digit numbers that are smaller than can be +&&&& ormed using the digits $1 )1 +1 % and * without repetition. #+(' 1). In how many ways can $ boys and ) girls be arranged in a line i the two boys must be at the ront and the bac2 o the line respecti!ely " #1$' 1+. In how many ways can $ boys and ) girls be arranged in a line i the two boys must be at the irst two position o the line respecti!ely " #1$' 1,. ( dierent cards are to be arranged in a row. In how many ways can all the cards be arranged i $ particular cards must be ne3t to each other "
#1&&(&' 1%. ( dierent cards are to be arranged in a row. In how many ways can all the cards be arranged i ) particular cards must be ne3t to each other " #+)$&' Permutations & Combinations ,