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 not deleted
user 4354
Questions in which polynomials (single or several variables) play a key role. It is typically important that this tag is combined with other tags; polynomials appear in very different contexts. Please, use at least one of the top-level tags, such as nt.number-theory, co.combinatorics, ac.commutative-algebra, in addition to it. Also, note the more specific tags for some special types of polynomials, e.g., orthogonal-polynomials, symmetric-polynomials.
9
votes
Accepted
Growth of the "cube of square root" function
Here is a proof that $|g(n)|\le 1$ for all but finitely many $n$. You can extract an explicit bound for $n$ from the argument and check the smaller values by hand.
If $f(n)=n^{3/2}$ without the floor …
- 32.4k
10
votes
Accepted
A decision problem concerning Diophantine inequalities
It is undecidable. If you could solve this, you could also solve Hilbert's 10th problem.
Suppose we have an algorithm solving your problem for all $n$. Given a polynomial $p\in\mathbb[x_1,\dots,x_n]$, …
- 32.4k