User talk:Waldorf: Difference between revisions
Content added Content deleted
(Fine by me...) |
(New section: Lucas-Lehmer test) |
||
Line 11: | Line 11: | ||
::Finally, I would like to develop a task to demonstrate how to make a data type that acts like a primitive data type but has programmer-defined characteristics such as a limited range of valid values. This task would include a demonstration, or discussion if the capability is built into the language, of how to implement the required range checking. |
::Finally, I would like to develop a task to demonstrate how to make a data type that acts like a primitive data type but has programmer-defined characteristics such as a limited range of valid values. This task would include a demonstration, or discussion if the capability is built into the language, of how to implement the required range checking. |
||
:::Sounds good to me. I'm not holding you back. I don't want to hold anyone back, really; This site grows as people add tasks. Of all the content on Rosetta Code, only around 10% was originally mine. --[[User:Short Circuit|Short Circuit]] 19:17, 26 February 2007 (EST) |
:::Sounds good to me. I'm not holding you back. I don't want to hold anyone back, really; This site grows as people add tasks. Of all the content on Rosetta Code, only around 10% was originally mine. --[[User:Short Circuit|Short Circuit]] 19:17, 26 February 2007 (EST) |
||
== Lucas-Lehmer test == |
|||
Hi,... |
|||
I'm not an ADA producer... but I think that your program may be |
|||
able to get a bit further if you changed the following line: |
|||
MP : Long_Long_Integer := 2**Item - 1; |
|||
To (in hybrid Ada/C at least): |
|||
MP : Long_Long_Integer := 2ULL**Item - 1; |
|||
Cheers [[User:NevilleDNZ|NevilleDNZ]] 02:50, 16 February 2008 (MST) |