Square-free values of reducible polynomials

Andrew Booker; Tim Browning

doi:10.19086/da.732

Square-free values of reducible polynomials

Andrew Booker
, Tim Browning

Research output: Contribution to journal › Article (Academic Journal) › peer-review

13 Citations (Scopus)

408 Downloads (Pure)

Abstract

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.

Original language	English
Number of pages	16
Journal	Discrete Analysis
Volume	2016
Issue number	8
DOIs	https://doi.org/10.19086/da.732
Publication status	Published - 1 Jun 2016

Bibliographical note

16 pages

Keywords

math.NT
11N36 (11N32)

Access to Document

10.19086/da.732

Full-text PDF (final published version)
This is the final published version of the article (version of record). It first appeared online at http://arxiv.org/abs/1511.00601v2. Please refer to any applicable terms of use of the publisher.
Final published version, 227 KBLicence: CC BY

Handle.net

Persistent link

Detecting squarefree numbers
Booker, A. R. (Principal Investigator)
1/07/13 → 1/07/15
Project: Research

Cite this

@article{a2d78daab3ef406c9430f2d35109fe69,

title = "Square-free values of reducible polynomials",

abstract = "We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.",

keywords = "math.NT, 11N36 (11N32)",

author = "Andrew Booker and Tim Browning",

note = "16 pages",

year = "2016",

month = jun,

day = "1",

doi = "10.19086/da.732",

language = "English",

volume = "2016",

journal = "Discrete Analysis",

issn = "2397-3129",

publisher = "Alliance of Diamond OA Journals",

number = "8",

}

TY - JOUR

T1 - Square-free values of reducible polynomials

AU - Booker, Andrew

AU - Browning, Tim

N1 - 16 pages

PY - 2016/6/1

Y1 - 2016/6/1

N2 - We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.

AB - We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.

KW - math.NT

KW - 11N36 (11N32)

U2 - 10.19086/da.732

DO - 10.19086/da.732

M3 - Article (Academic Journal)

SN - 2397-3129

VL - 2016

JO - Discrete Analysis

JF - Discrete Analysis

IS - 8

ER -

Square-free values of reducible polynomials

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Projects

Detecting squarefree numbers

Cite this