Knowledge

Transylvania lottery

Source 📝

235: 17: 135:
At least two of the three randomly chosen numbers must be in one Fano plane set, and any two points on a Fano plane are on a line, so there will be a ticket in the collection containing those two numbers. There is a (6/13)*(5/12)=5/26 chance that all three randomly chosen numbers are in the same Fano
32:
where players selected three numbers from 1-14 for each ticket, and then three numbers are chosen randomly. A ticket wins if two of the numbers match the random ones. The problem asks how many tickets the player must buy in order to be certain of winning. (Javier Martínez, Gloria
136:
plane set. In this case, there is a 1/5 chance that they are on a line, and hence all three numbers are on one ticket, otherwise each of the three pairs are on three different tickets.
166:
Martínez, Javier; Gutiérrez, Gloria; Cordero, Pablo; Rodríguez, Francisco J.; Merino, Salvador (2008), "Algebraic topics on discrete mathematics", in Moore, Kenneth B. (ed.),
48:
with a collection of 14 tickets in two sets of seven. Each set of seven uses every line of a Fano plane, labelled with the numbers 1 to 7, and 8 to 14.
276: 209: 177: 201: 300: 269: 295: 262: 148: 205: 195: 173: 167: 153: 219: 187: 215: 183: 246: 289: 242: 234: 16: 45: 29: 15: 34: 250: 33:
Gutiérrez & Pablo Cordero et al. 
172:, Hauppauge, NY: Nova Sci. Publ., pp. 41–90, 270: 8: 277: 263: 50: 169:Discrete mathematics research progress 44:An upper bound can be given using the 38: 7: 231: 229: 202:Mathematical Association of America 24:In mathematical combinatorics, the 20:The Fano plane with points labelled 14: 233: 1: 249:. You can help Knowledge by 317: 228: 194:Mazur, David R. (2010), 245:-related article is a 21: 19: 149:Combinatorial design 41:, p.280 problem 15) 26:Transylvania lottery 301:Combinatorics stubs 22: 258: 257: 211:978-0-88385-762-5 200:, MAA Textbooks, 179:978-1-60456-123-4 133: 132: 308: 279: 272: 265: 237: 230: 222: 190: 154:Lottery Wheeling 129: 124: 119: 114: 109: 104: 99: 89: 84: 79: 74: 69: 64: 59: 51: 316: 315: 311: 310: 309: 307: 306: 305: 286: 285: 284: 283: 226: 212: 193: 180: 165: 162: 145: 139: 127: 122: 117: 112: 107: 102: 97: 87: 82: 77: 72: 67: 62: 57: 12: 11: 5: 314: 312: 304: 303: 298: 288: 287: 282: 281: 274: 267: 259: 256: 255: 238: 224: 223: 210: 191: 178: 161: 158: 157: 156: 151: 144: 141: 131: 130: 125: 120: 115: 110: 105: 100: 95: 91: 90: 85: 80: 75: 70: 65: 60: 55: 37:, p.85)( 13: 10: 9: 6: 4: 3: 2: 313: 302: 299: 297: 296:Combinatorics 294: 293: 291: 280: 275: 273: 268: 266: 261: 260: 254: 252: 248: 244: 243:combinatorics 239: 236: 232: 227: 221: 217: 213: 207: 203: 199: 198: 197:Combinatorics 192: 189: 185: 181: 175: 171: 170: 164: 163: 159: 155: 152: 150: 147: 146: 142: 140: 137: 126: 121: 116: 111: 106: 101: 96: 93: 92: 86: 81: 76: 71: 66: 61: 56: 53: 52: 49: 47: 42: 40: 36: 31: 27: 18: 251:expanding it 240: 225: 196: 168: 138: 134: 43: 25: 23: 290:Categories 160:References 46:Fano plane 39:Mazur 2010 94:High set 143:See also 128:12-13-14 123:10-11-12 54:Low set 220:2572113 188:2446219 118:9-11-13 113:9-10-14 108:8-11-14 103:8-10-13 30:lottery 218:  208:  186:  176:  98:8-9-12 241:This 88:5-6-7 83:3-4-5 78:2-4-6 73:2-3-7 68:1-4-7 63:1-3-6 58:1-2-5 28:is a 247:stub 206:ISBN 174:ISBN 35:2008 292:: 216:MR 214:, 204:, 184:MR 182:, 278:e 271:t 264:v 253:.

Index


lottery
2008
Mazur 2010
Fano plane
Combinatorial design
Lottery Wheeling
Discrete mathematics research progress
ISBN
978-1-60456-123-4
MR
2446219
Combinatorics
Mathematical Association of America
ISBN
978-0-88385-762-5
MR
2572113
Stub icon
combinatorics
stub
expanding it
v
t
e
Categories
Combinatorics
Combinatorics stubs

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.