Knowee
Questions
Features
Study Tools

Find how many different 4-digit numbers can be formed using the digits 1. 2, 3, 4, 5 and 6 if no digit is repeated that are greater than 6000 are odd?

Question

Find how many different 4-digit numbers can be formed using the digits 1, 2, 3, 4, 5, and 6 if no digit is repeated that are greater than 6000 are odd?

🧐 Not the exact question you are looking for?Go ask a question

Solution

Sure, here is the step by step solution:

Step 1: Since the number has to be greater than 6000, the first digit can only be 6. So, there is only 1 way to choose the first digit.

Step 2: The number also has to be odd. The only odd numbers in the given digits are 1, 3, and 5. So, there are 3 ways to choose the last digit.

Step 3: For the second and third digits, we can choose any of the remaining 4 digits. So, there are 4 ways to choose the second digit.

Step 4: After choosing the second digit, we are left with 3 digits. So, there are 3 ways to choose the third digit.

Step 5: Multiply the number of ways to choose each digit to get the total number of 4-digit numbers. So, the total number of 4-digit numbers is 1 * 3 * 4 * 3 = 36.

This problem has been solved

Similar Questions

ct as mentor and explain . How many 6 digit numbers can be formed from digits 2,2,3,3,4,4,? How many of them will lie between 400000 and 430000 ?

How many four-digit odd numbers can be formed with the digits 0-9 if each digit is used only once in each number?

How many 3-digit numbers can be formed from the digits 2, 3, 5, 6 and 7, which are divisible by 4 and none of the digits is repeated?

The sum of all the possible numbers of 4 digits formed by digits 3, 5, 5, and 6 using each digit once is

Distinct two-digit numbers are written one after the other to form a six-digit number. How many six-digit numbers thus formed have four consecutive 1s in them?

1/3

Upgrade your grade with Knowee

Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.