TalentJR apps
Textbook: Mathematics and Statistics (Commerce) Part II – Class 11 (Balbharati, official free PDF) · pages 65–73
Counting large numbers of possibilities one by one is slow and error-prone. This exercise gives you two shortcuts that every later topic in the chapter rests on: add the counts when only one of several separate choices is made, and multiply the counts when a job happens in stages. You will use them to count class monitors, flag signals, words, numbers, lock settings and routes.
Addition principle: when exactly one of two non-overlapping choices is made (m ways or n ways), the total is m + n.
Multiplication principle: when a job has a first stage with m ways and a second stage with n ways, the total is m × n.
With repetition allowed every place gets all the symbols; without repetition the choices shrink by one at each place.
Fill the restricted place first — the leading digit (cannot be 0), the units digit (even, odd, multiple of 5) and so on.
Break awkward problems into cases (by number of digits, by position of a special digit) and add the cases.
Get a ✓ Verified tutor for “Exercise 6.1 – Fundamental principles of counting” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
A canteen sells 7 kinds of sandwiches and 5 kinds of rolls. You buy exactly one item. In how many ways?
Answer: 12 ways
Pune to Lonavala has 3 bus routes and Lonavala to Mumbai has 5 routes. How many ways can you travel Pune → Mumbai via Lonavala?
Answer: 15 ways
How many 3-digit even numbers can be formed from 1, 2, 3, 4, 5, 6 without repetition?
Answer: 60
How many odd numbers less than 100 can be formed from 1, 4, 7, 8 if repetition is allowed?
Answer: 10
| What | Formula | Symbols |
|---|---|---|
| Addition principle | m + n (one of two separate choices) | 7 sandwiches or 5 rolls → 12 |
| Multiplication principle | m × n (stage after stage) | 3 routes then 5 routes → 15 |
| r places, n symbols, repetition allowed | nʳ | 4-digit PIN from 10 digits → 10⁴ |
| r places, n symbols, no repetition | n(n − 1)(n − 2)… (r factors) | 2-letter words from 5 letters → 20 |
| Lock / answer-sheet trials | false trials = total − 1 | 5³ − 1 = 124 |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1. A class has 30 boys and 20 girls. The monitor may be a boy or a girl. In how many ways can the teacher choose the monitor?
Answer: 50 ways
2. Q2. In Q1, in how many ways can the monitor be chosen if the monitor must be a boy? If the monitor must be a girl?
Answer: 30 ways; 20 ways
3. Q3. A signal uses 2 flags, one above the other, from 4 flags of different colours. How many signals?
Answer: 12
4. Q4. How many two-letter words can be made from the letters of SPACE when repetition (i) is allowed (ii) is not allowed?
Answer: (i) 25 (ii) 20
5. Q5. How many three-digit numbers can be formed from 0, 1, 3, 5, 6 when repetition (i) is allowed (ii) is not allowed?
Answer: (i) 100 (ii) 48
6. Q6. How many three-digit numbers can be formed from 2, 3, 4, 5, 6 if digits may repeat?
Answer: 125
7. Q7. A letter lock has 3 rings with 5 letters on each. Find the maximum number of false trials needed to open it.
Answer: 124
8. Q8. A test has 5 true/false questions. No student scored full marks and no two students gave the same sequence of answers. Find the largest possible number of students.
Answer: 31
9. Q9. How many numbers between 100 and 1000 have 4 in the units place?
Answer: 90
10. Q10. How many numbers between 100 and 1000 contain the digit 7 exactly once?
Answer: 225
11. Q11. How many four-digit numbers made from 2, 3, 4, 7 without repetition do not exceed 7432?
Answer: 24
12. Q12. Numbers are formed from 2, 3, 4, 5, 6 without repetition. How many of them exceed 400?
Answer: 276
13. Q13. Using 0, 1, 2, 5, 7, 8 with repetition allowed, how many numbers lie between 13 and 1000?
Answer: 207
14. Q14. A school has 3 gates and 4 staircases from the first floor to the second floor. In how many ways can a student go from outside the school to a second-floor classroom?
Answer: 12
15. Q15. How many five-digit numbers formed from 0, 1, 2, 3, 4, 5 without repetition are divisible by 3?
Answer: 216
Read the question, answer it in your head, then tap the card to check. 20 cards.
15 questions. Tap an option — you will see at once if it is right and why.
1. A monitor is chosen from 30 boys or 20 girls. Ways:
Answer: A. Either a boy or a girl: 30 + 20.
2. Signals with 2 of 4 different flags, one above the other:
Answer: A. 4 choices for the top, 3 for the bottom.
3. 2-letter words from SPACE with repetition allowed:
Answer: C. 5 × 5.
4. 2-letter words from SPACE without repetition:
Answer: C. 5 × 4.
5. 3-digit numbers from 0, 1, 3, 5, 6 with repetition:
Answer: B. Hundreds 4 ways (not 0), then 5 × 5.
6. 3-digit numbers from 0, 1, 3, 5, 6 without repetition:
Answer: B. 4 × 4 × 3.
7. A lock has 3 rings with 5 letters each. Maximum false trials:
Answer: D. 5³ − 1.
8. 5 true/false questions; answer sheets all different, none fully correct. Maximum students:
Answer: C. 2⁵ − 1.
9. Numbers between 100 and 1000 with 4 in the units place:
Answer: A. 9 × 10 × 1.
10. Numbers between 100 and 1000 containing 7 exactly once:
Answer: A. 81 + 72 + 72.
11. Numbers from 2, 3, 4, 5, 6 (no repetition) exceeding 400:
Answer: A. 36 three-digit + 120 four-digit + 120 five-digit.
12. 3 gates and 4 staircases. Ways to reach the classroom:
Answer: C. Gate then staircase: 3 × 4.
13. 5-digit numbers from 0, 1, 2, 3, 4, 5 (no repetition) divisible by 3:
Answer: B. Drop 0 (120 numbers) or drop 3 (96 numbers).
14. Which principle fits 'choose a shirt and then a tie'?
Answer: C. Two stages, one after the other.
15. Even numbers below 1000 from 2, 3, 7, 8 with repetition:
Answer: B. 2 + 8 + 32.
Get a ✓ Verified tutor for “Exercise 6.1 – Fundamental principles of counting” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 6.1 – Fundamental principles of counting the fun way: match key terms, beat the 60-second lightning round and spot true or false facts. Every game uses only this lesson, so each round is real exam revision.
⭐ 0 XP⏱ About 35 minutes
Get a ✓ Verified tutor for “Exercise 6.1 – Fundamental principles of counting” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Sign in free to see the answers to the textbook exercise of Exercise 6.1 – Fundamental principles of counting.
Sign in to see solutionsStuck on a question? Type it, 🎤 speak it or 📷 snap a photo of it and get simple, step-by-step help with “Permutations and Combinations Ex 6.1” — important questions, a quick quiz, revision notes — in English, मराठी or हिंदी.
Sign in with Google to ask the AI tutor. It's free — 20 questions a day, one TalentJR account.
Sign in to askPrefer a real teacher? TalentJR teachers take live online classes anywhere in India. Tell us what you need and our team will call you with timings and fees.