University of Cambridge > Talks.cam > Discrete Analysis Seminar > Almost-prime k-tuples

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Almost-prime k-tuples

Download to your calendar using vCal

  • UserJames Maynard (Oxford)
  • ClockWednesday 21 November 2012, 16:00-17:00
  • HouseMR11, CMS.

If you have a question about this talk, please contact Ben Green .

For $i=1,\dots,k$, let $L_i(n)=a_i n+b_i$ be linear functions with integer coefficients, such that $\prod_{i=1}k L_i(n)$ has no fixed prime divisor. It is conjectured that there are infinitely many integers $n$ for which all of the $L_i(n)$ ($1\le i \le k$) are simultaneously prime. Unfortunately we appear unable to prove this, but weighted sieves all us to show that there are infinitely many integers $n$ for which $\prod_[i=1}k L_i(n)$ has at most $r_k$ prime factors, for some explicit constant $r_k$ depending only on $k$. We describe new weighted sieves which improve these bounds when $k\ge 3$, and discuss potential applications to small prime gaps.

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Laundress Lane, Seminar Room 1 Soc Doc Soc Riley Auditorium, Gillespie Centre, Memorial Court, Clare College, Queens Rd.

Other talks

Morning Break Novel neuroimaging methods in Lewy body dementia Ensemble inequivalence for systems with long-range interactions Early cancer clinical trials Feedback and the circumgalactic medium Synthesizing Diverse Policies for Multi-Agent Coordination
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity