June 15, 2021 4:30 pm
	                             Topic starter
                                
                            
                 Notifications
                
            
                Clear all
    
            
        [Solved] Combination
                                        0                                    
                                How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9, which are divisible by 5 and none of the digits is repeated?
Answer
Add a comment
                                
					            Add a comment                            
                        
                                
                                1 Answer                            
                            
                                        0                                    
                                Since each desired number is divisible by 5, so we must have 5 at the unit place. So, there is 1 way of doing it.
The tens place can now be filled by any of the remaining 5 digits (2, 3, 6, 7, 9). So, there are 5 ways of filling the tens place.
The hundreds place can now be filled by any of the remaining 4 digits. So, there are 4 ways of filling it.
Required number of numbers = (1 x 5 x 4) = 20.
Add a comment
                                
					            Add a comment                            
                        
                
                Forum Information
            
            
        - 32 Forums
- 159 Topics
- 320 Posts
- 0 Online
- 2 Members
                    
					Our newest member: Alban Zeka                
				                    
				            
                    Forum Icons:
                     Forum contains no unread posts
                     Forum contains unread posts
                
                
                    Topic Icons:
                     Not Replied
                     Replied
                     Active
                     Hot
                     Sticky
                     Unapproved
                     Solved
                     Private
                     Closed
                
            