Prove that if does not divide , then does not divide . This isn't actually homework or anything, just a hypothesis I observed.
Follow Math Help Forum on Facebook and Google+
Assuming that are positive integers, any prime factor of must also be a prime factor of . Can you use that to finish your question?
Originally Posted by DivideBy0 Prove that if does not divide , then does not divide . This isn't actually homework or anything, just a hypothesis I observed. Here is a little bad proof, but it makes sense. Now, is not a whole number. So raised to any number it is not a whole number.
Originally Posted by ThePerfectHacker Here is a little bad proof, but it makes sense. Now, is not a whole number. So raised to any number it is not a whole number. Hahaha, awesome!
Originally Posted by DivideBy0 Hahaha, awesome! Ahhhh... But what TPH didn't tell you is that you have to be careful of the following trap: is not a whole number. But is. What you would need to show is something like that cannot be expressed as a rational number . -Dan
View Tag Cloud