Search results

View ( | ) (20 | 50 | 100 | 250 | 500)
  • ...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
  • 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
  • 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
  • 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
  • Analogous to square roots, we may also calculate a triangular root. Numbers that have an integer triangular root are triangular numbers. ...
    73 KB (6,213 words) - 15:32, 14 February 2024
  • * Except for the root, every internal node has at least two children. ...obtained by concatenating all the string labels found on the path from the root to leaf i spells out suffix S[i..n], for i from 1 to n. ...
    60 KB (6,917 words) - 09:05, 7 May 2024
  • ...imaginary = new Node(-1, null, this.count++, 1); // also called odd length root node ...= new Node(0, this.imaginary, this.count++, 2); // also called even length root node ...
    84 KB (10,467 words) - 08:49, 7 May 2024
  • ...oot? ( n -- ? ) 1 - 9 mod 1 + prime? ; ! is the digital root prime? ...he sum of the hashcode of her name and the sailor's name has a prime digit root ...
    36 KB (4,916 words) - 21:58, 29 March 2024
  • <root> </root> ...
    63 KB (7,381 words) - 06:06, 15 June 2024
  • root::RBTreeNode{K} rb.root = rb.nil ...
    15 KB (1,896 words) - 08:23, 5 September 2022
  • Dim root As RBNode Ptr This.root = This.sentinel ...
    42 KB (5,362 words) - 19:04, 18 June 2023
  • cout << "The root nodes of Heap are: " << endl; function extractmin(root::FibonacciHeap) ...
    126 KB (16,196 words) - 12:02, 4 December 2023
  • root : &dlnode a? >> dlnode a) root := get_head lst; ...
    74 KB (9,707 words) - 12:33, 8 February 2024
  • REAL root = sqrt( n ); root = ENTIER root ...
    27 KB (3,159 words) - 16:39, 3 April 2024
  • ...mate [[wp:Hensel%27s_lemma#Hensel's_lemma_for_p-adic_numbers|p-adic square root]]. To check the result, square the root and construct rational m/n to compare with radicand a/b. ...
    62 KB (7,520 words) - 10:49, 25 April 2024
  • once "here", i.e. in the current working directory and once in the filesystem root. (In unix-type systems, only the user root would have ...
    54 KB (7,262 words) - 11:44, 2 February 2024
  • ...IS article: &nbsp; [http://oeis.org/A78403 A78403 Primes such that digital root is prime]. ...xhighlight lang="algol68">BEGIN # find nice primes - primes whose digital root is also prime # ...
    56 KB (5,941 words) - 17:48, 12 May 2024
View ( | ) (20 | 50 | 100 | 250 | 500)