document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1062750>Question 1062750</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Write a program to print the following series<BR>\n" );
document.write( "2 5 11 17 23 31 41 47 59  ...<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #677752 by </B><A HREF=/tutors/aboutme.mpl?userid=rothauserc><B>rothauserc(4718)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=rothauserc><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=rothauserc><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=677752\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> This is a list of every second prime beginning with 2.<BR>\n" );
document.write( ":<BR>\n" );
document.write( "The index into the list of primes would be (2n-1) where n = 1, 2, ......k<BR>\n" );
document.write( ":<BR>\n" );
document.write( "You would have to set k to some integer, for example 100<BR>\n" );
document.write( ":<BR>\n" );
document.write( "There are plenty of examples of c or java code on the internet to generate prime numbers, store them in a matrix and then use the index (2n-1) into the matrix to print out the every second prime number list<BR>\n" );
document.write( ":<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );