On the representation of k-free integers by binary forms
Abstract
Let F be a binary form with integer coefficients, non-zero discriminant and degree d with d at least 3 and let r denote the largest degree of an irreducible factor of F over the rationals. Let k be an integer with k ≥ 2 and suppose that there is no prime p such that pk divides F(a,b) for all pairs of integers (a,b). Let RF,k(Z) denote the number of k-free integers of absolute value at most Z which are represented by F. We prove that there is a positive number CF,k such that RF,k(Z) is asymptotic to CF,k Z2d provided that k exceeds 7r18 or (k,r) is (2,6) or (3,8).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.