Unique Factorization Theorem

Alright, let's start having some maths fun with this blog 😉!

This first post ought to be bread and butter for math and computer science majors, but I think it's something pretty cool for the intellectually curious anyway!

Consider this: Every integer n > 1 can be represented as a product of prime factors in only one way, apart from the order of the factors.

That's crisp! Isn't it?

The above is known as the Unique Factorization Theorem. (It's also called the Fundamental Theorem of Arithmetic - that's how important this result is considered.)

Let me know using an appropriate reaction emoticon in the comments fields below if you can prove this theorem. If not right away, then take your time - no hurries 😉!

Comments

Popular posts from this blog

Irrationally yours, e!

The Neighborhood of Infinity