Question

Letn>1 be an integer. Suppose there are n teams in a football league and every two teams have played against each other exact

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Base Case: n = 2
A1 and A2 are the teams. Put the winner first.

Inductive Hypothesis: n = k
Assume that it works and all the k teams which are ordered 1, 2, ... k-1

Induction Case: Proving for n = k + 1

3 parts are there: New team is X
X beats the first team, then put the X at first
X lost to the last team, then put the X at last
X lost to team M that belongs to {1, 2, 3, ... k-1}. Then put the X after M.

So, in any of the cases, we can still arrange them.

Hence Proved

--------------------------------------
Hit the thumbs up if you are fine with the answer. Happy Learning!

Add a comment
Know the answer?
Add Answer to:
Letn>1 be an integer. Suppose there are n teams in a football league and every two teams have played against each other exactly once with no ties. Prove that it is possible to number the teams 1 t...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT