Table of Contents
Fetching ...

On the representation of $k$-free integers by binary forms

C. L. Stewart, Stanley Yao Xiao

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 \geq 2$ and suppose that there is no prime $p$ such that $p^k$ divides $F(a,b)$ for all pairs of integers $(a,b)$. Let $R_{F,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 $C_{F,k}$ such that $R_{F,k}(Z)$ is asymptotic to $C_{F,k} Z^{\frac{2}{d}}$ provided that $k$ exceeds $ \frac{7r}{18}$ or $(k,r)$ is $(2,6)$ or $(3,8)$.

On the representation of $k$-free integers by binary forms

Abstract

Let be a binary form with integer coefficients, non-zero discriminant and degree with at least and let denote the largest degree of an irreducible factor of over the rationals. Let be an integer with and suppose that there is no prime such that divides for all pairs of integers . Let denote the number of -free integers of absolute value at most which are represented by . We prove that there is a positive number such that is asymptotic to provided that exceeds or is or .

Paper Structure

This paper contains 7 sections, 10 theorems, 189 equations.

Key Result

Theorem 1.1

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d$ with $d \geq 3$ and let $r$ denote the largest degree of an irreducible factor of $F$ over the rationals. Let $k$ be an integer with $k \geq 2$ and suppose that there is no prime $p$ such that $p^k$ divides $F(a where

Theorems & Definitions (15)

  • Theorem 1.1
  • Theorem 1.2
  • Theorem 1.3
  • Conjecture 1.4
  • Lemma 2.1
  • Lemma 2.2
  • proof
  • Lemma 2.3
  • proof
  • Lemma 2.4
  • ...and 5 more