For this problem u will get lots of solutions on the net.<div>e.g wilson's theorem , sieve of eranthoses etc.</div><div><br></div><div>--nitin<br><br><div class="gmail_quote">On Sat, Aug 21, 2010 at 7:05 PM, Roelof Wobben <span dir="ltr"><<a href="mailto:rwobben@hotmail.com">rwobben@hotmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div>
Hello, <br>
<br>
I have to make a programm which can test if a number is a prime.<br>
I know a prime is a number which can only be diveded by 1 and itself.<br>
<br>
One way is was thinking about is to make a loop which try if % has output 0.<br>
But that don't work.<br>
<br>
Can someone give me a hint what's the best approach is.<br>
<br>
Roelof<br>
<br> </div>
<br>_______________________________________________<br>
Tutor maillist - <a href="mailto:Tutor@python.org">Tutor@python.org</a><br>
To unsubscribe or change subscription options:<br>
<a href="http://mail.python.org/mailman/listinfo/tutor" target="_blank">http://mail.python.org/mailman/listinfo/tutor</a><br>
<br></blockquote></div><br></div>