{{task|Prime Numbers}}
...be modified to greatly reduce its space requirement, making it unsuitable for very large limits.
...
49 KB (6,291 words) - 14:56, 25 February 2024
...r''' is a composite number '''n''' which is such that each of its distinct prime factors
All known Giuga numbers are even though it is not known for certain that there are no odd examples.
...
70 KB (8,568 words) - 08:55, 24 April 2024
So for your convenience, here's a break-down:
...the number <tt>X+Y</tt>, the product has in turn ''more than one'' product decomposition.
...
104 KB (14,526 words) - 22:18, 27 February 2024
'''Jordan-Pólya numbers''' (or '''J-P numbers''' for short) are the numbers that can be obtained by multiplying together one or
...sition into factorials in highest to lowest order. Optionally, do the same for the '''1,050'''th J-P number.
...
100 KB (11,286 words) - 19:11, 29 March 2024
{{Task|Prime Numbers}}
<big> • </big> partition '''99809''' with 1 prime.
...
115 KB (12,744 words) - 08:02, 19 May 2024
{{task|Prime Numbers}}
As of this writing, (mid 2019), there are only five known prime Fermat numbers, the first five ('''F<sub>0</sub>''' through '''F<sub>4</sub
...
125 KB (10,905 words) - 05:43, 10 May 2024
10001th prime
Active Directory/Search for a user
...
36 KB (5,085 words) - 17:23, 24 September 2022
{{task|Prime Numbers}}
The prime decomposition of a number is defined as a list of prime numbers
...
200 KB (21,264 words) - 15:17, 1 June 2024
{{task|Prime Numbers}}
For maximum compatibility, this program uses only the basic instruction set (S/
...
165 KB (20,577 words) - 16:24, 14 March 2024
{{task|Prime Numbers}}
Trial division is an algorithm where a candidate number is tested for being a prime by trying to divide it by other numbers.
...
119 KB (12,980 words) - 11:28, 4 February 2024
...function taking a positive integer and returns the [[Hailstone sequence]] for that number.
:: 2. Use the routine to show that the hailstone sequence for the number 27 has 112 elements starting with 27, 82, 41, 124 and ending wit
...
80 KB (10,386 words) - 17:01, 30 November 2023
An [[wp:Abundant_number|Abundant number]] is a number '''n''' for which the ''sum of divisors'' '''σ(n) > 2n''',
...niteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors (LE Dickson)
...
254 KB (21,091 words) - 17:13, 10 March 2024
{{task|Prime Numbers}}
...automatically adjust to accommodate the generation of any reasonably high prime.
...
279 KB (35,792 words) - 15:18, 3 December 2023
See [[Rosetta_Code/Rank_languages_by_popularity/Full_list]] for a full language/task completion table.
| [[Loops%2FFor|Loops/For]]
...
193 KB (14,594 words) - 00:11, 2 June 2024
See [[Rosetta_Code/Rank_languages_by_popularity/Full_list]] for a full language/task completion table.
| [[Loops%2FFor|Loops/For]]
...
190 KB (14,571 words) - 00:11, 2 June 2024
See [[Rosetta_Code/Rank_languages_by_popularity/Full_list]] for a full language/task completion table.
| [[Loops%2FFor|Loops/For]]
...
197 KB (14,609 words) - 00:10, 2 June 2024
Full output for the [[Rosetta Code/Count examples#Raku]] task. Updated periodically.
Languages that omit a certain task have an uppercase O filled in for that task.
...
205 KB (14,674 words) - 00:10, 2 June 2024
Full list output from the Raku entry for [[Rosetta Code/List authors of task descriptions]]. Updated periodically.
...a_Code/List_authors_of_task_descriptions/Full_list#Thundergnat]] to search for the tasks entered by [[User:Thundergnat|Thundergnat]].
...
400 KB (46,932 words) - 00:10, 2 June 2024
...different ways. Each piece of code should be iterated enough that it runs for at least one second.
** Show how to run a profiler for a program written in your language. The program that's profiled should be
...
88 KB (13,169 words) - 01:53, 1 August 2023
...shuffle]] (a.k.a. the Fisher-Yates shuffle) is an algorithm for randomly shuffling the elements of an array.
Implement the Knuth shuffle for an integer array (or, if possible, an array of any type).
...
160 KB (19,601 words) - 16:15, 17 March 2024
