On Sun, Jan 18, 2009 at 6:11 PM, Gregor Lingl <span dir="ltr"><<a href="mailto:gregor.lingl@aon.at">gregor.lingl@aon.at</a>></span> wrote:<br><blockquote style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;" class="gmail_quote">
This exposes in my opinion an unsurmountable dilemma, namely<br>
that usually you cannot meet even those few criteria mentioned<br>
in the beginning in a single solution.</blockquote><div><br>I think it's OK that there's not a 'single' solution. If I saw math students interested in coming up with their own ways to generate primes, even if not optimized, wow, I'd be thrilled.<br>
<br>I gave my math students the opportunity to do end of semester projects using either Python or <a href="http://www.geogebra.org/cms/">GeoGebra</a>. One kid emailed me saying he had figured out a way to generate any number of rows of Pascal's triangle using Python, and he wanted to know if this would be an OK kind of project. I found that really interesting given the topics in this thread occurring simultaneously. I replied to him "Absolutely!" I haven't seen his code yet, but I'm really glad that this is what he wanted to explore.<br>
</div>