<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://charlesreid1.com/w/index.php?action=history&amp;feed=atom&amp;title=Project_Euler%2F249</id>
	<title>Project Euler/249 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://charlesreid1.com/w/index.php?action=history&amp;feed=atom&amp;title=Project_Euler%2F249"/>
	<link rel="alternate" type="text/html" href="https://charlesreid1.com/w/index.php?title=Project_Euler/249&amp;action=history"/>
	<updated>2026-06-19T16:33:08Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.12</generator>
	<entry>
		<id>https://charlesreid1.com/w/index.php?title=Project_Euler/249&amp;diff=30640&amp;oldid=prev</id>
		<title>Admin: Create Project Euler/249 - Prime Subset Sums (via create-page on MediaWiki MCP Server)</title>
		<link rel="alternate" type="text/html" href="https://charlesreid1.com/w/index.php?title=Project_Euler/249&amp;diff=30640&amp;oldid=prev"/>
		<updated>2026-06-17T21:19:36Z</updated>

		<summary type="html">&lt;p&gt;Create Project Euler/249 - Prime Subset Sums (via create-page on MediaWiki MCP Server)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;==Problem Statement==&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Prime Subset Sums&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Let S = {2, 3, 5, ..., 4999} be the set of primes less than 5000.&lt;br /&gt;
&lt;br /&gt;
Find the number of subsets of S whose sum is a prime number.&lt;br /&gt;
&lt;br /&gt;
Enter the rightmost 16 digits of your answer.&lt;br /&gt;
&lt;br /&gt;
==Flags==&lt;br /&gt;
&lt;br /&gt;
{{ProjectEulerFlag}}&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
	</entry>
</feed>