![]() ![]() A can take values 1 to 9, C & D can take values 0 to 9. So, 3 gets printed in the 100’s place 1000 times. ![]() B can take values 0 to 9, C can take values 0 to 9, D can take values 0 to 9. 3 can be printed in the 1000’s place, 100’s place or 10’s place or units place. So, 3 gets printed 280 times in 3-digit numbersįour-digit numbers: A B C D. So, 3 gets printed in the unit’s place 90 times A can take values 1 to 9, B can take values 0 to 9. So, 3 gets printed in the 10’s place 90 times A can take values 1 to 9, C can take values 0 to 9. So, 3 gets printed in the 100’s place 100 times B can take values 0 to 9, C can take values 0 to 9. 3 can be printed in the 100’s place or 10’s place or units place. We need to consider all three digit and all 4-digit numbers. ![]() This question is based on counting the number of times a particular digit appears in a list. Para Jumble Sentence Correction Sentence Elimination Paragraph Completion Reading Comprehension Critical Reasoning Word Usage Para Summary Text CompletionĭI LR: Bar Graphs DI LR: Pie Charts DI LR: Multiple Graphs DI LR: Word Problems DI LR: Line Graphs DI LR: Sequencing DI LR: Grid Puzzles DI LR: Math Puzzles DI LR: Visualization DI LR: Other Patterns DI LR: CAT 2017 Cet DI LR: CAT 2017 Rural Survey DI LR: CAT 2017 Happiness DI LR: CAT 2017 Airlines DI LR: CAT 2017 Travel Route DI LR: CAT 2017 Food Delivery DI LR: CAT 2017 Square Layout DI LR: CAT 2017 Team Project DI LR: CAT 2017 Assets DI LR: CAT 2017 Pizza DI LR: CAT 2017 Electives DI LR: CAT 2017 Chess DI LR: CAT 2017 Dorms DI LR: CAT 2017 Tea DI LR: CAT 2017 Friends DI LR: CAT 2017 Security ScanĮxplanatory Answer Method of solving this CAT Question from Permutation and Combination: This is a very popular template. There are 3,326,400 ways to order the sheet of stickers.Question 1 Question 2 Question 3 Question 4 Question 5 Question 6 Question 7 Question 8 Question 9 Question 10 Question 11 Question 12 Question 13 Question 14 Question 15 Question 16 Question 17 Question 18 Question 19 Question 20 Question 21 Question 22 Question 23 Question 24 Question 25 Question 26 Question 27 Question 28 Question 29 Question 30 Question 31 Question 32 Question 33 HCF and LCM Factors Remainders Factorials Digits Ratios,Mixtures Averages Percents Profits SICI Speed & Time Races Logarithms and Exponents Pipes,Cisterns Work,Time Set Theory Geometry Coordinate Geometry Mensuration Trigonometry Linear & Quadratic Equations Functions Inequalities Polynomials Progressions If we have a set of n objects and we want to choose r objects from the set in order, we write P\left(n,r\right). Before we learn the formula, let’s look at two common notations for permutations. ![]() Fortunately, we can solve these problems using a formula. The number of permutations of n distinct objects can always be found by n!.įinding the Number of Permutations of n Distinct Objects Using a Formulaįor some permutation problems, it is inconvenient to use the Multiplication Principle because there are so many numbers to multiply. Note that in part c, we found there were 9! ways for 9 people to line up. There are 362,880 possible permutations for the swimmers to line up. There are 9 choices for the first spot, then 8 for the second, 7 for the third, 6 for the fourth, and so on until only 1 person remains for the last spot.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |