Thread: Covering sets View Single Post
 2016-04-04, 17:35 #10 robert44444uk     Jun 2003 Oxford, UK 77E16 Posts A slightly superior result using a different algorithm, found in 80 minutes on one core. The following [mod,prime] combination, when translated with the Chines Remainder Theorem leaves just one gap at 641#, which can be covered with 647, and hence is superior to mart_r's 653# [0,2],[0,3],[0,5],[0,7],[2,11],[12,13],[8,67],[18,37],[3,23],[87,107],[22,43],[8,29],[15,31],[44,47],[49,61],[9,19],[15,17],[62,71],[170,181],[3,41],[41,53],[87,89],[48,83],[14,59],[57,227],[198,211],[35,109],[20,73],[26,103],[167,199],[57,101],[80,193],[52,97],[80,163],[67,157],[94,149],[27,79],[76,137],[71,127],[65,113],[170,349],[228,331],[18,317],[242,313],[114,311],[15,283],[95,281],[27,277],[170,271],[214,269],[47,263],[78,251],[54,241],[101,239],[10,233],[80,229],[20,223],[49,197],[95,191],[129,179],[123,173],[164,167],[12,151],[9,139],[93,131],[430,641],[356,619],[279,613],[98,607],[178,599],[513,593],[184,587],[267,577],[220,569],[135,563],[357,547],[200,523],[255,521],[238,509],[279,503],[189,499],[171,491],[165,479],[105,467],[3,463],[154,461],[184,457],[134,449],[296,443],[147,439],[105,433],[273,431],[136,409],[362,401],[195,389],[338,379],[322,373],[177,359],[276,337],[14,631],[33,617],[44,601],[21,571],[3,557],[13,541],[0,487],[69,421],[88,419],[99,397],[136,383],[140,367],[132,353],[122,347],[28,307],[256,293],[234,257] Last fiddled with by robert44444uk on 2016-04-04 at 17:37