Related Experiment Video
Updated: Sep 13, 2026

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
Published on: June 23, 2012
Using a parity-sensitive sieve to count prime values of a polynomial
1Scarborough College, University of Toronto, Scarborough, ON, M1C 1A4, Canada.
Abstract:
It is expected that any irreducible polynomial with integer coefficients assumes infinitely many prime values provided that it satisfies some obvious local conditions. Moreover, it is expected that the frequency of these primes obeys a simple asymptotic law. This has however been proven for only a few special classes of polynomials. In the most famous unsolved cases the sequence of values is "thin" in the sense that it contains fewer than N(theta) integers up to N for some constant theta < 1. Quite generally it seems to be difficult to show the infinitude of primes in a given thin integer sequence and there is no polynomial for which this has hitherto been done. The polynomial x(2) + y(4) is an example of such a thin sequence; here, specifically, theta = 3/4. We report here the development of new methods that rigorously demonstrate the asymptotic formula in the case of this polynomial and that are applicable to an infinite class of polynomials to which this one belongs. The proof is based partly on a new sieve method that breaks the well-known parity problem of sieve theory and partly on a careful harmonic analysis of the special properties of biquadratic polynomial sequences.
More Related Videos
09:23Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
Published on: May 30, 2014
05:58Digital Polymerase Chain Reaction Assay for the Genetic Variation in a Sporadic Familial Adenomatous Polyposis Patient Using the Chip-in-a-tube Format
Published on: August 20, 2018
Related Concept Videos
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Introduction to Polynomial Functions
Long Division of Polynomials
Real Zeros of Polynomials
Fundamental Theorem of Algebra
Synthetic Disvision of Polynomials