v : square root
...
93 members (3 subcategories, 0 files) - 15:08, 21 November 2014
var root = start
while (root*2 + 1 <= end) {
...
24 KB (3,161 words) - 11:50, 3 November 2023
F assign(Int u, root) -> Void
@c[u] = root
...
53 KB (6,660 words) - 08:33, 7 May 2024
: [[User:Root|Root]] ([[User talk:Root|talk]]) 11:55, 3 February 2021 (UTC)
::: [[User:Root|Root]] ([[User talk:Root|talk]]) 13:37, 3 February 2021 (UTC)
...
12 KB (1,938 words) - 17:07, 4 February 2021
‑‑[[User:Root|Root]] ([[User talk:Root|talk]]) 23:56, 4 March 2022 (UTC)
...
5 KB (848 words) - 10:09, 5 March 2022
*[http://rosettacode.org/wiki/Digital_root#AutoHotkey Digital root]
...
5 KB (695 words) - 18:56, 7 July 2016
...ram that will calculate '''n''' decimal digits of the square root of a non─negative number.
// Square Root of n 'By Hand' (n as bigint >= 1). Nigel Galloway: October 14th., 2020
...
101 KB (8,505 words) - 16:08, 9 February 2024
:* the paths from the root to the leaves have a one-to-one relationship with the suffixes of <math>S</
:* and all internal nodes (except perhaps the root) have at least two children.
...
12 KB (2,079 words) - 23:33, 20 August 2015
root *x // up, down, col fields unused
cells: make([]x, estCells+1), // +1 to use as the root
...
7 KB (1,190 words) - 04:40, 21 June 2023
...oach: for each leaf node I would compute a polyline which reaches from the root to that leaf. Most of the work for each polyline could then be computed in
...segment here because I will be taking on another segment (leading from the root) later:
...
9 KB (1,474 words) - 14:25, 20 January 2022
in a root, r, is computed using the formula (dY / (dP/dX)(r)) except
# Attempt to find a real root of a polynomial using Newton's method from
...
35 KB (4,104 words) - 21:31, 17 December 2023
...ot of seven. But the result here would still be invalid because the square root of seven is still not an integer. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]
...gaussian integer), but in this case ω is an irrational number (the square root of a non-square), so you can't use mod 13 on the values you multiply it by.
...
12 KB (2,029 words) - 21:27, 16 June 2019
...clash here between the description's talk of 'a Tree' (suggesting a single root), and the examples of target output, which show forests (lists of trees), w
...level one siblings) which might be called '''level 0'''. (See the Nothing root in the Haskell tree diagrams)
...
12 KB (1,862 words) - 15:24, 8 February 2021
SetNode<T> Root;
if (Root == null)
...
90 KB (9,789 words) - 23:29, 11 October 2020
root *Node
node.suffixLink = root
...
82 KB (9,443 words) - 09:57, 15 February 2024
# Write three simple functions: root, addOne, and half
...tions (starting with the initial value, and followed by the application of root, etc.)
...
50 KB (6,561 words) - 19:40, 31 March 2024
Root,
Root,
...
34 KB (4,125 words) - 16:16, 29 August 2022
:::: Idle musing...say you've got a scenario where your root may not be rational. If greater precision in the results may be needed late
...aluating it, and later logic may simply eliminate that function, hence the root, altogether, then good, lots of work saved; but if you are forced to take a
...
7 KB (1,058 words) - 22:49, 10 May 2020
...1 to N-1, two zeros, then N zeros. Find the integer ceiling of the square root and square it. The resulting number will always start with the digits 1 to
# the repeated digit sum for each root and square,
...
40 KB (6,557 words) - 13:35, 7 November 2020
:Hmmm...it's doing that because it reorganizes based on the root list elements (C and J, in this case) so it keeps families of sub-language
...
2 KB (370 words) - 01:20, 26 June 2010
