Show that every positive integer n has a unique expression of the form n=2rm,r greater or equal 0, m a postive odd integer
Last edited by mr fantastic; September 6th 2009 at 02:43 AM. Reason: Moved from another thread
Follow Math Help Forum on Facebook and Google+
From the "Unique-Prime-Factorization Theorem" we can write . Now let r be a number such that but and let . Then , where and m is odd from the construction of r. This is a unique expression from the "Unique-Prime-Factorization Theorem".
View Tag Cloud