
February 1st, 2008, 05:46 AM
|
 | Bar0n | | Join Date: Apr 2007 Location: South African Republic
Posts: 1,959
Country: Thanks: 1,605
Thanked 1,421 Times in 869 Posts
| |
Quote:
Originally Posted by Skinner Let me have a try:
problem:
1)Let  prove that  is not an integer.
Solution:
If you can prove that  is not an integer, then you can prove that  is not an integer.
Why? if you add 1 to anything that's not an integer, you get a non-integer value.
look at this function:
This rational function has asymptopes at the integers, which means that at every integer, the function approaches it, but never reaches it. This can be proven if we took the limit of the function as  and so on. This means that the value of  never becomes an integer.
I conclude that  is not an integer, therefore  is not an integer either.
Please tell me what you think. | You'll have to see what TPH thinks, but if your proof is right, i say Well Done! It's very easy to understand as well
__________________ If you need more than 3 levels of indentation, you're screwed anyway, and should fix your program. - Linus Torvalds To view links or images in signatures your post count must be 10 or greater. You currently have 0 posts.
|