В а-файле тоже приведена оценка
, но никаких ссылок на доказательство там нет.
I found that showing
required checking 7-smooth moduli up to 784; it also used an additional ("set 3") type of constraint along the lines of "no element greater than
can be divisible by 210". (It is easy to check there are no solutions less than 360150 to complete the proof.)
Set 1: 64 mod 128; 24,120 mod 144; 36,180 mod 216; 128 mod 256; 54,270 mod 324; 40,120,280,360 mod 400; 256 mod 512; 56,168,280,504,616,728 mod 784.
Set 2: 24 mod 32; 30 mod 36; 40 mod 48; 30,42,66 mod 72; 24,56 mod 80; 54 mod 81; 30,70 mod 100; 24,40,104 mod 112; 42,78,102,138 mod 180; 42,70,182 mod 196; 30,70,110,130,190 mod 200; 30,105,120,165,195,210 mod 225; 30,78,102,114,186,246 mod 252; 110,170,230,290 mod 300; 189,297 mod 324; 42,70,154,182,210,266,322,378 mod 392; 54,189,216,351 mod 405; 360 mod 432; 42,105,168,210,231,273,357,399,420 mod 441; 135,270,351,459,513,540 mod 567; 480 mod 576; 70,154,238,322,406,574 mod 588; 250,375 mod 625; 540 mod 648; 30,130,170,190,270,310,330,410,470,590,610,690 mod 700.
Set 3: 0 mod 210 > 360150; 0 mod 420 > 144060; 0 mod 480 > 245760; 0 mod 630 > 216090; 0 mod 672 > 344064.