# Can you use a digital copy more than once?

# How many 4-digit numbers can be formed by the digits 1 2 3 4 using the digits more than once in each number example 1112 1122?

4 4 = 256.
But, if you want to actually exclude those numbers which happen not to include repeated digits (e.g. 4321), then.
4 4 - 4! = 232

# Greatest six digit even number no digit used more than once?

Use the largest available digit possible starting with the hundredthousands digit, making the ones digit the largest even digit {0,2, 4, 6, 8} that has not been used. The req…uired number is: 987654

# How many 4-digit numbers can be formed by the digits 01 2 3 456789 using the digits more than once in each number example 1112 1122?

Four digit numbers span from 1000 to 9999..
This totals (9999-1000) +1 = 9000 different four digit numbers

# Explanation for the answer to how many three digit prime numbers can be formed using only odd prime digits and digits may be used more than once?

The odd prime digits are 3, 5, and 7. but the final digit of your three-digit prime number can't be 5. So there are only 18 combinations to check. You can list these numbers a…nd start going through them to see which are prime. The easiest test is divisibility by 3 (sum the digits) and that quickly eliminates 7 of them. You are left with: 337 353 373 533 553x 557 577 733 737x 757 773 Of these, only two are not prime. I marked them with an "x". I used a table of primes to find these and don't know an easier way.

# How many passwords can be made from 3 letters followed by 3 digits if no letter or digit can be used more than once?

3!*3!=36 For example, if you want to use the alphabets a,b,c and three digits 1,2,3 you can make the following 36 different passwords ( 3 letters followed by 3 digits ) abc…123 abc132 abc231 abc213 abc312 abc321 acb123 acb132 acb231 acb213 acb312 acb321 bca123 bca132 bca231 bca213 bca312 bca321 bac123 bac132 bac231 bac213 bac312 bac321 cab123 cab132 cab231 cab213 cab312 cab321 cba123 cba132 cab231 cab213 cab312 cab321

# How many ways are there to write a 3-digit positive integer using digits 1 3 5 7 and 9 if no digit is used more than once?

There are 5 digits, and if none can be repeated then the first digit can be chosen in 5 ways, the second can be chosen in 4 ways and the third in 3. 5 x 4 x 3 = 60.

# How many 2-digit numbers can be formed from the digits 4 6 and 8 Assume no number can be used more than once?

Six. 46 48 64 68 84 86

# How many 3 digit numbers can you make using the digits 1 3 5 and 7 by using the digits more than once?

Using the combination C(4,3) I got the answer 24. Its either a combination or a permutation.

# How many even 3-digit numbers can be formed from digits 1 3 5 and 7 if each digit can be used more than once?

If your only option is to assemble the digits into a single number, then the answer is 0, as you need at least one even digit to make an even number, and the digits provided a…re all odd ones. If on the other hand, you can use operators on them (e.g. 1 + 3 + 5 + 7), then you actually have quite a large number of possibilities. For example: 1 + 3 + 5 + 7 - 1 + 3 + 5 + 7 1 - 3 + 5 + 7 (1 + 3) / ( 7 - 5) 1 + â(7 + 5 - 3) 3 1 + 5 7 etc. etc. Alternatively, if you're not worried about them being even numbers, then the answer is 24.

# How many different 3 digit identification cards can be made is the digits can be used more than once. if the first digit must be a 5 and repetitions are not permitted?

All the numbers from 500 to 599 EXCEPT 500, 511, 522, 533, 544, 550 - 559, 566, 577, 588 & 599. That is 100 less 19 ie 81. If you regard 505 as being a repetition then there a…re 9 less overall.

Answered

# How many ways are there to write a 3 digit positive integer using digits 1 3 5 7 and 9 if no digit is used more than once?

This is a question of permutations; the answer is equal to the factorial of 5 (number of digits) divided by the factorial of 3 (number used in each selection), written 5! / 3!…. This equals 120 / 6, or 20 ways.

Answered

In Algebra

# How many different 3-digit identification tags can be made if the digits can be used more than once?

The first digit can be from 0 through 9, the seconds digit can be from 0 through 9 and the third digit cane be 0 through 9, then we have thr total number of tags as.
(10 x 10… x 10) = 1000 tags, if we assume that 000 is a valid tag.
If however, 000 is not a valid tag, then you can make 1000 -1 = 999 tags.

Answered

# How many four digit whole numbers can you write using the digits 1 2 3 and 4 if no digit appears more than once in each number?

(4 x 3 x 2 x 1) = 24 of them. If repetition were allowed, then there would be (4 x 4 x 4 x 4) =256 of them.

Answered

# How many numbers than 600 can be formed with the digits 5 6 7 and 8 if no digit is used more than once in a number?

There are 46 such numbers.

Answered

In Uncategorized

# How many three digit numbers can you make using the digits using 5 different numbers if no digit appears more than once in a number?

I'm going to restate the question so you know for sure whatquestion I'm answering, because I'm not positive I know whatquestion you're trying to ask. Given five distinct obje…cts, how many ways is it possible to selectthree of them if order matters? There are 5 choices for the first digit/object. There are 4 choices for the second digit/object. There are 3 choices for the third digit/object. So there are 5x4x3 = 60 possible combinations.