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 ra.rings-and-algebras
Search options not deleted
user 10416
Non-commutative rings and algebras, non-associative algebras, universal algebra and lattice theory, linear algebra, semigroups. For questions specific to commutative algebra (that is, rings that are assumed both associative and commutative), rather use the tag ac.commutative-algebra.
17
votes
4
answers
1k
views
Why are polynomials easier to handle with than integers?
This may seems to be an elementary question, but I found no answers on MO nor google.
I have always heard "polynomials are easier to handle with than integers". For example:
When $n$ is quite large …
- 191