Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 Re: Help Me ! » Permutations - I think » 2012-02-26 12:21:25

Bobbym, you could knock me down with a feather. I've just looked at the first link. I knew a guy years ago and he got a first in combined maths and astronomy. (around 1985) He told me he discovered something in maths. He told me it was to do with the Steiner Triple Series. I'd never heard of it, but he told me that in the Steiner Triple Series certain patterns were never supposed to repeat and he wrote a computer programme which showed they did. You can imagine 25 years on it was an amazing coincidence to come across this mysterious sounding maths jargon.
I shall read on with relish.
Thanks again

#2 Re: Help Me ! » Permutations - I think » 2012-02-26 12:04:30

Well thanks bobbym. I'll go and have a look at the links. It's strange that my mate is both big at golf and has worked in computers all his life. I hope I don't sound ungrateful, but I'm sure someone had to write the computer programme that solves the problem. So they must have had some idea how to solve it. For example could someone compute the odds of the second round where no two people from round 1 were in the same team and so on. I'm not ungrateful, it's just hard to believe that there isn't a numerical technique that is the equivalent of arranging 24 tiles so that they obeyed some rules.

Anyway thanks again. I'll write after I've looked at the links.

#3 Re: Help Me ! » Permutations - I think » 2012-02-25 03:24:39

What a pleasant surprise receiving your reply (and so quickly)

I would love to see the links that would show me how it's done. Is there any underlying mathematical techniques. Surely it's not just trial and error/exhaustion.

thanks

#4 Help Me ! » Permutations - I think » 2012-02-24 08:04:02

SlinkyFinky
Replies: 6

A friend was organising a quiz party for his mates. There were 24 people participating and to avoid over competitiveness he arranged each round so that each team had different players. No 2 players were ever in the same team. He planned 4 rounds with either 6 teams of 4, or 4 teams of 6. He figured it all out by constructing matrices. I would like to how to solve this mathematically. X players Y teams Z rounds no 2 players ever in same team.

Also if say some number other that 24 turned up how could he adjust the size of teams and number of rounds to accommodate?

How? Pleased if you can help

Board footer

Powered by FluxBB