-
7 KB (886 words) - 19:39, 7 December 2021
...(MP) of a number, <math>n</math>, is calculated rather like the [[Digital root]] except digits are multiplied instead of being added:
...athworld.wolfram.com/MultiplicativeDigitalRoot.html Multiplicative Digital Root] on Wolfram Mathworld.
...
127 KB (11,834 words) - 17:24, 9 April 2024
-
898 bytes (124 words) - 18:56, 23 February 2021
...piled with <code>gcc -Ofast -msse</code> on my machine, looping over <code>root(x, 15)</code> a million times actually became marginally slower after your
...ot (such as raising a number to a fractional power: x ** (1/n) for the nth root of x).
...
5 KB (828 words) - 13:55, 1 May 2020
...number <big>''A''</big>, as explained at the [[wp:Nth root algorithm|Wikipedia page]].
<syntaxhighlight lang="360asm">* Nth root - x**(1/n) - 29/07/2018
...
119 KB (14,144 words) - 09:04, 18 June 2024
: The new interpretation of WP text is incorrect. Digital root of 9 is 9, while WP text only says it acts "as a kind of zero", not literal
...
3 KB (524 words) - 13:03, 13 September 2021
The digital root, <math>X</math>, of a number, <math>n</math>, is calculated:
The task is to calculate the additive persistence and the digital root of a number, e.g.:
...
153 KB (17,527 words) - 16:26, 2 March 2024
#REDIRECT [[Nth root]]
...
22 bytes (3 words) - 13:56, 6 February 2010
#REDIRECT [[Talk:Nth root]]
...
27 bytes (4 words) - 13:56, 6 February 2010
-
1 KB (212 words) - 20:11, 26 September 2016
Compute the [[wp:Root mean square|Root mean square]] of the numbers 1..10.
The ''root mean square'' is also known by its initials RMS (or rms), and as the
...
66 KB (8,302 words) - 10:23, 29 December 2023
 | (545 × 297 (33 KB)) - 18:20, 11 March 2024 |
 | (486 × 74 (6 KB)) - 18:21, 11 March 2024 |
 | (338 × 334 (22 KB)) - 18:21, 11 March 2024 |
#REDIRECT [[Square root by hand]]
...
33 bytes (5 words) - 14:09, 7 November 2020
#REDIRECT [[Talk:Square root by hand]]
...
38 bytes (6 words) - 14:09, 7 November 2020
...much of a stress test that really is.. (my maths is so crap I expected the root would have to be accurate to maybe 200dp, or at least 150dp, but apparently
...
4 KB (525 words) - 06:02, 2 August 2021
...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
-
27 bytes (3 words) - 23:52, 22 June 2016
<br>2,001 decimal digits of the square root of 2
Or ... root of two ?
...
3 KB (458 words) - 06:11, 11 May 2016
...mittedly is only practically going to happen on Windows; Unix has a single root and that's unlikely to ever be empty in practice given that you're running
:Every root directory I have ever seen contains <code>..</code> -- in root directories, <code>..</code> and <code>.</code> are the same. --[[User:Rdm
...
662 bytes (104 words) - 18:26, 3 January 2012
#REDIRECT [[Nth root]]
...
22 bytes (3 words) - 13:56, 6 February 2010
...ng the [[Digital root]] of ng is the [[Digital root]] of n + the [[Digital root]] of g. Putting this together:
Digital root of 2<sup>n</sup> 2 4 8 7 5 1 2 4 8 ....
...
978 bytes (153 words) - 16:27, 15 September 2022
#REDIRECT [[Talk:Nth root]]
...
27 bytes (4 words) - 13:56, 6 February 2010
#REDIRECT [[Averages/Root mean square]]
...
39 bytes (5 words) - 07:58, 20 February 2010
#REDIRECT [[Square root by hand]]
...
33 bytes (5 words) - 14:09, 7 November 2020
#REDIRECT [[Talk:Square root by hand]]
...
38 bytes (6 words) - 14:09, 7 November 2020
<br>2,001 decimal digits of the square root of 2
Or ... root of two ?
...
3 KB (458 words) - 06:11, 11 May 2016
protected Node<T> Root;
Root = null;
...
10 KB (1,018 words) - 05:32, 9 March 2018
...y, it is to implement the quadratic residue method of computing the square root. --[[User:Enter your username|Enter your username]] ([[User talk:Enter your
...''exactly'' this operation, but it is not even close to this task's square root method (quadratic residue).
...
3 KB (444 words) - 21:20, 15 December 2022
...rt of [http://en.wikipedia.org/wiki/Root_finding#Specific_algorithms named root finding algorithm] like bisection, regula falsi, or Newton's method (he has
...
2 KB (258 words) - 05:06, 10 June 2008
inline void RotateLeft(Node*& Root)
Node* Parent = Root->Parent;
...
30 KB (3,502 words) - 16:06, 29 August 2022
...i>two</i> files and directories, one that is 'here' and one that is in the root? This is truly unclear to me.[[User:Sgeier|Sgeier]] 01:08, 8 April 2007 (ED
...
984 bytes (173 words) - 13:19, 6 February 2010
oct_node node_insert(oct_node root, unsigned char *pix)
if (!root->kids[i])
...
7 KB (1,268 words) - 11:49, 27 October 2022
// rotate a subtree according to dir; if new root is nil, old root is freed
struct node *root = *rootp;
...
23 KB (2,577 words) - 16:03, 29 August 2022
...parent pointers. In 2006, the algorithms were made bottom/up (i.e. leaf to root) and the recursion was abolished (using parent pointers). These algorithms
...
1 KB (214 words) - 15:59, 11 April 2017
<span style="color: #004080;">integer</span> <span style="color: #000000;">root</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;"
<span style="color: #000000;">root</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;"
...
73 KB (8,926 words) - 15:12, 29 August 2022
static void RotateLeft(ref Node Root)
Node Parent = Root.Parent;
...
35 KB (3,139 words) - 16:04, 29 August 2022
...e able to multiply two continued fractions if we are to compute the square root of a number represented as a continued fraction. The best we can do here is
...
2 KB (373 words) - 14:00, 7 November 2020
void LeftNodeSwap(Node^ Root, Node^ Replace)
if (Replace->Left) Replace->Left->Parent = Root;
...
51 KB (5,631 words) - 16:08, 29 August 2022
