;Related Task: [[Twin primes]]
printfn $"There are %d{rP 1000000|>Seq.pairwise|>Seq.filter(fun(n,g)->n=g-2)|>Seq.length} twins in
...
41 KB (5,112 words) - 11:40, 3 March 2024
;Related task:
=={{header|D}}==
...
15 KB (2,006 words) - 10:47, 17 November 2023
"D " - 1
;* [[Sorensen–Dice_coefficient|Related task: Sorensen–Dice coefficient]]
...
63 KB (8,859 words) - 18:11, 10 May 2024
=={{header|D}}==
<syntaxhighlight lang="d">import std.algorithm;
...
61 KB (7,948 words) - 18:57, 3 February 2024
...ffect its related hardware, or affect the contents of other ports that are related to that hardware. (This isn't a property of the 6502 itself, but of the har
...reference the address register's value, no crash will occur. Otherwise you'd never be able to load byte data! As mentioned before, dereferencing an odd
...
13 KB (2,121 words) - 10:42, 4 February 2024
;Related task
d := Matrix{{4, -3, 4.0 / 3, -1.0 / 4}, {-13.0 / 3, 19.0 / 4, -7.0 / 3, 11.0
...
79 KB (9,971 words) - 11:00, 10 February 2024
;Related:
counts[j] := UserInt( SysUtils.Format('How many in column %d?',
...
56 KB (6,065 words) - 20:41, 6 April 2024
PR read "rows.incl.a68" PR # row related utilities #
printf("sum=%d\n",sum)
...
58 KB (5,955 words) - 10:44, 28 April 2024
;Related tasks:
printf("%2d: %d\n",i,sylvester)
...
57 KB (5,294 words) - 09:03, 14 February 2024
; Related tasks
printf("a(%d) has m = %llu\n", n, m);
...
67 KB (7,391 words) - 12:26, 17 November 2023
;See related
| ($b2 * $a1 - $b1 * $a2 ) as $d
...
37 KB (4,846 words) - 09:21, 31 May 2024
closely related to [[Bell numbers]], and may be derived from them.
;Related Tasks:
...
88 KB (7,360 words) - 14:35, 25 March 2024
{{math|''x<sub>k+1</sub>'' = ''x<sub>k</sub>'' + ''d<sub>k</sub>'' * ''p<sup>k</sup>'' }}
with {{math|''d<sub>k</sub>'' = –(''f''(''x<sub>k</sub>'') / ''p<sup>k</sup>'
...
62 KB (7,520 words) - 10:49, 25 April 2024
;Related:
FOR d FROM lowest digit[ w ] TO 9 DO
...
70 KB (7,722 words) - 08:59, 7 May 2024
"^(.*?)\\s(\\d+$|\\d+.*$|II*$)"))
...arExpressions.Regex.Match(g,@"(\s\d+[-/]\d+)|(\s(?!1940|1945)\d+[a-zI. /]*\d*)$") in if n.Success then Some(g.[0..n.Index],n.Value) else None
...
83 KB (7,756 words) - 11:23, 4 February 2024
...persequence|shortest common supersequence]]''' is a problem closely related to the [[longest common subsequence]], which you can use as a
=={{header|D}}==
...
37 KB (5,198 words) - 19:42, 27 February 2024
=={{header|D}}==
<syntaxhighlight lang="d">module tempfile ;
...
34 KB (4,521 words) - 10:38, 4 February 2024
...debug, input, and output. Debug is an implementer depended switch such as -d or --debug to allow the user to pick between the commands vanishing from th
;Related Tasks
...
70 KB (8,477 words) - 19:29, 30 May 2024
;* [[Circular primes|Related task: Circular primes]]
...16]|>List.iter(fun n->printf $"Base %d{n}: "; rUnitP(n)|>Seq.iter(printf "%d "); printfn "")
...
37 KB (3,321 words) - 04:38, 3 February 2024
;Related task
d = 5
...
49 KB (5,756 words) - 09:39, 10 March 2024
