https://charlesreid1.com/w/index.php?action=history&feed=atom&title=Project_Euler%2F228 2026-06-19T08:29:50Z Revision history for this page on the wiki MediaWiki 1.39.12 https://charlesreid1.com/w/index.php?title=Project_Euler/228&diff=30619&oldid=prev 2026-06-17T21:18:58Z

<p>Create Project Euler/228 - Minkowski Sums (via create-page on MediaWiki MCP Server)</p> <p><b>New page</b></p><div>==Problem Statement==<br /> <br /> &#039;&#039;&#039;Minkowski Sums&#039;&#039;&#039;<br /> <br /> Let S_n be the regular n-sided polygon – or shape – whose vertices v_k (k = 1,2,…,n) have coordinates:<br /> <br /> x_k = cos( (2k-1)/n × 180° )<br /> y_k = sin( (2k-1)/n × 180° )<br /> <br /> Each S_n is to be interpreted as a filled shape consisting of all points on the perimeter and in the interior.<br /> <br /> The Minkowski sum, S+T, of two shapes S and T is the result of adding every point in S to every point in T, where point addition is performed coordinate-wise:<br /> <br /> (u, v) + (x, y) = (u+x, v+y).<br /> <br /> How many sides does S_1864 + S_1865 + … + S_1909 have?<br /> <br /> ==Flags==<br /> <br /> {{ProjectEulerFlag}}</div>

Admin