|
|
A226220
|
|
Maximum number of entries of the multiplication table mod p realizable additively, where p is the n-th prime.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The maximum number of pairs i,j such that ij=f(i)+g(j) mod p, maximized over all functions f, g (mod p), for p=2,3,5,7,11... Lower bounds are known for the next five terms (starting with p=19): 66, 79, 99, 135, 148
|
|
LINKS
|
|
|
EXAMPLE
|
For the second term a(2)=6, p=3, and one can take f(0)=g(0)=f(1)=g(1)=0, f(2)=g(2)=2.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|