Twenty golfers wish to play in foursomes for five days. Let the golfers be denoted with the letters A-T. The social golfer problem asks if it is possible for each golfer to play no more than once with any other golfer.

Mon | ABCD | EFGH | IJKL | MNOP | QRST Tue | AEIM | BJOQ | CHNT | DGLS | FKPR Wed | AGKO | BIPT | CFMS | DHJR | ELNQ Thu | AHLP | BKNS | CEOR | DFIQ | GJMT Fri | AFJN | BLMR | CGPQ | DEKT | HIOS

status | proved

Mon | ABCD | EFGH | IJKL | MNOP | QRST Tue | AEIM | BJOQ | CHNT | DGLS | FKPR Wed | AGKO | BIPT | CFMS | DHJR | ELNQ Thu | AHLP | BKNS | CEOR | DFIQ | GJMT Fri | AFJN | BLMR | CGPQ | DEKT | HIOS

mathematical problems | solved mathematics problems