query: Finding double roots with While-loop
positive_passages.docid: 10889
positive_passages.text: Mod[1.2, 0.2] is not equal to zero
negative_passages.docid: 107765
negative_passages.text: Prove that there exists two roots in $[-1,1]$
negative_passages.docid: 82866
negative_passages.text: Calculating roots with bc_math or GMP
negative_passages.docid: 82462
negative_passages.text: Square Root Algorithm
negative_passages.docid: 146274
negative_passages.text: Fastest way to do this double summation?
negative_passages.docid: 143466
negative_passages.text: Roots of functions / polynomials
negative_passages.docid: 118244
negative_passages.text: An $n$th root inequality: $\sqrt[n]{n} < 1 + \sqrt{2/n}$
negative_passages.docid: 91441
negative_passages.text: What is the scope of a 'while' and 'for' loop?
negative_passages.docid: 107089
negative_passages.text: finding rational roots of polynomials
negative_passages.docid: 3955
negative_passages.text: Square roots -- positive and negative
negative_passages.docid: 62370
negative_passages.text: Why are the return values of these doubles -1.#IND?
negative_passages.docid: 37614
negative_passages.text: Double Subscript for Subsequences
negative_passages.docid: 14773
negative_passages.text: Finding distinct solutions for the equation
negative_passages.docid: 139466
negative_passages.text: How to test if a double is an integer
negative_passages.docid: 147899
negative_passages.text: Why does Math.floor return a double?
negative_passages.docid: 157417
negative_passages.text: Understanding the definition of a multiple (double) root
negative_passages.docid: 137741
negative_passages.text: Computing the square root function with Newton's method