Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-29T11:23:49.305Z Has data issue: false hasContentIssue false

An attack on the Erdos conjecture

Published online by Cambridge University Press:  01 August 2016

Nick Mackinnon
Affiliation:
Blundell’s School, Tiverton, Devon
John Eastmond
Affiliation:
Blundell’s School, Tiverton, Devon

Extract

5, 11, 17, 23, 29 is an arithmetic progression of prime numbers. It is conjectured that there are such progressions with arbitrarily many terms (there cannot be infinite sequences because a, a + d, a + 2d,… sooner or later contains a + ad). The longest such known to the authors has first term 4943 and common difference 60 060 with 13 prime terms, but longer ones will have been found by now. In general, additive problems about the multiplicatively defined prime numbers are inevitably difficult (e.g. the Goldbach conjecture and twin primes) and may even be candidates for undecidability. We have been trying to prove a much more general conjecture of Erdos, spurred on by his offer of $3000 to the first proof or disproof of it.

Type
Research Article
Copyright
Copyright © Mathematical Association 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)