mchammer187
Diamond Member
- Nov 26, 2000
- 9,114
- 0
- 76
Originally posted by: feelingshorter
infinity is not a bumber, so 1 is still more than .99999999 just by a very small amount
that small amount is not a number unless it is zero
Originally posted by: feelingshorter
infinity is not a bumber, so 1 is still more than .99999999 just by a very small amount
Originally posted by: feelingshorter
infinity is not a bumber, so 1 is still more than .99999999 just by a very small amount
Originally posted by: feelingshorter
infinity is not a bumber, so 1 is still more than .99999999 just by a very small amount
Originally posted by: TuxDave
Originally posted by: DrPizza
Here's where your understanding from calculus is going to break down.
Sqrt(0 + sqrt(0 + sqrt(0 + sqrt(0 + ....
infinitely nested. Obviously, it = 0.
Instead, sqrt(x + sqrt(x + sqrt(x + sqrt(x + ...
same thing, except an x instead of 0.
Now, find the limit as x approaches 0. Surprise! It's not 0 as you probably think. It's 1.
Dude... that scares me. But on the other hand, does the limit exist? What happens if you have x approaching from the negative side?
Originally posted by: DrPizza
Originally posted by: TuxDave
Originally posted by: DrPizza
Here's where your understanding from calculus is going to break down.
Sqrt(0 + sqrt(0 + sqrt(0 + sqrt(0 + ....
infinitely nested. Obviously, it = 0.
Instead, sqrt(x + sqrt(x + sqrt(x + sqrt(x + ...
same thing, except an x instead of 0.
Now, find the limit as x approaches 0. Surprise! It's not 0 as you probably think. It's 1.
Dude... that scares me. But on the other hand, does the limit exist? What happens if you have x approaching from the negative side?
Shame on me! It's a right handed limit... as x -> 0+
incidentally, it bugs me that I can't remember exactly how to prove it.
As I think about it, I recall something like
Let L = sqrt(x + sqrt(x + ...
add x to both sides
L + x = x + sqrt(x + sqrt(x + ...
sqrt both sides
sqrt(L + x) = sqrt(x + sqrt(x + ...
since the right side is L,
sqrt (L+x) = L
(I'm leaving out the negative roots, since it should be obvious that both are positive numbers)
square both sides, L + x = L^2
and
L^2 - L = x
There are 2 values of L that satisfy >^2 - L = 0
1 and 0
I can't remember how to demonstrate that it has to be 1 though.
anyone?
Originally posted by: Locut0s
Originally posted by: DrPizza
Originally posted by: TuxDave
Originally posted by: DrPizza
Here's where your understanding from calculus is going to break down.
Sqrt(0 + sqrt(0 + sqrt(0 + sqrt(0 + ....
infinitely nested. Obviously, it = 0.
Instead, sqrt(x + sqrt(x + sqrt(x + sqrt(x + ...
same thing, except an x instead of 0.
Now, find the limit as x approaches 0. Surprise! It's not 0 as you probably think. It's 1.
Dude... that scares me. But on the other hand, does the limit exist? What happens if you have x approaching from the negative side?
Shame on me! It's a right handed limit... as x -> 0+
incidentally, it bugs me that I can't remember exactly how to prove it.
As I think about it, I recall something like
Let L = sqrt(x + sqrt(x + ...
add x to both sides
L + x = x + sqrt(x + sqrt(x + ...
sqrt both sides
sqrt(L + x) = sqrt(x + sqrt(x + ...
since the right side is L,
sqrt (L+x) = L
(I'm leaving out the negative roots, since it should be obvious that both are positive numbers)
square both sides, L + x = L^2
and
L^2 - L = x
There are 2 values of L that satisfy >^2 - L = 0
1 and 0
I can't remember how to demonstrate that it has to be 1 though.
anyone?
I'm not sure this really works but here's another possible way of showing this. If you play around with this on a calculator you can probably convince your self that this infinite sequence is bounded above by 1. So lets just assume that it is then for any given term in the sequence we have:
a(n+1) = sqrt(x+a(n)) < sqrt(x+1) but as x->0 sqrt(x+1) -> 1
So this sequence is bounded above by 1 as x->0.
However we also know that this is a monotonically increasing function for any arbitrarily small value of x. So because it is an increasing function bounded above by 1 as x->0 the limit of the sequence as x approaches 0 =1.
Originally posted by: dornick
Originally posted by: Bacardi151
Originally posted by: MAME
Originally posted by: ugopk
I don't think this would work.
Because if you can do it with 1 and .99..., you can do the same proof for .99 and .98 and so on...
basically saying all numbers = all numbers![]()
you're making exactly no sense
.999...8 is not a number just like .000...1 is not a number (note the '...'s represent an INFINITE amount of numbers)
you're the one who's not making any sense, if '...' represents an infinite amount of numbers, how can you have a 1 at the end? that means the amount of numbers in between .000...1 is not infinite, and what comes after 1? do you even know what the concept of infinite is? you can't add a number to infinite, which you did by saying infinite and then putting a 1 at the end of the infinite series of #s
you just said the exact same thing he did. He was saying that those examples aren't numbers beacuse of the infinite block in between
Originally posted by: mchammer187
Originally posted by: acadia11
Originally posted by: mchammer187
Originally posted by: acadia11
Originally posted by: amoeba
Originally posted by: acadia11
You are all gay, and fcuking nerds, I got a better one for you though ... try this one
a = b
a^2 = b^2
a^2 = b * b
a^2 = a * b
a^2 - b^2 = a * b - b^2
(a + b)(a - b) = (a - b)b
a + b = b
b + b = b
2 * b = b
So,
2 = 1 .......... oh my f'cking god 2 = 1!!!!!!!
1 = 0 , so that means that everything should be free in society. since every number actually equals 0!!!!!!!
nice trick....
unfortunately the
(a+b)(a-b) = (a-b)b
and then
a+b = b
is where it unravels.
You could have done it much quicker with
2*0 = 1* 0
2= 1
OMG!!!
Yeah, but 0/0 is undefined, so it isn't quicker, it blatently false.
On the otherhand,
(a-b)(a+b) = (a-b)b
a^2 -ab + ab - b^2 = ab - b^2
a = b , so
a^2 - b^2 = aa - b^2
a^2 - b^2 = a^2 - b^2
....
so going back, (a-b)(a+b) = (a-b)b
so, 2 = 1, OMG !!!!!! .... looks good to me, down with capitalism!!!
Who's not paying taxes with me.
when you divide both sides of (a-b)(a+b) = (a-b)b by (a-b) you have to assume that a != b or you get an indeterminate for beause it is division by zero otherwise thus amoeba is correct
I'm not saying the proof is correct.
I said 0/0 is undefined, or indeterminate more correctly, and blatently wrong.
However x,y,z... looks good to me.
On another note?
I can't assume a != b, I arleady just assumed
a = b, how can a = b and a != b, that's a contradiction.
Man, you people are really nerdy, it was much funnier when capitalism was coming to an end.
Thanks for taking the jam out of my donut.
i was saying in order to divide both sides by (a-b) you must assume a != b
if you do not make that assumption than you are dividing by zero
you are contradicting yourself when you divide by (a-b)
because in order to do so you must ASSUME you are not dividing by zero otherwise the equation blows up
because you are dividing by (b-b) or (a-a) or (b-a) or (a-b) all are zero
therefore if a=b then you cannot perform the division at all because it is performed on the basis that a!=b
so I was saying either a!=b or dont do the division at all
Originally posted by: Locut0s
Here's one for you guys who can't seem to wrap your mind around the concept of infinity. Which is bigger the set of all integers or the set of all odd integers? Both sets obviously contain an infinite number of elements. The answer is that they are the same size! You might think that the set of all integers has to be larger, after all the set of all odd integers is a subset of the set of all integers. Also the set of all odd integers doesn't include the even integers which are in the set of all integers. However if we create a one-to-one and onto mapping, or function, 2*n+1 we now have a method of mapping each and every element in the set of integers onto exactly one element in the set of odd integers, therefore they have to be the same size.
Originally posted by: acadia11
Originally posted by: Locut0s
Here's one for you guys who can't seem to wrap your mind around the concept of infinity. Which is bigger the set of all integers or the set of all odd integers? Both sets obviously contain an infinite number of elements. The answer is that they are the same size! You might think that the set of all integers has to be larger, after all the set of all odd integers is a subset of the set of all integers. Also the set of all odd integers doesn't include the even integers which are in the set of all integers. However if we create a one-to-one and onto mapping, or function, 2*n+1 we now have a method of mapping each and every element in the set of integers onto exactly one element in the set of odd integers, therefore they have to be the same size.
Ah but the set of all real numbers is bigger than the set of integers or set of odd integers!!!
Muahahahahahaha!!!!!
Originally posted by: DannyBoy
Originally posted by: MrChad
Oh
My
God
:roll:
You would think something as well known as this on the forums couldn't POSSIBLY get reposted, it's been discussed over and over so many god damn times now.
Originally posted by: Locut0s
Originally posted by: acadia11
Originally posted by: Locut0s
Here's one for you guys who can't seem to wrap your mind around the concept of infinity. Which is bigger the set of all integers or the set of all odd integers? Both sets obviously contain an infinite number of elements. The answer is that they are the same size! You might think that the set of all integers has to be larger, after all the set of all odd integers is a subset of the set of all integers. Also the set of all odd integers doesn't include the even integers which are in the set of all integers. However if we create a one-to-one and onto mapping, or function, 2*n+1 we now have a method of mapping each and every element in the set of integers onto exactly one element in the set of odd integers, therefore they have to be the same size.
Ah but the set of all real numbers is bigger than the set of integers or set of odd integers!!!
Muahahahahahaha!!!!!
Hehe. In fact the set of the real number line from [0..1] is larger than the set of all integers.
Originally posted by: Lizabath
no you are wrong 91ttz,
.999... = 1
Take some advance math courses and you will find out why.![]()
Originally posted by: darbius
Originally posted by: Lizabath
no you are wrong 91ttz,
.999... = 1
Take some advance math courses and you will find out why.![]()
I've taken advanced math courses and that is just one of the few rules of math I'm not willing to accept. No matter which way you spin it or how many proofs you try to do, .999 repeating will never, ever equal 1.
Originally posted by: acadia11
You are all gay, and fcuking nerds, I got a better one for you though ... try this one
a = b
a^2 = b^2
a^2 = b * b
a^2 = a * b
a^2 - b^2 = a * b - b^2
(a + b)(a - b) = (a - b)b
a + b = b
b + b = b
2 * b = b
So,
2 = 1 .......... oh my f'cking god 2 = 1!!!!!!!
1 = 0 , so that means that everything should be free in society. since every number actually equals 0!!!!!!!
Originally posted by: aplefka
Shit man, start the presses, alert all major news headquarters. And is the world really round?
Venk is a fvcking genius!
Die in a very hot fire. :|
Originally posted by: darbius
Originally posted by: Lizabath
no you are wrong 91ttz,
.999... = 1
Take some advance math courses and you will find out why.![]()
I've taken advanced math courses and that is just one of the few rules of math I'm not willing to accept. No matter which way you spin it or how many proofs you try to do, .999 repeating will never, ever equal 1.