<?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>Vertical sums as a function.</title>
		<link>/blogentry/197439</link>
		<atom:link href="https://www.lotterypost.com/rss/blogcomments/197439" rel="self" type="application/rss+xml" />
		<description>hypersoniq's Blog: Vertical sums as a function.</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Original Blog Entry: Vertical sums as a function.</title>
			<link>/blogentry/197439</link>
			<guid isPermaLink="true">/blogentry/197439</guid>
			<pubDate>Thu, 26 Feb 2026 04:24:05 GMT</pubDate>
			<dc:creator>hypersoniq</dc:creator>
			<description><![CDATA[<p>The concept is easy to imagine, but what would it look like as a function?<br /><br />A sample size would need to be determined, then a step run over that sample would give a table of N vertical sums... but how many? One per ball of the game? A fixed number from 3 to 10?<br /><br />You would need, for example, 5 number sums in a table, but also the sum of the last 4 games... in the framework, that sum would be placed on a stats card on the screen after the table, along with average sums for the sample. The thought process being average sum of each 5 in the sample minus the last 4 is your pick.<br /><br />Time will be needed to get an idea of the sum size and sample size. But that is the basic premise for a start.... &#x5b;&#xa0;<a href="/blogentry/197439">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>Blog Entry</category>
			<category>hypersoniq</category>
			<wfw:comment>https://www.lotterypost.com/blogentry/197439</wfw:comment>
		</item>
	</channel>
</rss>

