The least modulus for which consecutive polynomial values are distinct

From MaRDI portal



Abstract: Let dge4 and cin(−d,d) be relatively prime integers. We show that for any sufficiently large integer n (in particular n>24310 suffices for 4ledle36), the smallest prime pequivcpmodd with pge(2dn−c)/(d−1) is the least positive integer m with 2r(d)k(dk−c)(k=1,ldots,n) pairwise distinct modulo m, where r(d) is the radical of d. We also conjecture that for any integer n>4 the least positive integer m such that |k(k−1)/2mboxmodm:k=1,ldots,n|=|k(k−1)/2mboxmodm+2:k=1,ldots,n|=n is the least prime pge2n−1 with p+2 also prime.












This page was built for publication: The least modulus for which consecutive polynomial values are distinct

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897532)