Skip to main content
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
Search options not deleted user 157462

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.

8 votes
3 answers
604 views

Is it possible to create a polynomial $p(x)$ with this relation between $p(0)$ and $p(c)$?

Given $b$ and $c$ with $b,c>1$, is it possible to construct a polynomial $p(x)$, whose degree is $n$ for all $c$ and $b$, such that: $|p|$ is strictly increasing on $[1,c]$ and $|b \cdot p(c)| < |p( …
DUO Labs's user avatar
  • 265
2 votes
2 answers
151 views

Is it possible to create a polynomial $p(x)$ with this relation between $p(0)$ and $p(c)$? -...

Note: This question is based on a previous question I was continuing my research from last time, and I realized my question was too strict! Instead of the polynomial being strictly increasing, it only …
DUO Labs's user avatar
  • 265