- Joined
- Feb 15, 2007
- Messages
- 2,340
- Reaction score
- 653
If you can solve the problem in my signature adequately, I will teach you any programming language you want.
Good luck.
Good luck.
Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature currently requires accessing the site using the built-in Safari browser.
Is Q[x] simply the ring of rational numbers?
[1 1 5 | 19] [1 0 0 | 1]
[0 1 4 | 15] ~ [0 1 0 | 3]
[0 1 3 | 12] [0 0 1 | 3]
Its irreducible because if my polynomial is
f(x) = x^3-3x^2-3x-1
which is in Q[x], which is simply the group of all polynomial whose coefficients are rational numbers, I guarantee you their are no two polynomials g(x) and h(x) also in Q[x] such that
f(x) = g(x)h(x)
Yeah. Abstract/Modern Algebra is a lot of fun. I remember the response a lot of people had when a professor I had in college said his research is in Algebra and people are like "Wow, I learned algebra in high school and this guy still doesn't know it." And some of these people were Mathematics majors.
Thanks for the reading. This was the most interesting thread I have seen in a long time.