MHB Strings of three decimal digits

  • Thread starter Thread starter alexmahone
  • Start date Start date
  • Tags Tags
    Strings
AI Thread Summary
The discussion focuses on calculating the number of strings of three decimal digits that contain exactly two '4's. Initially, a method suggests that there are 54 combinations by treating the two '4's as distinguishable, leading to overcounting. The correct approach recognizes that the two '4's are indistinguishable, reducing the total to 27 unique strings. The breakdown shows that there are three distinct arrangements for the '4's, each followed by one of nine other digits. Ultimately, the correct total for the strings is 27, confirming the importance of accounting for indistinguishability in combinatorial problems.
alexmahone
Messages
303
Reaction score
0
How many strings of three decimal digits have exactly two digits that are 4s?

Solution:

44x - 9 strings
4x4 - 9 strings
x44 - 9 strings
Total: 27 strings

I get that.

But what is wrong with this line of reasoning? I have two 4s with me. I have 3 positions for the first one and 2 for the second one. Then I will have a blank space that can be filled by one of 9 digits. So, the total number of strings is 3*2*9=54.
 
Physics news on Phys.org
Because with that reasoning you can place your first 4 in position 1 and your second 4 in position 2 and let the remaining digit be, say, 5, giving 445, but you can also place your first 4 in position 2, your second 4 in position 1, giving you... 445. So your approach counts the same solution twice, because it's taking into account order of the 4's when that order doesn't matter. Hence the number of solutions is actually 54/2 = 27.
 
Alexmahone said:
How many strings of three decimal digits have exactly two digits that are 4s?

Solution:

44x - 9 strings
4x4 - 9 strings
x44 - 9 strings
Total: 27 strings

I get that.

But what is wrong with this line of reasoning? I have two 4s with me. I have 3 positions for the first one and 2 for the second one. Then I will have a blank space that can be filled by one of 9 digits. So, the total number of strings is 3*2*9=54.

But you can't distinguish the 4's. There is no way to tell the "first four" from the "second four". You would be correct if one of the fours was red and the other four was green.

44x
44x
4x4
4x4
x44
x44

But if they are not colored then you only have three ways.
 
I'm taking a look at intuitionistic propositional logic (IPL). Basically it exclude Double Negation Elimination (DNE) from the set of axiom schemas replacing it with Ex falso quodlibet: ⊥ → p for any proposition p (including both atomic and composite propositions). In IPL, for instance, the Law of Excluded Middle (LEM) p ∨ ¬p is no longer a theorem. My question: aside from the logic formal perspective, is IPL supposed to model/address some specific "kind of world" ? Thanks.
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
Back
Top