<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/">
	<channel>
		<title>finding  smallest wheel</title>
		<link>https://www.lotterypost.com/thread/191013</link>
		<atom:link href="https://www.lotterypost.com/rss/topic/191013" rel="self" type="application/rss+xml" />
		<description>Lottery Post Forum Topic: finding  smallest wheel</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>finding  smallest wheel</title>
			<link>https://www.lotterypost.com/thread/191013</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/191013</guid>
			<pubDate>Sun, 22 Mar 2009 00:15:07 GMT</pubDate>
			<dc:creator>Buckau</dc:creator>
			<description><![CDATA[<p>Hi I am trying to create a function that will compare one list of elements against another list of elements and find the smallest number of enters from the first list that will contain all the elements in the second list.<br /><br />e.g. lets say I have 8 items constructed in to blocks of 6 items this will give me an array containing 6 elements x 28 rows<br /><br />Array1(28,6)<br /><br />1) - 1, 2, 3, 4, 5, 6<br /><br />2) - 1, 2, 3, 4, 5, 7<br /><br />3) - 1, 2, 3, 4, 5, 8<br /><br />4) - 1, 2, 3, 4, 6, 7<br /><br />5) - 1, 2, 3, 4, 6, 8<br /><br />6</p>]]></description>
			<category>Buckau</category>
		</item>
	</channel>
</rss>

