* ''ordinal numbers'' and ''cardinal numbers''
* numbers with leading zeroes (as well as trailing zeroes)
...
5 KB (854 words) - 09:59, 27 October 2020
'''Ordinal numbers''' (as used in this Rosetta Code task), are numbers that describe the ''position'' of something in a list.
...ext that ordinal numbers will be used, using an English-spelled name of an ordinal number.
...
97 KB (10,583 words) - 03:31, 9 March 2024
:* English is to be used in spelling numbers.
Display the first 201 numbers in the sequence (and the total number of characters in the sentence)
...
110 KB (11,946 words) - 10:39, 6 December 2023
* Find and display the first '''20''' super-Poulet numbers.
;*[[oeis:A050217|OEIS:A050217 - super-Poulet numbers]]
...
29 KB (3,335 words) - 11:52, 14 February 2024
Prime Wolstenholme numbers are Wolstenholme numbers that are prime.
...lass of numbers called Wolstenholme primes that are '''not''' Wolstenholme numbers that are prime. This is not them.)
...
47 KB (4,568 words) - 03:03, 16 April 2024
# Standard. (Ties share what would have been their first ordinal number).
# Modified. (Ties share what would have been their last ordinal number).
...
149 KB (16,602 words) - 10:08, 2 February 2024
...an integer that in a given base is the concatenation of the first n prime numbers written in that base. A base of 10 will be assumed for this task.
* Find and show the first three S-W numbers which are prime.
...
53 KB (5,366 words) - 12:46, 6 February 2024
;*[[oeis:A219117|A219117 - Numbers n such that n^1+n+1, n^2+n+1, n^3+n+1 and n^4+n+1 are all prime]]
A sieve is used to (hopefully) quickly eliminate non-prime 2n+1 numbers - Miller Rabin is used for n^2+n+1 etc. that are larger than the sieve.
...
40 KB (4,208 words) - 22:45, 15 December 2023
...to spell numbers with various options, including spelling the number as an ordinal number.
american = 0 /*express numbers in American notation.*/
...
44 KB (3,634 words) - 19:52, 3 June 2021
...up in several places in set theory. They are closely related to [[Motzkin numbers]], and may be used to derive them.
Riordan numbers comprise the sequence '''a''' where:
...
63 KB (6,246 words) - 05:38, 20 January 2024
A sieve is used to (hopefully) quickly eliminate non-prime n+2 and 2n+1 numbers - Miller Rabin is used for n^2+n+1 etc. that are larger than the sieve.
...ossibly because even numbers are excluded and the n+2 test eliminates more numbers before the higher powers must be calculated..
...
43 KB (4,905 words) - 11:38, 24 January 2024
For numbers such as 100 or 1000, the equivalent English should be taken as 'one hundred
1. Find and show here the first 50 qualifying numbers.
...
84 KB (5,319 words) - 21:51, 26 May 2024
{{task|Ordinal numbers}}
...umber followed by an apostrophe then the [[wp:Ordinal number (linguistics)|ordinal suffix]].
...
166 KB (21,862 words) - 11:11, 8 April 2024
...harmonic number is the sum of the reciprocals of the first '''n''' natural numbers:
The series of harmonic numbers thus obtained is often loosely referred to as the harmonic series.
...
111 KB (9,829 words) - 17:57, 25 April 2024
Clearly all odd primes '''p''' must be arithmetic numbers because their only divisors are '''1''' and '''p''' whose sum is even and h
1. The first 100 arithmetic numbers.
...
116 KB (11,243 words) - 20:22, 7 May 2024
...'n''', '''m''') and value of at least the first 6 terms of the sequence of numbers that are both the sum of the first '''n''' primes and the first '''m''' com
;* [[oeis:A053767|OEIS:A053767 - Sum of first n composite numbers]]
...
50 KB (5,451 words) - 18:11, 16 January 2024
{{draft task|Prime Numbers}}
say "\nNumber of words whose ordinal sum is prime: ",
...
42 KB (5,705 words) - 22:34, 13 April 2024
(All numbers herein are expressed in base ten.)
func ordinal(n: int): string =
...
70 KB (8,328 words) - 19:25, 11 March 2024
Convert text spelled-out numbers from 1 to 999
Numbers = {"fourteen": "14", "sixteen": "16", "seventeen": "17", "eighteen": "18",
...
78 KB (11,026 words) - 10:30, 7 November 2023
{{Draft task|Prime
Numbers}}
In mathematics, '''Erdős primes''' are prime
numbers such that all p-k! for 1<=k!<p are composite.
...
57 KB (6,595 words) - 14:16, 10 April 2024
