Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Transylvania_lottery> ?p ?o. }
Showing items 1 to 46 of
46
with 100 items per page.
- Transylvania_lottery abstract "In mathematical combinatorics, the Transylvanian lottery is a lottery where three numbers between 1 and 14 are picked by the player, and three numbers are chosen randomly. The player wins if two of his numbers are among the random ones. The problem of how many tickets the player must buy in order to be certain of winning can be solved by the use of the Fano plane.(Mazur 2010, p.280 problem 15)(Javier Martínez, Gloria Gutiérrez & Pablo Cordero et al. 2008, p.85)The solution is to buy a total of 14 tickets, in two sets of seven. One set of seven is every line of a Fano plane with the numbers 1-7, the other with 8-14, i.e.:1-2-5, 1-3-6, 1-4-7, 2-3-7, 2-4-6, 3-4-5, 5-6-7, 8-9-12, 8-10-13, 8-11-14, 9-10-14, 9-11-13, 10-11-12, 12-13-14.Because at least two of the winning numbers must be either high (8-14) or low (1-7), and every high and low pair is represented by exactly one ticket, you would be guaranteed at least two correct numbers on one ticket with these 14 purchases. 21/26 of the time you will have one ticket with two numbers matched. If all three winning numbers are either high or low you would either have one ticket with all three numbers (1/26 chance of this occurring), or three different tickets that each matched two (4/26 chance).".
- Transylvania_lottery wikiPageExternalLink books?id=_uCQVCAXOJAC&pg=PA85.
- Transylvania_lottery wikiPageExternalLink books?id=yI4Jx5Obr08C&pg=PA280.
- Transylvania_lottery wikiPageID "3504251".
- Transylvania_lottery wikiPageRevisionID "588009051".
- Transylvania_lottery chapter "Algebraic topics on discrete mathematics".
- Transylvania_lottery editor1First "Kenneth B.".
- Transylvania_lottery editor1Last "Moore".
- Transylvania_lottery first "Francisco J.".
- Transylvania_lottery first "Gloria".
- Transylvania_lottery first "Javier".
- Transylvania_lottery first "Pablo".
- Transylvania_lottery first "Salvador".
- Transylvania_lottery hasPhotoCollection Transylvania_lottery.
- Transylvania_lottery isbn "978".
- Transylvania_lottery last "Cordero".
- Transylvania_lottery last "Gutiérrez".
- Transylvania_lottery last "Martínez".
- Transylvania_lottery last "Merino".
- Transylvania_lottery last "Rodríguez".
- Transylvania_lottery loc "p.85".
- Transylvania_lottery location "Hauppauge, NY".
- Transylvania_lottery pages "41".
- Transylvania_lottery publisher "Nova Sci. Publ.".
- Transylvania_lottery title "Discrete mathematics research progress".
- Transylvania_lottery url books?id=_uCQVCAXOJAC&pg=PA85.
- Transylvania_lottery year "2008".
- Transylvania_lottery subject Category:Combinatorics.
- Transylvania_lottery type Abstraction100002137.
- Transylvania_lottery type Accident107300960.
- Transylvania_lottery type Event100029378.
- Transylvania_lottery type Happening107283608.
- Transylvania_lottery type Lotteries.
- Transylvania_lottery type Lottery107317144.
- Transylvania_lottery type PsychologicalFeature100023100.
- Transylvania_lottery type YagoPermanentlyLocatedEntity.
- Transylvania_lottery comment "In mathematical combinatorics, the Transylvanian lottery is a lottery where three numbers between 1 and 14 are picked by the player, and three numbers are chosen randomly. The player wins if two of his numbers are among the random ones. The problem of how many tickets the player must buy in order to be certain of winning can be solved by the use of the Fano plane.(Mazur 2010, p.280 problem 15)(Javier Martínez, Gloria Gutiérrez & Pablo Cordero et al.".
- Transylvania_lottery label "Lotería de Transilvania".
- Transylvania_lottery label "Transylvania lottery".
- Transylvania_lottery sameAs Lotería_de_Transilvania.
- Transylvania_lottery sameAs m.09h3m8.
- Transylvania_lottery sameAs Q7835490.
- Transylvania_lottery sameAs Q7835490.
- Transylvania_lottery sameAs Transylvania_lottery.
- Transylvania_lottery wasDerivedFrom Transylvania_lottery?oldid=588009051.
- Transylvania_lottery isPrimaryTopicOf Transylvania_lottery.