Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with rootfinding
Search options answers only
not deleted
user 169474
Algorithms to approximate numerically a root of a nonlinear equation or system: for instance, Newton's method, secant method, bisection, etc.
5
votes
Rigorous estimates on roots of function
If my computations are correct, there is a root of the form $x=1+\sin^2(\frac\theta2)$ with:
$$\theta \in \left(\frac{k\pi}N,\frac{k\pi}N+\frac\pi{2N}\right) \text{ if }k < \frac{N}3-\frac12$$
$$\thet …
- 3,808
7
votes
Square root of prime numbers
My impression is that you have developed $(x_0-\sqrt{S})^{2^n}$ with Newton binomial formula, separated the terms with even index from the terms with odd index to get an expression of the form $A_n-\s …
- 3,808