MHB Calculating the Total Sum of 5-Digit Numbers with and without Repetition

  • Thread starter Thread starter juantheron
  • Start date Start date
  • Tags Tags
    Sum
AI Thread Summary
The discussion focuses on calculating the total sum of 5-digit numbers formed using the digits 0 through 7, both with and without repetition. When repetition is allowed, the last digit cannot be zero, leading to a total of 21,288,960 for all valid combinations. For cases without repetition, the total sum is derived from the arrangements of digits, considering the equal probability of each digit occupying any position. The calculations involve combinatorial formulas and the contributions of each digit to different positional values. Overall, the approach emphasizes the importance of digit placement and the constraints imposed by using zero.
juantheron
Messages
243
Reaction score
1
The Total Sum of $5$ Digit no. which can be formed with the Digit $0,1,2,3,4,5,6,7$.

[a] when repetition of digit is allowed

when repetition of digit is not allowed
 
Physics news on Phys.org
jacks said:
The Total Sum of $5$ Digit no. which can be formed with the Digit $0,1,2,3,4,5,6,7$.

[a] when repetition of digit is allowed

when repetition of digit is not allowed


Hi Jacks, :)

I'll answer the first part of your question. By the same logic you should be able to complete the second part.

Note that we cannot have zero as the last digit (counting digits from right to left) of the number. Hence for the last digit we have only 7 possibilities. Suppose if we fix 0 as the first digit then we have \(7 \times 8^3=3584\) numbers, and the sum of the first digits of all those numbers will add up to \(0\times 7\times 8^3=0\). Similarly if we take 1 as the fist digit the sum of all those numbers will add up to \(1\times 7\times 8^3=3584\). Generally, if we add up all the ones places of the numbers the sum would be,

\[3584\times (0+1+2+3+4+5+6+7)\]

Similarly if we add up all the tenth places of the numbers the sum would be,

\[3584\times (0+10+20+30+40+50+60+70)=35840\times (0+1+2+3+4+5+6+7)\]

Continuing with this reasoning we get the total sum as,

\[(3584+35840+358400+358400+8^4)\times (0+1+2+3+4+5+6+7)=21288960\]
 
Thanks Sudhakara.My Try for (II)First we will form a $5$ Digit no. using $\{0,1,2,3,4,5,6,7\}$

(It also include a $4$ Digit no. bcz $0$ at extreme left. )

So Total no.,s e $ \displaystyle = \binom{8}{5} \times 5! = \frac{8!}{3!}$Each digit has an equal chance of being selected into any particular possition.

So, for example, the digit 2 will occupy the units position in $\displaystyle \frac{1}{8}$ of the arrangements.

So The sum of the arrangement each of $5$ position is $\displaystyle = \frac{1}{8}\left(0+1+2+3+4+5+6+7\right)\cdot \frac{8!}{3!}$

So Total Sum of $5$ Digit no. including $0$ at Thousant place is $\displaystyle = \frac{1}{8}\left(0+1+2+3+4+5+6+7\right)\cdot \frac{8!}{3!}\cdot (1111)$

Now We Will Calculate Sum of $4$ Digit no. Using $1,2,3,4,5,6,7$

Using same Idea We Get $\displaystyle = \frac{1}{7}.\frac{7!}{3!}\cdot \left(1+2+3+4+5+6+7\right)\cdot (1111)$

So Total Sum of $5$ Digit no. is $\displaystyle = \frac{1}{8}\left(0+1+2+3+4+5+6+7\right)\cdot \frac{8!}{3!}\cdot (1111) - \frac{1}{7}.\frac{7!}{3!}\cdot \left(1+2+3+4+5+6+7\right)\cdot (1111)$

- - - Updated - - -
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top