I&#39;m messing about with Project Euler problems and have noticed some behavior that I don&#39;t understand. �This one happens to be very self-contained so I though I&#39;d as for assistance.<div><br></div><div>This code (which doesn&#39;t solve the problem, btw) is buggy, but I can&#39;t see the bug and I&#39;m beginning to suspect something in the VM or the class libraries. When I execute it, two odd things happen:</div>
<div><br></div><div>First, in spite of the block test [sum &lt; 100] whileTrue:[...] �it continues to run when sum &gt; 100 (or a million for that matter). �</div><div><br></div><div>Second, the block in the line:</div><div>
<span class="Apple-tab-span" style="white-space:pre">	</span>(sum isPrime)�ifTrue: [�(seq size &gt; bestSeq size) ifTrue: [ bestSeq := seq copy.]]</div><div>executes even when sum is not a prime number.</div><div><br></div>
<div>Any help is appreciated.�</div><div>-------------------------------</div><div>&quot;Create a list of primes smaller than a million&quot;</div><div><div>primes := OrderedCollection new.</div><div>2 to: 999999 do: [ :n | n isPrime ifTrue: [ primes add: n]].</div>
<div><br></div><div>bestSeq := OrderedCollection new.</div><div>seq := OrderedCollection new.</div><div>sum := 0.</div><div>[sum &lt; 100] whileTrue: [</div><div><span class="Apple-tab-span" style="white-space:pre">	</span>primes do: [:prime |�</div>
<div><span class="Apple-tab-span" style="white-space:pre">		</span>seq add: prime.</div><div><span class="Apple-tab-span" style="white-space:pre">		</span>sum := seq sum.</div><div><span class="Apple-tab-span" style="white-space:pre">		</span>(sum isPrime)�ifTrue: [�(seq size &gt; bestSeq size) ifTrue: [ bestSeq := seq copy.]]</div>
<div><span class="Apple-tab-span" style="white-space:pre">		</span>]</div><div><span class="Apple-tab-span" style="white-space:pre">	</span>].</div></div>