The least modulus for which consecutive polynomial values are distinct

DOI10.1016/J.JNT.2015.08.001zbMATH Open1396.11007arXiv1304.5988OpenAlexW2963293844MaRDI QIDQ897532FDOQ897532

Authors: Zhi-Wei Sun 

Publication date: 7 December 2015

Published in: Journal of Number Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1304.5988

Recommendations

• The incongruence of consecutive values of polynomials
• On functions taking only prime values
• Note on Pairs of Consecutive Residues of Polynomials
• A coprimality condition on consecutive values of polynomials
• On the distribution of consecutive primitive roots

zbMATH Keywords

congruencesprimes in arithmetic progressionsfunctions taking only prime values

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Primes (11A41) Primes in congruence classes (11N13) Primality (11Y11)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Primes in arithmetic progressions
• A prime-representing function
• On functions taking only prime values
• A note on the incongruence of consecutive integers to a fixed power

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)