<?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>Program Suggestion</title>
		<link>https://www.lotterypost.com/thread/135249</link>
		<atom:link href="https://www.lotterypost.com/rss/topic/135249" rel="self" type="application/rss+xml" />
		<description>Lottery Post Forum Topic: Program Suggestion</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Program Suggestion</title>
			<link>https://www.lotterypost.com/thread/135249</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/135249</guid>
			<pubDate>Fri, 26 May 2006 23:27:22 GMT</pubDate>
			<dc:creator>Fibonacci</dc:creator>
			<description><![CDATA[<p>Hey Paurths and other great programmers...<br /><br />To give the Fibonacci Pair System automated  a kick I need a porog that can do the following...<br /><br />1. take a list of draws..as many as 100 ...break them up into their constitutent pairs<br /><br />2. Analyse the pairs as follows<br /><br />A. List Front Pairs and give a count..e.g if 45 appears as FP 4 times it will show that<br /><br />B. List and count Back Pairs ..etc (as in 2 A)<br /><br />C. List and count side pairs...etc as above<br /><br />D. Make a list of pai... &#x5b;&#xa0;<a href="https://www.lotterypost.com/thread/135249">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>Fibonacci</category>
		</item>
	</channel>
</rss>

