Пентадекатлон мечты

[Huz]

Timings for b1619 with -W:

-p4e7: 109598s (30.5h)
-p1e7 -W5e6: 39131s (10.9h)
-p1e7 -W1e6: 21816s (6.1h)
-p1e7 -W5e5: 19376s (5.4h)

My guess is that it would be optimal around -W4e5, since with -W5e5 it took about 30m more for the initial stage compared with -W1e6. But the cost rises very steeply if you take it too low, so -W5e5 is probably a safer bet for the general case.

The difference between -p1e7 and -p2e7 also becomes very small with -W, so when the new version is available I recommend something like "-p2e7 -W4e5 -g10" to avoid relying on improvements in Z: it has just passed 2e7, and I now think it is entirely possible we can complete D(12,11) before reaching 1e7.

EUgeneUS в сообщении #1572178 писал(а):

Huz
Well.
And what are the forecasts for the release of the new version?

The release is available at v20221201, I hope to have a Windows build later today.

Цитата:

Huz в сообщении #1572079 писал(а):

Unfortunately that means I cannot verify the logic using this data, I'll need to think of something else.

I can suggest this way:
1. Let's by using -W we reduce the prime threshold from 1e7 to 1e6
2. Let's choose some prime number in this range.
3. Let's display the sets of candidates that were processed with the -W switch and in the "usual way"
4. and compare them

This is roughly what I did, as well as a lot of single-stepping through the code. I also showed that it could correctly find a solution (by temporarily removing the $p^5$ limit).

[EUgeneUS]

Huz в сообщении #1572181 писал(а):

The release is available at v20221201
, I hope to have a Windows build later today.

Wonderful!

Huz в сообщении #1572181 писал(а):

and I now think it is entirely possible we can complete D(12,11) before reaching 1e7.

If the expected time to reach 1e7 is December 9, then it's easier to wait than to recalculate, IMHO.

[Huz]

EUgeneUS в сообщении #1572186 писал(а):

If the expected time to reach 1e7 is December 9, then it's easier to wait than to recalculate, IMHO.

For affected batches, I can run "-p2e7 -W1e7" just through the first stage, that can be done quickly.

-- 01.12.2022, 16:20 --

Huz в сообщении #1572181 писал(а):

The release is available at v20221201, I hope to have a Windows build later today.

The Windows build is now available - thanks, DemIS.

With this build, I recommend parameters "-p2e7 -W5e5 -g10", but feel free to experiment: it is possible that slightly different parameters will be more optimal. The minimum value for -W is $(\max/2)^{1/5}-1$ which is 21817 for current $D(12,11)$ limit, and the program will check for this.

Note that for a run that has already started it is safe to continue with different "-g", or reduced "-p", or increased "-W". It is not safe to add -W to a run that was started without it (but the program does not check for that).

During the first stage, progress lines will show something like "W(p, i")" when it is allocating $p^2$ in position $i$ (counting from 0):

3 2^2.5 11 2.3^2 7 2^5 3.5^2 2 . 2^2.3 . W(6021319,0): 66 / 245

It should be fine to continue an interrupted run with the same parameters, whether it was in the first or second stage.

[Huz]

There is a problem with the new release when recovering a run that is still in stage one.

I have a fix but clearly it needs more testing, I will try to complete it tomorrow.

If you need to restart a process that has "W(...)" in the last progress line, for now it is probably best to run the process again from the start.

[EUgeneUS]

По текущему прогрессу.
Если к информации на странице с результатами добавить мои результаты, которые вышлю через несколько часов, то таки экватор мы перевалили (в условных машино-часах, как обычно). С чем всех и поздравляю.

[Huz]

Huz в сообщении #1572216 писал(а):

There is a problem with the new release when recovering a run that is still in stage one.

This should now be fixed with a new release: v20221202.

[Huz]

I added an option (-WW) to check only the first stage, and completed all patterns originally run with "-p1e7" by running them a second time with "-p18e6 -WW1e7". These 109 batches took 2726.52s to complete, the slowest (b1952) taking 163.24s.

I'm still running sq12 for now to continue reducing the threshold, but I am tempted to switch it over soon to work on the $D(12,12)$ threshold instead.

[Yadryara]

Huz в сообщении #1572381 писал(а):

I added an option (-WW) to check only the first stage, and completed all patterns originally run with "-p1e7" by running them a second time with "-p18e6 -WW1e7". These 109 batches took 2726.52s to complete, the slowest (b1952) taking 163.24s.

Что за "109 batches"?

https://github.com/hvds/divrep/wiki/D(12,11) писал(а):

The following batches were tested with a maximum prime of 1e7, and additional primes in the range 1e7 to 1.8e7 were checked separately:

b203-b206, b514-b516, b519, b539, b585, b607-b615, b621-b630, b640, b642-b645, b647-b649, b1474-b1499, b1848-b1849, b1853, b1873, b1875, b1878, b1881, b1883, b1905, b1917, b1919-b1924, b1952-b1953, b1955-b1958, b1961-b1963, b1967, b1969-b1971, b1974, b1978, b1992, b1995, b2017, b2036-b2038, b2076, b2089, b2095, b2102, b2105, b2107, b2146, b2148, b2154

Имеются в виду не только эти паттерны?

$4+3+1+1+1+9+10+1+4+3+6+2+1+1+1+1+1+1+1+1+6+2+4+3+1+3+1+1+1+1+1+3+1+1+1+1+1+1+1+1+1=89$

[Huz]

Yadryara в сообщении #1572401 писал(а):

Имеются в виду не только эти паттерны?

I think you miscounted b1474-b1499.

[Yadryara]

Объединённая таблица по данным на сегодня.

$\tikz[scale=.08]{ \fill[green!90!blue!50] (110,160) rectangle (125,210); \fill[green!90!blue!50] (85,170) rectangle (95,180); \fill[green!90!blue!50] (0,140) rectangle (140,170); \fill[green!70!blue!80] (0,120) rectangle (140,140); \draw (0,210) rectangle (10,220); \draw (10,210) rectangle (45,220); \draw (45,210) rectangle (55,220); \draw (55,210) rectangle (65,220); \draw (65,210) rectangle (75,220); \draw (75,210) rectangle (85,220); \draw (85,210) rectangle (95,220); \draw (95,210) rectangle (110,220); \draw (110,210) rectangle (125,220); \draw (125,210) rectangle (140,220); \draw (0,200) rectangle (10,210); \draw (10,200) rectangle (45,210); \draw (45,200) rectangle (55,210); \draw (55,200) rectangle (65,210); \draw (65,200) rectangle (75,210); \draw (75,200) rectangle (85,210); \draw (85,200) rectangle (95,210); \draw (95,200) rectangle (110,210); \draw (110,200) rectangle (125,210); \draw (125,200) rectangle (140,210); \draw (0,190) rectangle (10,200); \draw (10,190) rectangle (45,200); \draw (45,190) rectangle (55,200); \draw (55,190) rectangle (65,200); \draw (65,190) rectangle (75,200); \draw (75,190) rectangle (85,200); \draw (85,190) rectangle (95,200); \draw (95,190) rectangle (110,200); \draw (110,190) rectangle (125,200); \draw (125,190) rectangle (140,200); \draw (0,180) rectangle (10,190); \draw (10,180) rectangle (45,190); \draw (45,180) rectangle (55,190); \draw (55,180) rectangle (65,190); \draw (65,180) rectangle (75,190); \draw (75,180) rectangle (85,190); \draw (85,180) rectangle (95,190); \draw (95,180) rectangle (110,190); \draw (110,180) rectangle (125,190); \draw (125,180) rectangle (140,190); \draw (0,170) rectangle (10,180); \draw (10,170) rectangle (45,180); \draw (45,170) rectangle (55,180); \draw (55,170) rectangle (65,180); \draw (65,170) rectangle (75,180); \draw (75,170) rectangle (85,180); \draw (85,170) rectangle (95,180); \draw (95,170) rectangle (110,180); \draw (110,170) rectangle (125,180); \draw (125,170) rectangle (140,180); \draw (0,160) rectangle (10,170); \draw (10,160) rectangle (45,170); \draw (45,160) rectangle (55,170); \draw (55,160) rectangle (65,170); \draw (65,160) rectangle (75,170); \draw (75,160) rectangle (85,170); \draw (85,160) rectangle (95,170); \draw (95,160) rectangle (110,170); \draw (110,160) rectangle (125,170); \draw (125,160) rectangle (140,170); \draw (0,150) rectangle (10,160); \draw (10,150) rectangle (45,160); \draw (45,150) rectangle (55,160); \draw (55,150) rectangle (65,160); \draw (65,150) rectangle (75,160); \draw (75,150) rectangle (85,160); \draw (85,150) rectangle (95,160); \draw (95,150) rectangle (110,160); \draw (110,150) rectangle (125,160); \draw (125,150) rectangle (140,160); \draw (0,140) rectangle (10,150); \draw (10,140) rectangle (45,150); \draw (45,140) rectangle (55,150); \draw (55,140) rectangle (65,150); \draw (65,140) rectangle (75,150); \draw (75,140) rectangle (85,150); \draw (85,140) rectangle (95,150); \draw (95,140) rectangle (110,150); \draw (110,140) rectangle (125,150); \draw (125,140) rectangle (140,150); \draw (0,130) rectangle (10,140); \draw (10,130) rectangle (45,140); \draw (45,130) rectangle (55,140); \draw (55,130) rectangle (65,140); \draw (65,130) rectangle (75,140); \draw (75,130) rectangle (85,140); \draw (85,130) rectangle (95,140); \draw (95,130) rectangle (110,140); \draw (110,130) rectangle (125,140); \draw (125,130) rectangle (140,140); \draw (0,120) rectangle (10,130); \draw (10,120) rectangle (45,130); \draw (45,120) rectangle (55,130); \draw (55,120) rectangle (65,130); \draw (65,120) rectangle (75,130); \draw (75,120) rectangle (85,130); \draw (85,120) rectangle (95,130); \draw (95,120) rectangle (110,130); \draw (110,120) rectangle (125,130); \draw (125,120) rectangle (140,130); \node at (4.7,215){\text{1044}}; \node at (28,215){\text{LCM}}; \node at (50,215){\text{3}}; \node at (60,215){\text{4}}; \node at (70,215){\text{5}}; \node at (80,215){\text{6}}; \node at (90,215){\text{7}}; \node at (103,215){\text{Total}}; \node at (118,215){\text{Done}}; \node at (133,215){\text{Work}}; \node at (5.6,205){\text{1.}}; \node at (36,205){\text{554400}}; \node at (50,205){\text{8}}; \node at (60,205){\text{30}}; \node at (70,205){\text{28}}; \node at (104,205){\text{66}}; \node at (90,205){\text{}}; \node at (118,205){\text{30}}; \node at (133,205){\text{3 ?}}; \node at (5.6,195){\text{2.}}; \node at (35,195){\text{3880800}}; \node at (50,195){\text{8}}; \node at (60,195){\text{46}}; \node at (70,195){\text{60}}; \node at (80,195){\text{28}}; \node at (103,195){\text{142}}; \node at (118,195){\text{117}}; \node at (133,195){\text{5 ?}}; \node at (5.6,185){\text{3.}}; \node at (35,185){\text{6098400}}; \node at (50,185){\text{8}}; \node at (60,185){\text{46}}; \node at (70,185){\text{78}}; \node at (80,185){\text{48}}; \node at (103,185){\text{180}}; \node at (118,185){\text{112}}; \node at (133,185){\text{?}}; \node at (5.6,175){\text{4.}}; \node at (34,175){\text{42688800}}; \node at (50,175){\text{8}}; \node at (60,175){\text{54}}; \node at (70,175){\text{94}}; \node at (80,175){\text{60}}; \node at (90,175){\text{10}}; \node at (103,175){\text{226}}; \node at (118,175){\text{191}}; \node at (133,175){\text{?}}; \node at (5.6,165){\text{5.}}; \node at (32,165){\text{1331114400}}; \node at (50,165){\text{}}; \node at (60,165){\text{8}}; \node at (70,165){\text{30}}; \node at (80,165){\text{28}}; \node at (104,165){\text{66}}; \node at (118,165){\text{66}}; \node at (133,165){\text{}}; \node at (5.6,155){\text{6.}}; \node at (32,155){\text{8116970400}}; \node at (50,155){\text{}}; \node at (60,155){\text{8}}; \node at (70,155){\text{26}}; \node at (80,155){\text{24}}; \node at (104,155){\text{58}}; \node at (118,155){\text{58}}; \node at (133,155){\text{}}; \node at (5.6,145){\text{7.}}; \node at (31,145){\text{14642258400}}; \node at (60,145){\text{8}}; \node at (70,145){\text{42}}; \node at (80,145){\text{66}}; \node at (90,145){\text{36}}; \node at (103,145){\text{152}}; \node at (118,145){\text{152}}; \node at (133,145){\text{}}; \node at (5.6,135){\text{8.}}; \node at (31,135){\text{56818792800}}; \node at (60,135){\text{8}}; \node at (70,135){\text{38}}; \node at (80,135){\text{40}}; \node at (90,135){\text{10}}; \node at (104,135){\text{96}}; \node at (118,135){\text{96}}; \node at (5.6,125){\text{9.}}; \node at (28,125){\text{19488845930400}}; \node at (70,125){\text{8}}; \node at (80,125){\text{26}}; \node at (90,125){\text{24}}; \node at (104,125){\text{58}}; \node at (118,125){\text{58}}; }$

Всего полностью обсчитаны хотя бы однократно $ 30 + 117 + 112 + 191 + 66 + 58 + 152 + 96 + 58 = 880 $ паттернов из $1044$ основных. Количество таких паттернов возросло на 291 по сравнению с предыдущей таблицей.

Ну и теперь конечно показываю только белые пятна, то есть не полностью
обсчитанные паттерны:

(554400-36(66))

 1. b34   : LCM554400-119641-4
 2. b39   : LCM554400-270841-4
 3. b78   : LCM554400-434745-4
 4. b85   : LCM554400-31545-4
 5. b166  : LCM554400-153369-4    w
 6. b171  : LCM554400-304569-4    w
 7. b176  : LCM554400-405369-4    w
 8. b208  : LCM554400-174969-4
 9. b214  : LCM554400-326169-4
10. b250  : LCM554400-307737-4
11. b254  : LCM554400-408537-4
12. b293  : LCM554400-473337-4
13. b298  : LCM554400-372537-4
14. b1108 : LCM554400-283545-6
15. b1113 : LCM554400-434745-6
16. b1154 : LCM554400-175545-6
17. b1158 : LCM554400-74745-6
18. b1194 : LCM554400-102969-6
19. b1198 : LCM554400-153369-6
20. b1502 : LCM554400-401017-7
21. b1515 : LCM554400-119641-7
22. b1539 : LCM554400-479641-7
23. b1545 : LCM554400-378841-7
24. b1872 : LCM554400-434745-8
25. b1907 : LCM554400-145849-8
26. b1911 : LCM554400-246649-8
27. b1944 : LCM554400-181849-8
28. b2023 : LCM554400-379417-8
29. b2027 : LCM554400-480217-8
30. b2055 : LCM554400-149017-8
31. b2060 : LCM554400-249817-8
32. b2065 : LCM554400-401017-8
33. b2078 : LCM554400-522841-8
34. b2084 : LCM554400-119641-8
35. b2127 : LCM554400-126841-8
36. b2130 : LCM554400-479641-8

(3880800-25(142))

 1. b51   : LCM3880800-3660345-4    w
 2. b55   : LCM3880800-1543545-4    w
 3. b62   : LCM3880800-2249145-4    w
 4. b88   : LCM3880800-729945-4     w
 5. b90   : LCM3880800-2493945-4    w
 6. b92   : LCM3880800-2846745-4
 7. b97   : LCM3880800-3199545-4
 8. b223  : LCM3880800-710937-4
 9. b229  : LCM3880800-1416537-4
10. b233  : LCM3880800-3180537-4
11. b257  : LCM3880800-1661337-4
12. b262  : LCM3880800-2366937-4
13. b263  : LCM3880800-3778137-4
14. b267  : LCM3880800-250137-4
15. b270  : LCM3880800-2136537-4
16. b274  : LCM3880800-2842137-4
17. b275  : LCM3880800-372537-4
18. b279  : LCM3880800-725337-4
19. b1520 : LCM3880800-1034041-7
20. b1522 : LCM3880800-1386841-7
21. b1557 : LCM3880800-2337241-7
22. b1559 : LCM3880800-220441-7
23. b1589 : LCM3880800-125145-7
24. b1592 : LCM3880800-2947545-7
25. b1596 : LCM3880800-1183545-7

(6098400-68(180))

 1. b209  : LCM6098400-5214969-4
 2. b210  : LCM6098400-830169-4
 3. b211  : LCM6098400-1686969-4
 4. b212  : LCM6098400-2543769-4
 5. b244  : LCM6098400-2374137-4
 6. b245  : LCM6098400-3230937-4
 7. b246  : LCM6098400-4087737-4
 8. b247  : LCM6098400-5801337-4
 9. b248  : LCM6098400-1416537-4
10. b251  : LCM6098400-3130137-4
11. b252  : LCM6098400-4843737-4
12. b291  : LCM6098400-3245337-4
13. b294  : LCM6098400-4102137-4
14. b295  : LCM6098400-4958937-4
15. b296  : LCM6098400-574137-4
16. b297  : LCM6098400-2287737-4
17. b299  : LCM6098400-4001337-4
18. b1109 : LCM6098400-3105945-6
19. b1110 : LCM6098400-4819545-6
20. b1114 : LCM6098400-2148345-6
21. b1115 : LCM6098400-3861945-6
22. b1152 : LCM6098400-5719545-6
23. b1155 : LCM6098400-1334745-6
24. b1159 : LCM6098400-377145-6
25. b1199 : LCM6098400-2673369-6
26. b1510 : LCM6098400-1379641-7
27. b1511 : LCM6098400-2236441-7
28. b1512 : LCM6098400-3950041-7
29. b1513 : LCM6098400-5663641-7
30. b1516 : LCM6098400-1278841-7
31. b1517 : LCM6098400-2992441-7
32. b1540 : LCM6098400-1336441-7
33. b1541 : LCM6098400-3050041-7
34. b1542 : LCM6098400-4763641-7
35. b1543 : LCM6098400-378841-7
36. b1868 : LCM6098400-3105945-8
37. b1869 : LCM6098400-4819545-8
38. b1870 : LCM6098400-434745-8
39. b1908 : LCM6098400-2968249-8
40. b1909 : LCM6098400-4681849-8
41. b1912 : LCM6098400-297049-8
42. b1945 : LCM6098400-3810649-8
43. b1947 : LCM6098400-5524249-8
44. b1948 : LCM6098400-1139449-8
45. b1949 : LCM6098400-1996249-8
46. b2019 : LCM6098400-5268217-8
47. b2021 : LCM6098400-2597017-8
48. b2024 : LCM6098400-5167417-8
49. b2025 : LCM6098400-6024217-8
50. b2056 : LCM6098400-2669017-8
51. b2057 : LCM6098400-3525817-8
52. b2058 : LCM6098400-5239417-8
53. b2061 : LCM6098400-854617-8
54. b2062 : LCM6098400-3425017-8
55. b2063 : LCM6098400-4281817-8
56. b2076 : LCM6098400-522841-8
57. b2079 : LCM6098400-1379641-8
58. b2080 : LCM6098400-2236441-8
59. b2081 : LCM6098400-3950041-8
60. b2082 : LCM6098400-5663641-8
61. b2085 : LCM6098400-1278841-8
62. b2086 : LCM6098400-2992441-8
63. b2128 : LCM6098400-4864441-8
64. b2129 : LCM6098400-5721241-8
65. b2131 : LCM6098400-1336441-8
66. b2132 : LCM6098400-3050041-8
67. b2133 : LCM6098400-4763641-8
68. b2134 : LCM6098400-378841-8

(42688800-35(226))

 1. b224  : LCM42688800-21526137-4
 2. b225  : LCM42688800-34579737-4
 3. b226  : LCM42688800-17998137-4
 4. b227  : LCM42688800-1416537-4
 5. b230  : LCM42688800-27523737-4
 6. b231  : LCM42688800-10942137-4
 7. b255  : LCM42688800-17184537-4
 8. b258  : LCM42688800-30238137-4
 9. b259  : LCM42688800-602937-4
10. b260  : LCM42688800-10128537-4
11. b264  : LCM42688800-36235737-4
12. b265  : LCM42688800-19654137-4
13. b268  : LCM42688800-21540537-4
14. b271  : LCM42688800-34594137-4
15. b272  : LCM42688800-4958937-4
16. b273  : LCM42688800-31066137-4
17. b276  : LCM42688800-40591737-4
18. b277  : LCM42688800-24010137-4
19. b1518 : LCM42688800-29258041-7
20. b1519 : LCM42688800-42311641-7
21. b1521 : LCM42688800-25730041-7
22. b1523 : LCM42688800-35255641-7
23. b1524 : LCM42688800-18674041-7
24. b1552 : LCM42688800-37970041-7
25. b1553 : LCM42688800-8334841-7
26. b1554 : LCM42688800-34442041-7
27. b1555 : LCM42688800-17860441-7
28. b1558 : LCM42688800-1278841-7
29. b1587 : LCM42688800-4005945-7
30. b1590 : LCM42688800-30113145-7
31. b1593 : LCM42688800-13531545-7
32. b1594 : LCM42688800-39638745-7
33. b1595 : LCM42688800-23057145-7
34. b1597 : LCM42688800-18830745-7
35. b1598 : LCM42688800-31884345-7

[Yadryara]

Осталось всего 5 паттернов:

(554400-3(66))

1. b254  : LCM554400-408537-4
2. b293  : LCM554400-473337-4
3. b298  : LCM554400-372537-4

(6098400-1(180))

1. b252  : LCM6098400-4843737-4

(42688800-1(226))

1. b255  : LCM42688800-17184537-4

EUgeneUS в сообщении #1570950 писал(а):

Намедне Вы грозились сделать независимо (от результатов pcoul -a) систему паттернов.

Я не грозился, но в планах у меня это было. Теперь, когда счёт подходит к концу, самое время.

Довольно-таки неуклюжие пока проги получились, но с задачей они пока справляются.

(PARI)

pro=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1];
v2 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,1,4,1,2,1,32,1,2,1,4,1,2,1];
v3 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,3,1,1,3,1, 1,9,1,1,3,1,1,3,1,1,9,1,1,3,1,1];
kvar=0;
{for(i3=1,9,
v5=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,1,1,1,1,5,1, 1,1,1,5,1,1,1,1,25,1,1,1,1,5,1,1,1,1,5,1,1,1,1];
for(i5=1,16,
v7 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1, 1,1,49,1,1,1,1,1,1,7,1,1,1,1,1,1,7];
for(i7=1,18,
v11=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,11,1,1,1,1,1,1,1,1,1,1,121,1,1,1,1,1,1,1,1,1,1,11,1,1,1];
for(i11=1,22,
zap=0;l=25;r=35;
for(i=l,r,pro[i]=v2[i]*v3[i]*v5[i]*v7[i]*v11[i];
if(numdiv(pro[i]) >6 || numdiv(pro[i]) == 4,zap=zap+1));
if(zap == 0,
kvar=kvar+1;print();print1(kvar);
print1( " ");for(i=l,r,print1(i, " ",));print();print();
print1(" ");for(i=l,31,print1(" ",v2[i]));
print1(" ");for(i=32,r,print1(v2[i]," ",));print();print();
print1(" ");for(i=l,r,print1(" ",v3[i]));print();print();
print1(" ");for(i=l,r,print1(" ",v5[i]));print();print();
print1(" ");for(i=l,r,print1(" ",v7[i]));print();print();
print1(" ");for(i=l,r,print1(" ",v11[i]));print();print();
print1(" ");for(i=l,r,print1(" ",pro[i]));print();print();
para1=lcm(pro[l],pro[l+1]);
para2=lcm(pro[l+2],pro[l+3]);
para3=lcm(pro[l+4],pro[l+5]);
para4=lcm(pro[l+6],pro[l+7]);
para5=lcm(pro[l+8],pro[l+9]);
qvad1=lcm(para1,para2);
qvad2=lcm(para3,para4);
qvad3=lcm(para5,pro[l+10]);
oct=lcm(qvad1,qvad2);
shag=lcm(oct,qvad3);
print(" ",shag," ",zap);
);
for(i=l,l+34,v11[i]=v11[i+1]));
for(i=l,l+30,v7[i]=v7[i+1]));
for(i=l,l+28,v5[i]=v5[i+1]));
for(i=l,l+21,v3[i]=v3[i+1]));
print();
}
quit;

Конкретно эта прога даёт 167 крайне левых паттернов со степенями простых 1 и 2. В обозначениях Дмитрия это паттерны с "-8" в самом конце.

5 моих прог дают и все другие последние цифры и вот такие количества:

$167+79+122+79+167=614$

В таблице это 4 наименьших шага:

$66+142+180+226=614$

Пока совпадает, ура. Буду двигаться дальше.

[Yadryara]

Продолжил.

(PARI)

kvar=0;
pro=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1, 1,1,1, 1,1,1,1,1];
v2 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,1,4,1,2,1,32,1,2, 1,4,1,2,1];
v3 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,3,1,1,3,1, 1,9,1,1,3,1,1,3,1,1,9,1,1,3,1,1];
{for(i3=1,9,
v5 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,1,1,1,1,5,1, 1,1,1,5,1,1,1,1,25,1,1,1,1,5,1,1,1,1,5,1,1,1,1];
for(i5=1,16,
v7 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,7,1,1,1, 1,1,1, 16807,1,1,1,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1,1,1,7];
for(i7=1,11,
v11=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1, 1,1,1,161051,1,1,1,1,1,1,1,1,1,1,11,1,1,1,1,1,1,1,1,1,1,11,1,1,1];
for(i11=1,11,
\\v7 =[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,7,1,1,1,1,1,1,7,1,1,1,1, 1,1,49,1,1,1,1,1,1,7,1,1,1,1,1,1,7];
\\for(i7=1,18,
\\v11=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,11,1,1,1,1,1,1,1,1,1,1,121,1,1,1,1,1,1,1,1,1,1,11,1,1,1];
\\for(i11=1,22,
zap=0;l=29;r=l+10;
for(i=l,r,pro[i]=v2[i]*v3[i]*v5[i]*v7[i]*v11[i];
if(numdiv(pro[i]) >6 || numdiv(pro[i]) == 4,zap=zap+1));
if(zap == 0,
kvar=kvar+1;print();print1(kvar);
print1( " ");for(i=l,r,print1(i, " ",));print();print();
print1(" ");for(i=l,31,print1(" ",v2[i]));
print1(" ");for(i=32,r,print1(v2[i]," ",));print();print();
print1(" ");for(i=l,r,print1(" ",v3[i]));print();print();
print1(" ");for(i=l,r,print1(" ",v5[i]));print();print();
print1(" ");for(i=l,r,print1(" ",v7[i]));print();print();
print1(" ");for(i=l,r,print1(" ",v11[i]));print();print();
print1(" ");for(i=l,r,print1(" ",pro[i]));print();print();
para1=lcm(pro[l],pro[l+1]);
para2=lcm(pro[l+2],pro[l+3]);
para3=lcm(pro[l+4],pro[l+5]);
para4=lcm(pro[l+6],pro[l+7]);
para5=lcm(pro[l+8],pro[l+9]);
qvad1=lcm(para1,para2);
qvad2=lcm(para3,para4);
qvad3=lcm(para5,pro[l+10]);
oct=lcm(qvad1,qvad2);
shag=lcm(oct,qvad3);
print(" ",shag," ",zap);
);
for(i=l,l+34,v11[i]=v11[i+1]));
for(i=l,l+30,v7[i]=v7[i+1]));
for(i=l,l+28,v5[i]=v5[i+1]));
for(i=l,l+21,v3[i]=v3[i+1]));
print();
}
quit

Конкретно эта прога даёт 16 крайне правых паттернов с числами $7^5$ и $11^5$. В обозначениях Дмитрия это паттерны с "-4" в самом конце.

А по всем таким прогам нашлись пока 430 вариантов с 5-й степенью:

Старт        16807            161051      16807 & 161051
        1331114400        8116970400
       14642258400       56818792800      19488845930400

25              59                43                  16   118
26              27                17                   6    50
27              46                34                  14    94
28              27                17                   6    50
29              59                43                  16   118

                                                      58   430

$614 + 430 = 1044$

Пока совпадает, ура. И 58 паттернов с наибольшим шагом тоже нашлись. Впереди самое интересное.

[Dmitriy40]

Yadryara в сообщении #1572621 писал(а):

para1=lcm(pro[l],pro[l+1]);
para2=lcm(pro[l+2],pro[l+3]);
para3=lcm(pro[l+4],pro[l+5]);
para4=lcm(pro[l+6],pro[l+7]);
para5=lcm(pro[l+8],pro[l+9]);
qvad1=lcm(para1,para2);
qvad2=lcm(para3,para4);
qvad3=lcm(para5,pro[l+10]);
oct=lcm(qvad1,qvad2);
shag=lcm(oct,qvad3);

Во первых есть тег коде, пользуйтесь им.
Во вторых всё процитированное заменяется одной командой: shag=lcm(pro[l..l+10]);.

[Yadryara]

Dmitriy40 в сообщении #1572623 писал(а):

Во вторых всё процитированное заменяется одной командой: shag=lcm(pro[l..l+10]);.

Спасибо. Да, под неуклюжестью имел в виду и расчёт lcm. Так и думал, что можно было одной командой. Попробовал разок, но не угадал, хэлп смотреть поленился и сделал 10(!) команд вместо 1-й.

Что-то много у меня получается вариантов под Быстрый Квадратичный Перебор. Только крайне левых со степенями простых 1 и 2 получилось аж 2659 штук. А у Hugo их всего было 99.

Кстати, Hugo, на всякий случай, не надо нам подсказывать. Ведь это попытка построить систему паттернов независимо от Вас.

By the way, Hugo, just in case, don't give us any hints. After all, this is an attempt to build a system of patterns independently of you.

[Yadryara]

Yadryara в сообщении #1572641 писал(а):

Что-то много у меня получается вариантов под Быстрый Квадратичный Перебор. Только крайне левых со степенями простых 1 и 2 получилось аж 2659 штук. А у Hugo их всего было 99.

Потребовав обязательного наличия чисел $18p$ и $50p$ либо $75p$ снизил количество таких паттернов до $297$.