{"paper":{"title":"On the number of distinct quadratic fields generated by the Shanks sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Igor E. Shparlinski, William D. Banks","submitted_at":"2016-02-20T22:58:21Z","abstract_excerpt":"Let $g>1$ be an integer and $f(X)\\in{\\mathbb Z}[X]$ a polynomial of positive degree with no multiple roots, and put $u(n)=f(g^n)$. In this note, we study the sequence of quadratic fields ${\\mathbb Q}(\\sqrt{u(n)}\\,)$ as $n$ varies over the consecutive integers $M+1,\\ldots,M+N$. Fields of this type include Shanks fields and their generalizations. Using the square sieve together with new bounds on character sums, we improve an upper bound of Luca and Shparlinski (2009) on the number of $n \\in \\{M+1,\\ldots,M+N\\}$ with ${\\mathbb Q}(\\sqrt{u(n)}\\,) = {\\mathbb Q}(\\sqrt{s}\\,)$ for a given squarefree in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06473","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}