Jun 15, 2025
Оfftopic Community
Оfftopic Community
Forums
New posts
Search forums
What's new
Featured content
New posts
New media
New media comments
New resources
New profile posts
Latest activity
Media
New media
New comments
Search media
Resources
Latest reviews
Search resources
Members
Current visitors
New profile posts
Search profile posts
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
OffTopic Community
Introductions
Consider a track meet with k^n contestants. In each round, the remaining...
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
<blockquote data-quote="IceM1" data-source="post: 2388489" data-attributes="member: 822155"><p>...contestants are placed in groups of..? Consider a track meet with k^n contestants. In each round, the remaining contestants are placed in groups of size k. The winner in each group advances to the next round.</p><p>a) Use this to give another combinatorial proof that k-1 divides k^n-1.</p><p>b) How many races are run in the entire competition?</p></blockquote><p></p>
[QUOTE="IceM1, post: 2388489, member: 822155"] ...contestants are placed in groups of..? Consider a track meet with k^n contestants. In each round, the remaining contestants are placed in groups of size k. The winner in each group advances to the next round. a) Use this to give another combinatorial proof that k-1 divides k^n-1. b) How many races are run in the entire competition? [/QUOTE]
Insert quotes…
Name
Verification
Please enable JavaScript to continue.
Loading…
Post reply
Top