Seven Bison finish in top six at Kaufman-Brand Open

[AmberValley]

Seven Bison finish in top six at Kaufman-Brand Open
November 21, 2009

OMAHA, Neb. - North Dakota State redshirt freshman Will Johnson won the 197 pound title in the amateur division at the Kaufman-Brand Open on Saturday, Nov. 21. Johnson was one of seven Bison to place in the top six in Omaha.

Johnson opened with a pin of Truman State's Max Muench and then won a 10-6 decision over Justin Rau of Grand Valley in the quarterfinals. He advanced to the final with an 11-5 decision over Steven Kyler of Fort Hays State. Johnson pinned Nebraska-Kearney's Justin McKain in 2 minutes and 13 seconds to win his first open tournament as a Bison.

In the elite division, sophomore Trent Sprenkle finished third at 125 pounds, while senior Ryan Adams came in third at 141 pounds in his first meet in a lower weight class. Sophomore Tyler Johnson had his seven match win streak snapped, but bounced back for a third place finish at 165 pounds. Junior Vince Salminen was sixth at 157 pounds.

Redshirt freshman Mark Erickson placed third at 141 pounds and freshman Steven Monk was fifth at 149 pounds in the amateur division.

The Bison now head to Moorhead, Minn. for the Dragon Open on Saturday, Dec. 5. The meet is scheduled to begin at 9 a.m.

NDSU Wrestlers – Elite Division
125 – Justin Solberg, DNP, 2-2
125 – Trent Sprenkle, 3rd, 5-1
141 – Ryan Adams, 3rd, 4-1
141 – Geoff Martin, DNP, 0-2
149 – Andrey Patselov, DNP, 1-2
157 – Vince Salminen, 6th, 2-3
165 – Tyler Johnson, 3rd, 5-1
174 – Mac Stoll, DNP, 2-2
184 – Kenny Moenkedick, DNP, 1-2
197 – Drew Ross, 0-2

NDSU Wrestlers – Amateur Division
125 – Phil Levine, DNP, 0-2
141 – Mark Erickson, 3rd, 5-1
149 – Brian Ham, DNP, 1-2
149 – Steven Monk, 5th, 5-2
149 – Nash Hallfrisch, DNP, 0-2
157 – Jordan Engen, DNP, 1-2
157 – Jake Hagen, DNP, 0-2
157 – Tyler Wells, DNP, 3-2
197 – Will Johnson, 1st, 4-0
Hwt – Joe Arthur, DNP, 2-2

[Tatanka]

OK, I get it now, but did any of the other closet mathmeticians out there instantly think of the pigeonhole principle when reading the thread title?

:hide:

[onbison09]

How much of a chance does Adams have to qualify for the NCAAs?

[ndsubison1]

OK, I get it now, but did any of the other closet mathmeticians out there instantly think of the pigeonhole principle when reading the thread title?

:hide:

what?

http://thumbs.dreamstime.com/thumb_25/1129195652gU6f54.jpg

[roadwarrior]

How much of a chance does Adams have to qualify for the NCAAs?

Bucky says he hopes 3 or 4 qualify for the NCAA this season. He did not mention any names.

[Tatanka]

what?

http://thumbs.dreamstime.com/thumb_25/1129195652gU6f54.jpg

Think Discrete Mathematics. "Seven Players finish in teh Top Six"? nothing?

...

Oh, the hell with it. I'm going Wikipedia on your punk asses:

http://en.wikipedia.org/wiki/Pigeonhole_principle


In mathematics and computer science, the pigeonhole principle, also known as Dirichlet's box (or drawer) principle, states that if n items are put into m pigeonholes with n > m, then at least one pigeonhole must contain more than one item. More formally, it states that there does not exist an injective function on finite sets whose codomain is smaller than its domain. The theorem is exemplified in real-life by such truisms as that there must be at least two males or two females in a group of three people.

The pigeonhole principle is an example of a counting argument which can be applied to many formal problems, including ones involving infinite sets that cannot be put into one-to-one correspondence. In Diophantine approximation the quantitative application of the principle to the existence of integer solutions of a system of linear equations goes under the name of Siegel's lemma.

The first statement of the principle is believed to have been made by Dirichlet in 1834 under the name Schubfachprinzip ("drawer principle" or "shelf principle"). In Italian too, the original name "principio dei cassetti" is still in use; in some other languages (for example, Russian) this principle is called the Dirichlet principle (not to be confused with the minimum principle for harmonic functions of the same name).

An introductory example of the pigeonhole principle is to imagine five people who want to play softball (n = 5 items), with a limitation of only four softball teams (m = 4 holes) to choose from. A further limitation is imposed in the form of each of the five refusing to play on a team with any of the other four players. It is impossible to divide five people among four teams without putting two of the people on the same team, and since they refuse to play on the same team, by asserting the pigeonhole principle it is easily deducible that at most four of the five possible players will be able to play.

Assuming that in a box there are 10 black socks and 12 blue socks, calculating the maximum number of socks needed to be drawn from the box before a pair of the same colour can be made can be considered a further example. Using the pigeonhole principle, to have at least one pair of the same colour (m = 2 holes, one per colour) using one pigeonhole per colour, you need only three socks (n = 3 items). In this example, if the first and second sock drawn are not of the same colour, the very next sock drawn would complete at least one same-colour pair. (m = 2)

If there are n of people who can shake hands with one another (where n > 1), the pigeonhole principle shows that there is always a pair of people who will shake hands with the same number of people. As the 'holes', or m, correspond to number of hands shaken, and each person can shake hands with anybody from 0 to n − 1 other people, this creates n − 1 possible holes. This is because either the '0' or the 'n − 1' hole must be empty (if one person shakes hands with everybody, it's not possible to have another person who shakes hands with nobody; likewise, if one person shakes hands with no one there cannot be a person who shakes hands with everybody). This leaves n people to be placed in at most n − 1 non-empty holes, guaranteeing duplication.

Although the pigeonhole principle may seem to be intuitive, it can be used to demonstrate possibly unexpected results, for example, that there must be at least two people in London with the same number of hairs on their heads. A typical head of hair has around 150,000 hairs, therefore meaning that it is reasonable to assume that no one has more than 1,000,000 hairs on their head (m = 1 million holes). Since there are more than 1,000,000 people in London (n is bigger than 1 million items), if we assign a pigeonhole for each number of hairs on a person's head, and assign people to the pigeonhole with their number of hairs on it, there must be at least two people with the same number of hairs on their heads (or, n > m).

The pigeonhole principle often arises in computer science. For example, collisions are inevitable in a hash table because the number of possible keys exceeds the number of indices in the array. No hashing algorithm, no matter how clever, can avoid these collisions. This principle also proves that any general-purpose lossless compression algorithm that makes at least one input file smaller will make some other input file larger. (Otherwise, two files would be compressed to the same smaller file and restoring them would be ambiguous.)


</GeekyShitFromTatanka>

[ndsubison1]

Think Discrete Mathematics. "Seven Players finish in teh Top Six"? nothing?

...

Oh, the hell with it. I'm going Wikipedia on your punk asses:

http://en.wikipedia.org/wiki/Pigeonhole_principle



</GeekyShitFromTatanka>

oh now i get it... lol i didnt catch that :rofl: