Determine the number of its n-combinations

  • Thread starter Thread starter Jrb599
  • Start date Start date
AI Thread Summary
The discussion focuses on determining the number of n-combinations from the multiset {n*a, n*b, 1, 2, 3,..., n+1}, which has a size of 3n + 1. A participant clarifies that for n=2, the multiset contains seven elements, confirming the size as 3n + 1 rather than n + 3. This resolution leads to the conclusion that the initial confusion about the size has been addressed. The thread concludes with a question about its potential deletion, indicating a desire for clarity on the forum's practices. The topic emphasizes understanding combinations in multisets effectively.
Jrb599
Messages
24
Reaction score
0
Consider the multiset {n*a, n*b, 1, 2 , 3,..., n+1} of size 3n + 1. Determine the number of its n-combinations.

I'm stuck on this one, any help would great.
 
Physics news on Phys.org
How is its size 3n+1 and not n+3?
 
Consider the case n=2

you get

(a,a,b,b 1,2,3) which gives you 7 elements

not 5, so 3n + 1 holds.
 
PRoblem solved, will this thread be deleted?
 
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