|
|
A052157
|
|
Least positive integer r such that there exists an integer s, 0 <= s < r gcd(r-i, s-j) > 1 for all integers i, j with 0 <= i, j < n.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
a_n < e^{(1+o(1)) 2 n^2 log n}.
|
|
EXAMPLE
|
a(1) = 2 because we can choose r = 2, s = 0; a(2) = 21 because we can choose r = 21, s = 15; a(3) = 1310 because we can choose r = 1310, s = 1276.
|
|
PROG
|
(PARI) is(r, n)=n--; my(s=[Mod(0, 1)], f, v, p); for(i=0, n, f=factor(r-i)[, 1]; for(j=0, n, v=List(); for(k=1, #f, p=f[k]; for(k=1, #s, if(s[k].mod%p, listput(v, chinese(Mod(j, p), s[k])), if(Mod(s[k], p)==j, listput(v, s[k]))))); s=select(m->lift(m)<r, Set(v)); if(#s==0, return(0)))); s[1]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
By brute force search I know that a(4) > 410000. And also I know by constructing the pair (r, s) = (477742707, 172379781) that a(4) <= 477742707.
|
|
STATUS
|
approved
|
|
|
|