Timeline for Why are polynomials easier to handle with than integers?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2010 at 9:19 | history | edited | Denis Serre | CC BY-SA 2.5 |
addition of an example
|
| Oct 29, 2010 at 16:20 | comment | added | Laurent Moret-Bailly | These probabilities are related to the finiteness of the residue fields at maximal ideals. The analogue is true in $F[X]$ where $F$ is a finite filed: if it has $q$ elements, and $P$ has degree $d$, the probability of a random polynomial to be a multiple of $P$ is $q^{-d}$. | |
| Oct 29, 2010 at 10:46 | comment | added | Denis Serre | Yes, that's the point. | |
| Oct 29, 2010 at 10:18 | comment | added | zhaoliang | To summary, shall we say it's because polynomials are "data structures" on which we have more operations, such as differentials, mod p, decompositons over various entended fields...etc ? | |
| Oct 29, 2010 at 9:04 | history | answered | Denis Serre | CC BY-SA 2.5 |