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 polynomials
Search options answers only
not deleted
user 6553
6
votes
Accepted
Deciding whether an integer polynomial has an integer root
(Let's call the root $\xi$, because $n$ here means the degree of the polynomial. That's seriously bugging me about the question.)
The secret is in noticing that it's easy to test if $\xi$ is a root, s …
- 23.8k
1
vote
Search for numerical solutions of underdetermined systems of quadratic equations
This is a bit late for you, perhaps, but it might be worth looking at cylindrical algebraic decomposition. CAD takes a general statement in the real closed fields (i.e. an arbitrary boolean statement …
- 23.8k