For a number to be divisible by 5, Show
Unit’s place digit should be 0 or 5. Case I: when unit’s place is 0 Unit’s place digit can be selected in 1 way. 10’s place digit can be selected in 5 ways. 100’s place digit can be selected in 4 ways. 1000’s place digit can be selected in 3 ways. 10000’s place digit can be selected in 2 ways. ∴ total number of numbers = 1 × 5 × 4 × 3 × 2 = 120 Case II: when unit’s place is 5 Unit’s place digit can be selected in 1 way 10000’s place should be a non-zero number ∴ It can be selected in 4 ways 1000’s place digit can be selected in 4 ways. 100’s place digit can be selected in 3 ways. 10’s place digit can be selected in 2 ways. ∴ total number of numbers = 1 × 4 × 4 × 3 × 2 = 96 ∴ Required number = 120 + 96 = 216 Solution (i) The unit place can be filled by any one of the digits 1,2,3,4 and 5. So the unit place can be filled in 5 ways. Similarly the tens place and hundreds place can be filled in 5 ways each because repetition of digits is allowed.∴ Total number of 3-digit numbers = 5×5×5=125(ii) The unit place can be filled by any one of the digits 1,2,3,4 and 5. So the unit place can be filled in 5 ways. Now four digits are left. So the tens place can be filled in 4 ways. the hundreds place can be filled in 3 ways by the remaining 3 digits because repetition of digits is not allowed.∴ Total number of 3-digit numbers = 3×4×5=60.In mathematics, permutation is known as the process of arranging a set in which all the members of a set are arranged into some series or order. The process of permuting is known as the rearranging of its components if the set is already arranged. Permutations take place, in more or less important ways, in almost every area of mathematics. They frequently appear when different commands on certain finite sets are considered. What is a Combination? A combination is an act of choosing items from a group, such that (not like permutation) the order of choice does not matter. In smaller cases, it is possible to count the number of combinations. Combination refers to the union of n things taken k at a time without repetition. In combination, you can select the items in any order. To those combinations in which re-occurrence is allowed, the terms k-selection or k-combination with replication are frequently used. Permutation Formula In permutation r things are selected from a set of n things without any replacement. In this order of selection matter.
Combination Formula In combination r things are selected from a set of n things and where the order of selection does not matter.
How many 3-digit even numbers can be formed by using the digits 1,2,3,4, and 5?Solution:
Similar QuestionsQuestion 1: How many 3 digit odd numbers can be formed by using the digits 1,2,3,4 and 5? Solution:
Question 2: How many 4 digit even numbers can be formed by using the digits 1,2,3,4 and 5? Solution:
How many three digits numbers can be formed using the digits 1,2 3 4 5 if digits can be repeated?There are 504 different 3-digit numbers which can be formed from numbers 1, 2, 3, 4, 5, 6, 7, 8, and 9 if no repetition is allowed.
How many 3Solution : (i) When repetition of digits is allowed: <br> No. of ways of choosing firsy digits = 5 <br> No. of ways of choosing second digit = 5 <br> No. of ways of choosing third digit = 5 <br> Therefore, total possible numbers `= 5 xx 5 xx 5 = 125` <br> (ii) When repetition of digits is not allowed: <br> No.
How many 3 digits numbers can be formed from the digits 1,2 3 4 and 5 Assuming that a repetitions of digits are allowed B repetitions of digits are not allowed?so 60(ans.)
How many 3Hence, 24 3-digits numbers can be formed without using the digits 0, 2, 3, 4, 5 and 6.
|