Talk:Carmichael 3 strong pseudoprimes: Difference between revisions

From Rosetta Code
Content added Content deleted
(→‎listing in ascending order: added a comment about perusing. -- ~~~~)
(→‎listing in ascending order: added a tidbit about Carmichael numbers being odd. -- ~~~~)
Line 1: Line 1:
==clarification of Carmichael 3 strong pseudomprimes==
== listing in ascending order==

One small tidbit. Carmichael numbers can't be even, so '''Prime1''' could be described as any '''odd''' prime ...

This would make some programs a wee bit faster starting at 3 instead of 2. -- [[User:Gerard Schildberger|Gerard Schildberger]] 06:58, 11 December 2012 (UTC)

==listing in ascending order==


I was thinking about listing the triplets in ascending order.
I was thinking about listing the triplets in ascending order.

Revision as of 06:58, 11 December 2012

clarification of Carmichael 3 strong pseudomprimes

One small tidbit. Carmichael numbers can't be even, so Prime1 could be described as any odd prime ...

This would make some programs a wee bit faster starting at 3 instead of 2. -- Gerard Schildberger 06:58, 11 December 2012 (UTC)

listing in ascending order

I was thinking about listing the triplets in ascending order. It would be a nice feature when showing the results. -- Gerard Schildberger 22:07, 10 December 2012 (UTC)

Implemented. It does make the reading of the Carmichael numbers much easier to peruse. -- Gerard Schildberger 06:47, 11 December 2012 (UTC)

Python issues?

Having had two languages base their entries on the Python but mention with changes I thought I should ask what it is I have done wrong. (I'm braced, go ahead...)
--Paddy3118 06:02, 11 December 2012 (UTC)