f(1) ? If p_1 = 2, then f(2+) = 1 [2(k+1)+3*0, 2k+3*1] If p_1 = 3, then f(2) = 7, [3(k+3)+5*0, 3(k+1)+5*1, 3k+5*2] f(3+) = 4, [above, 7*1, 3*2, 5*1] Am I confused, or did I completely misunderstand what you've written? --ms On 14-May-15 23:57, Dan Asimov wrote:
I recently read that every sufficiently large integer in Z+ is representable as a linear combination — with coefficients in N_0 := {0,1,2,...} — of the first n primes
P_n := {p_1,...,p_n} .
(Actually this holds for relatively prime integers.)
Let f(n) denote the largest integer *not* expressible as an N_0 combination of the primes in P_n with all coefficients nonnegative.
I've also read there is no known expression for f(n).
So: Is there a simple asymptotic expression for f(n) as n -> oo ???
——Dan _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun