Find the smallest possible arithmetic sequence consisting of seven primes.(adsbygoogle = window.adsbygoogle || []).push({});

For example, the smallest possible arithmetic sequence consisting of five primes is: 5, 11, 17, 23, 29.

By the way, by "smallest possible" I mean that the last term in the sequence must be the smallest possible of all such sequences.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A Question to Trouble Even the Best of You

Loading...

Similar Threads - Question Trouble Best | Date |
---|---|

I Question about inverse operators differential operators | Feb 9, 2018 |

I Field Extensions - Lovett, Theorem 7.1.10 - Another question | May 7, 2017 |

I Problem understanding the SPAN | May 1, 2017 |

I Trouble with exact sequence | Sep 15, 2016 |

**Physics Forums - The Fusion of Science and Community**