<?xml version="1.0" encoding="UTF-8"?>
	<rss version="2.0"
		xmlns:content="http://purl.org/rss/1.0/modules/content/"
		xmlns:wfw="http://wellformedweb.org/CommentAPI/"
		xmlns:dc="http://purl.org/dc/elements/1.1/"
		xmlns:atom="http://www.w3.org/2005/Atom"

			>

	<channel>
		<title>Cycling 74  &#187;  Topic: Counting until two numbers match</title>
		<atom:link href="http://cycling74.com/forums/topic/counting-until-two-numbers-match/feed" rel="self" type="application/rss+xml" />
		<link>http://cycling74.com/forums/topic/counting-until-two-numbers-match/feed</link>
		<description></description>
		<pubDate>Thu, 20 Jun 2013 00:01:09 +0000</pubDate>
		<generator>http://bbpress.org/?v=2.2.4</generator>
		<language></language>

		
														
					
				<item>
					<guid>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-60588</guid>
					<title><![CDATA[Counting until two numbers match]]></title>
					<link>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-60588</link>
					<pubDate>Fri, 09 Dec 2011 20:29:43 +0000</pubDate>
					<dc:creator>Another_Guy</dc:creator>

					<description>
						<![CDATA[
						<p>Hi all!</p>
<p>I&#8217;m working on a Rhythm generator which works using two inputed numbers.</p>
<p>Two numbers are multiplied by themselves to create two lists of essentially, times tables. e.g:</p>
<p>3, 6, 9, 12, 15 etc<br />
5, 10, 15, 20   etc </p>
<p>With any combination of numbers eventually two numbers will match. In the example above the number is 15. But the two lists vary in lengths</p>
<p>I want to enter two numbers and count up until the matching number is found.</p>
<p>Any help would be grand!!</p>
<p>Guy</p>
<p>(Using MAX/MSP 5 on Windows 7)</p>
						]]>
					</description>

					
					
				</item>

			
				<item>
					<guid>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218042</guid>
					<title><![CDATA[Re: Counting until two numbers match]]></title>
					<link>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218042</link>
					<pubDate>Fri, 09 Dec 2011 21:29:00 +0000</pubDate>
					<dc:creator>Chris Muir</dc:creator>

					<description>
						<![CDATA[
						<p>I&#8217;m unclear about what you&#8217;re trying to do here. Are you trying to find something like the lowest common denominator between the two numbers?</p>
<p>You use the word count, but where does counting come in?</p>
						]]>
					</description>

					
					
				</item>

			
				<item>
					<guid>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218043</guid>
					<title><![CDATA[Re: Counting until two numbers match]]></title>
					<link>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218043</link>
					<pubDate>Fri, 09 Dec 2011 22:15:05 +0000</pubDate>
					<dc:creator>Another_Guy</dc:creator>

					<description>
						<![CDATA[
						<p>Hi Chris,</p>
<p>Yes, I am trying to find the lowest common denominator!<br />
(apologies for my poor knowledge of maths!!)</p>
<p>In the patch, the user &#8220;counts&#8221; by pressing the green button, this adds the numbers to the coll list.</p>
<p>If I could work out the lowest common denominator of the two numbers then I could use a counting object to bang the green button until the lowest common denominator appears in either list.</p>
<p>Does that make sense? I&#8217;m not very good at penning my thoughts!</p>
						]]>
					</description>

					
					
				</item>

			
				<item>
					<guid>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218044</guid>
					<title><![CDATA[Re: Counting until two numbers match]]></title>
					<link>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218044</link>
					<pubDate>Fri, 09 Dec 2011 23:14:01 +0000</pubDate>
					<dc:creator>seejayjames</dc:creator>

					<description>
						<![CDATA[
						<p>just use [==] ? that would do it. You can match the numbers to each other, or check whether either one equals the LCM, assuming you have a way to easily determine that&#8230;checking whether the numbers &#8220;reduce&#8221; with each other (technically, do they share any prime factors and if so, don&#8217;t count them twice) will take a bit of fiddling with [%] and [/]. If you don&#8217;t have that many psosible combinations, you can just hard-code the LCM&#8217;s manually by figuring them out beforehand.</p>
<p>If you want more than two numbers, try [match]</p>
<p>Sounds like some interesting polyrhyms are on the way&#8230;math and music? yes indeed&#8230;!</p>
						]]>
					</description>

					
					
				</item>

			
				<item>
					<guid>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218045</guid>
					<title><![CDATA[Re: Counting until two numbers match]]></title>
					<link>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218045</link>
					<pubDate>Sat, 10 Dec 2011 07:23:33 +0000</pubDate>
					<dc:creator>Siska Ádám</dc:creator>

					<description>
						<![CDATA[
						<p>Hi,</p>
<p>I made an external that will give you the LCM of two arbitrary integers called <code>[sadam.lcm]</code>, which might help you with this. It is included in my library (see <a href="http://www.sadam.hu/software" rel="nofollow">http://www.sadam.hu/software</a> ).</p>
<p>Hope this helps,<br />
Ádám</p>
						]]>
					</description>

					
					
				</item>

			
				<item>
					<guid>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218046</guid>
					<title><![CDATA[Re: Counting until two numbers match]]></title>
					<link>http://cycling74.com/forums/topic/counting-until-two-numbers-match/#post-218046</link>
					<pubDate>Mon, 12 Dec 2011 12:12:45 +0000</pubDate>
					<dc:creator>Another_Guy</dc:creator>

					<description>
						<![CDATA[
						<p>Thanks for everyones input!</p>
						]]>
					</description>

					
					
				</item>

					
		
	</channel>
	</rss>

