• Support PF! Buy your school textbooks, materials and every day products Here!

Logical question (no variations, permutations or combinations)

  • #1

Homework Statement



How many contestants have on one chess tournament, if every person have played only one game with all of the other contestants separately, and there are 210 games played.

This problem should not be solved by variations, permutations or combinations. This problem should be solved by using the quadric equation. (we should put some condition, and out of there make some quadric equation).

Homework Equations




The Attempt at a Solution



I have no idea.

x- the number of players

I really don't know.
 

Answers and Replies

  • #2
103
0
The answer just popped up into my head. Don't know how to explain it :confused:

[tex] \sum^x_{N=1} N-1 = 210 [/tex] x is the number of participants
 
Last edited:
  • #3
HallsofIvy
Science Advisor
Homework Helper
41,770
911
The answer just popped up into my head. Don't know how to explain it :confused:

[tex] \sum^x_{N=1} N-1 = 210 [/tex] x is the number of participants
Then how do you know it is the answer?

If there are n contestants then, for each one, there are n- 1 "other contestants" and so each plays n-1 games. n people, each playing n-1 games, means there are n(n-1) games- except that each game involves two players: there are actually n(n-1)/2 games played. Since there were a total of 210 games, n(n-1)/2= 210.

(Which is, by the way, exactly what armis is saying!)
 
  • #4
103
0
Oh, exactly. Thanks HallsofIvy
 
  • #5
I understand. Thank you.
 

Related Threads for: Logical question (no variations, permutations or combinations)

  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
2
Views
4K
  • Last Post
Replies
12
Views
1K
Replies
3
Views
1K
Replies
3
Views
766
Top