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 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