<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wikidot="http://www.wikidot.com/rss-namespace">

	<channel>
		<title>Super Primes</title>
		<link>http://bgscc.wikidot.com/forum/t-59126/super-primes</link>
		<description>Posts in the discussion thread &quot;Super Primes&quot; - Mathematical Thinking here... From ACPC Samples</description>
				<copyright></copyright>
		<lastBuildDate></lastBuildDate>
		
					<item>
				<guid>http://bgscc.wikidot.com/forum/t-59126#post-162018</guid>
				<title>Super Primes</title>
				<link>http://bgscc.wikidot.com/forum/t-59126/super-primes#post-162018</link>
				<description></description>
				<pubDate>Mon, 12 May 2008 11:20:54 +0000</pubDate>
				<wikidot:authorName>JGat</wikidot:authorName>				<wikidot:authorUserId>80823</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>What are Super Primes?</p> <ul> <li>A Super Prime is a prime number with the additional interesting property that as each digit is removed from the right the number which remains is a prime.</li> </ul> <p>Instructions</p> <p>The following is a list of Super Primes of length 4:<br /> <tt>2333<br /> 2339<br /> 2393<br /> 2399<br /> 2939<br /> 3119<br /> 3137<br /> 3733<br /> 3739<br /> 3793<br /> 3797<br /> 5939<br /> 7193<br /> 7331<br /> 7333<br /> 7393</tt></p> <p>Instructions</p> <ul> <li>Write a program that prints all super primes of length 6</li> <li>Your output should contain each Super Prime on a line each.</li> <li>Output sould be in ascending order.</li> <li>No other output should be produced by your program other than the numbers.</li> </ul> <p>If you can use File I/O, output your answer to "primes.txt"</p> 
				 	]]>
				</content:encoded>							</item>
				</channel>
</rss>