Solve the given permutation problem

  • Thread starter Thread starter chwala
  • Start date Start date
  • Tags Tags
    Permutation
AI Thread Summary
The discussion focuses on solving a permutation problem involving five-digit numbers that must end in either 0 or 5. The first approach calculates the total permutations as 5712 by considering the constraints on the first and last digits. The second approach examines filling the slots with digits not divisible by 5, arriving at the same total of 5712 ways. Additional calculations are provided for scenarios where the number ends specifically in 0 or 5, highlighting different permutation possibilities. The overall conclusion emphasizes the consistent outcome of 5712 valid permutations.
chwala
Gold Member
Messages
2,827
Reaction score
415
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
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.
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top