|
COMMENTS
|
Terms were found by generating in sequential order the 11-smooth numbers up to some limit and collecting the differences. The first 100 candidates k were then proved to be correct by showing that each of the following 15 congruences holds:
<2> +- k !== <3, 5, 7, 11> mod 563213996185633,
<3> +- k !== <2, 5, 7, 11> mod 194191394486113583,
<2, 3> +- k !== <5, 7, 11> mod 1762314762258271,
<5> +- k !== <2, 3, 7, 11> mod 220836983154619,
<2, 5> +- k !== <3, 7, 11> mod 2128827364461031,
<3, 5> +- k !== <2, 7, 11> mod 3521575252831519,
<7, 11> +- k !== <2, 3, 5> mod 497846284658749,
<7> +- k !== <2, 3, 5, 11> mod 5489574535421899,
<2, 7> +- k !== <3, 5, 11> mod 6600281111334703,
<3, 7> +- k !== <2, 5, 11> mod 834486158701066937,
<5, 11> +- k !== <2, 3, 7> mod 239190476358328703,
<5, 7> +- k !== <2, 3, 11> mod 3288443009987083,
<3, 11> +- k !== <2, 5, 7> mod 14071029652900961,
<2, 11> +- k !== <3, 5, 7> mod 1762314762258271,
<11> +- k !== <2, 3, 5, 7> mod 411934385702047,
where <a,b,...> represents any element in the subgroup generated by a,b,... of the multiplicative subgroup modulo m. For a discussion iof this method of proof see A308247.
|