Solve the given permutation problem

In summary, the conversation discussed two approaches for filling in digits in a number with specific requirements. The first approach involved filling the first four slots with digits that are not divisible by 5, resulting in 5712 ways. The second approach focused on filling the last five slots with digits that are not divisible by 5, also resulting in 5712 ways. The speaker also mentioned an alternative method of considering the number of possibilities for numbers ending in 0 and 5 separately.
  • #1
chwala
Gold Member
2,744
387
Homework Statement
How many ##5##-digit numbers are there that have ##5## different digits and are divisible by ##5##?
Relevant Equations
Permutation
My First approach on this;
The last digit should be a ##0## or a ##5##. Therefore the first ##4## slots can be filled in ##_9P_4×1## ways = ##3024##.
Secondly, we also note that ##0## cannot be on the first slot as this would imply ##4## digits instead of ##5##...further the last slot has to either be a ##0## or a ##5##. Therefore we are going to have; ##8×_8P_3×1##=##2688##. Thus we shall have ##3024+2688=5712## ways.

In my second approach;

I am thinking along the lines of the ##5## slots being filled initially by digits that are not divisible by ##5## i.e
The ##5## slots can be filled in ##9×_9P_4## ways= ##27, 216## ways.

The ##5## slots can be filled by numbers that are not divisible by ##5## in ;
##8×_8P_3×8=21,504## ways.

Therefore, numbers that are divisible by ##5## can be filled in ##27,216 - 21,504=5,712## ways. Bingo! :cool:
Any feedback is highly welcome or more insight that is.
 
Physics news on Phys.org
  • #2
Alternatively:

If the number ends in ##0##, three are ##9\times 8 \times 7 \times 6## possibilities.

If the number ends in ##5## there are ##8\times 8 \times 7 \times 6## possibilities.
 
  • Like
Likes chwala

FAQ: Solve the given permutation problem

1. What is a permutation problem?

A permutation problem is a type of mathematical problem that involves arranging a set of elements in a specific order or sequence. This can also be referred to as a "permutation puzzle".

2. How do you solve a permutation problem?

To solve a permutation problem, you need to first understand the rules and conditions of the problem. Then, you can use various techniques such as listing out all possible combinations, using formulas, or using a systematic approach to find the correct solution.

3. What is the difference between permutation and combination problems?

Permutation problems involve arranging elements in a specific order, while combination problems involve selecting a group of elements without considering the order. In other words, permutation problems involve rearranging, while combination problems involve selecting.

4. Are there any shortcuts or tricks to solve permutation problems?

Yes, there are some techniques that can make solving permutation problems easier. These include using formulas, creating a table or chart, or using a systematic approach. However, it is important to understand the concept behind the problem and not rely solely on shortcuts.

5. How can permutation problems be applied in real life?

Permutation problems can be applied in various fields such as computer science, statistics, and genetics. For example, in computer science, permutation problems can be used in algorithms for sorting and searching data. In genetics, permutation problems can be used to analyze gene sequences and identify patterns.

Back
Top