Solved: Proving Distributions of Musicians w/ Induction

  • Thread starter Thread starter rsa58
  • Start date Start date
  • Tags Tags
    Induction
Click For Summary
SUMMARY

The discussion focuses on proving the distribution of musicians among orchestras using mathematical induction. The problem states that given natural numbers k, n, and k1 through kn, where the sum of ki equals k, the number of distinct distributions is calculated as k!/(k1! · · · kn!). The user seeks guidance on applying induction to show the validity of this formula for n+1, after successfully proving it for n using combinatorial methods. The professor's suggestion to check base cases for n=1 and n=2 is emphasized as a necessary step in the induction process.

PREREQUISITES
  • Understanding of combinatorial mathematics, specifically the multinomial coefficient.
  • Familiarity with mathematical induction principles and techniques.
  • Knowledge of factorial notation and its properties.
  • Basic concepts of set theory related to distributions and selections.
NEXT STEPS
  • Study the principles of mathematical induction in depth, focusing on base cases and inductive steps.
  • Learn about the multinomial theorem and its applications in combinatorial proofs.
  • Explore examples of induction proofs in combinatorial contexts to solidify understanding.
  • Investigate the relationship between combinatorial functions and factorial expressions in distributions.
USEFUL FOR

Mathematics students, educators, and anyone interested in combinatorial proofs and the application of induction in mathematical reasoning.

rsa58
Messages
83
Reaction score
0
[SOLVED] induction? question

Homework Statement



the question is:
let k, n, and k1, . . . , kn be given natural numbers, such that
k1 + . . . + kn = k.
Assume that k musicians shall be distributed to n orchestras such that exactly
ki musicians play in the ith orchestra. Prove that there exist exactly
k!/(k1! · · · kn!)
different distributions.

is it possible to use induction to answer this? i can prove it by using the choose function to find all the possible distributions. in that way i get a proof for the statement, but i am unable to assume that it is correct for n, and then show it is correct for n+1. can someone give me some ideas?


Homework Equations





The Attempt at a Solution

 
Physics news on Phys.org
in that way i get a proof for the statement
Why do you need induction if you have a proof without it?
 
because the professor said something about induction. he said to "select from a pool" (of k's i guess, whatever that means) and then use induction over n. he said to check for n=1 and n=2 and show that the statement holds for n>= 2. he does seem kind of out of it though. to use induction how would i proceed? i need to combine some expression with
k!/(k1! · · · kn!)

right? i can't find this expression. the only sort of induction i can get is a logically inherent one using the choose function.
 

Similar threads

Replies
5
Views
2K
Replies
6
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
1
Views
2K