Problem 1688. Prime Sequences: AP-k Minimum Final Value

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Welcome to Fun with Primes. Today we will find the Minimum Final Value AP-k sequences for n_max=3:12 given the primorial and knowledge that the solution is of the form a + b * k# * n.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The AP-k of n sequence is n_max+1 primes of the form a + b * k# * n where n=0:n_max. The value of \"a\" is a prime and k# is the primorial.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The primorial k# is the product of all primes ≤ k, e.g. 10# = 2 · 3 · 5 · 7.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> (k, n_max)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> [a, b] for the equation Prime = a + b * k# * n, n=0:n_max; Prime(n_max) must be the optimum minimum.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Value Range Limits:</w:t></w:r><w:r><w:t> [a&lt;150,000 , b&lt;8 ]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>(13, 13) yields [31385539,14 ]; 31385539 + 14·13#·n (End Prime 36850999)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Commentary:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>(13, 16) has a non-minimal end [17, 11387819007325752 ] to give Primes=17 + 11387819007325752·13#·n</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The current June 2013 record for n is 25 via PrimeGrid: 43142746595714191 + 23681770·23#·n</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

15 Solutions
4 Solvers

Last Solution submitted on May 31, 2019

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

James on 8 Jul 2013

Did Cody decrease the maximum time you can run a solution before it times out? My previous solutions were about 16-18 sec on my box, but timed out here. The one that finally worked was at around 13 sec on my box.

Solution Comments

Solution 275889

1 Comment

1 Comment

James on 8 Jul 2013

Hooray! A solution that didn't time out on me...

Problem Recent Solvers4

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1688. Prime Sequences: AP-k Minimum Final Value

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers4

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 1688. Prime Sequences: AP-k Minimum Final Value

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers4

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players