<?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>How To Solve An Equation That Has &#x22;Int&#x22; In The Mix</title>
		<link>https://www.lotterypost.com/thread/327874</link>
		<atom:link href="https://www.lotterypost.com/rss/topic/327874" rel="self" type="application/rss+xml" />
		<description>Lottery Post Forum Topic: How To Solve An Equation That Has &#x22;Int&#x22; In The Mix</description>
		<dc:language>en-us</dc:language>
		<generator>Lottery Post RSS Generator</generator>
		<item>
			<title>Reply #6</title>
			<link>https://www.lotterypost.com/thread/327874/5982793</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/327874/5982793</guid>
			<pubDate>Fri, 05 Jul 2019 17:10:34 GMT</pubDate>
			<dc:creator>JADELottery</dc:creator>
			<description><![CDATA[<p>Decimal Integer Part Fractional Part<br /><br />if = . , then int( ) = .0 and frac( ) = 0.<br /><br />Relational Equations<br /><br />= int( ) + frac( )<br /><br />int( ) = - frac( )<br /><br />frac( ) = - int( )<br /><br />Solution<br /><br />a = (b x + c) - int((b x + c) / n) n<br /><br />a / n = ((b x + c) / n) - int((b x + c) / n)<br /><br />a / n = frac((b x + c) / n)<br /><br />if and only if |a| |n| and 0 (a / n) 1, then | | + (a / n) = (b x + c) / n<br /><br />n | | + a = b x + c<br /><br />n | | + a - c = b x<br /><br />(n | | + a - c) / b = x<br /><br />x = (n | | + a - c) / b</p>]]></description>
			<category>JADELottery</category>
		</item>
		<item>
			<title>Reply #5</title>
			<link>https://www.lotterypost.com/thread/327874/5982366</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/327874/5982366</guid>
			<pubDate>Fri, 05 Jul 2019 04:54:43 GMT</pubDate>
			<dc:creator>JADELottery</dc:creator>
			<description><![CDATA[<p>Thanks.<br /><br />Hope your 4th was great, too.<br /><br />Been lurking around mostly due to business travel and vacation.</p>]]></description>
			<category>JADELottery</category>
		</item>
		<item>
			<title>Reply #4</title>
			<link>https://www.lotterypost.com/thread/327874/5982335</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/327874/5982335</guid>
			<pubDate>Fri, 05 Jul 2019 04:08:25 GMT</pubDate>
			<dc:creator>lakerben</dc:creator>
			<description><![CDATA[<p>Happy 4th jade! Good to see you on the site</p>]]></description>
			<category>lakerben</category>
		</item>
		<item>
			<title>Reply #3</title>
			<link>https://www.lotterypost.com/thread/327874/5982233</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/327874/5982233</guid>
			<pubDate>Fri, 05 Jul 2019 02:04:30 GMT</pubDate>
			<dc:creator>JADELottery</dc:creator>
			<description><![CDATA[<p>Solveable, yes.<br /><br />If a n</p>]]></description>
			<category>JADELottery</category>
		</item>
		<item>
			<title>Reply #2</title>
			<link>https://www.lotterypost.com/thread/327874/5982121</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/327874/5982121</guid>
			<pubDate>Thu, 04 Jul 2019 23:46:32 GMT</pubDate>
			<dc:creator>mitachoo</dc:creator>
			<description><![CDATA[<p>Thanks cottoneyedjoe, in a roundabout way I figured there was an infinte number of solutions in that I had resorted to creating a Macro in Excel to iterate on solutions but only up to a certain value of a. I hoped there might be a better way, but if infinity is the answer, there&#x27;s naught I can do except bound it as I&#x27;ve done already.<br /><br />Thanks again</p>]]></description>
			<category>mitachoo</category>
		</item>
		<item>
			<title>Reply #1</title>
			<link>https://www.lotterypost.com/thread/327874/5981950</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/327874/5981950</guid>
			<pubDate>Thu, 04 Jul 2019 20:13:47 GMT</pubDate>
			<dc:creator>cottoneyedjoe</dc:creator>
			<description><![CDATA[<p>Assuming n is an integer and k is either an integer or non-integer, the expression int{ k/n }*n is an integer bounded between a minimum of int{k} - n + 1 and a maximum of int{k}. That is a total of n different values the expression can take on, so to do it algebraically, you could replace k with bx+c and solve n different equations.<br /><br />What you will find is that for any given value of a that is at least 0 and strictly less than n, there are infinitely many values of x that make the equation true... &#x5b;&#xa0;<a href="https://www.lotterypost.com/thread/327874/5981950">More</a>&#xa0;&#x5d;</p>]]></description>
			<category>cottoneyedjoe</category>
		</item>
		<item>
			<title>How To Solve An Equation That Has &#x22;Int&#x22; In The Mix</title>
			<link>https://www.lotterypost.com/thread/327874</link>
			<guid isPermaLink="true">https://www.lotterypost.com/thread/327874</guid>
			<pubDate>Thu, 04 Jul 2019 17:53:59 GMT</pubDate>
			<dc:creator>mitachoo</dc:creator>
			<description><![CDATA[<p>I have an odd math question, hopefully someone can point me in the right direction.<br /><br />I have an equation that looks like this:<br /><br />a = (bx + c) - int{ (bx + c)/n } * n<br /><br />How the (expletive) do I solve for x, since x has a mix of Int and non-Int? Is there some way to convert the Int portion of the equation to non-Int</p>]]></description>
			<category>mitachoo</category>
		</item>
	</channel>
</rss>

