![]() |
|
|
#1 |
|
Nov 2003
22·5·373 Posts |
And some excellent side reading if people are interested:
http://www.de.ufpe.br/~toom/my-artic...c/ARUSSIAN.PDF |
|
|
|
|
|
#2 | |
|
I moo ablest echo power!
May 2013
29×61 Posts |
Quote:
http://ww2.kqed.org/mindshift/2012/1...tern-cultures/ |
|
|
|
|
|
|
#3 | |
|
May 2011
Orange Park, FL
3·5·59 Posts |
Quote:
I could do the 0.9999 problem, but not the others. At this late date I will not frustrate myself by attempting to join the discussion group. |
|
|
|
|
|
|
#4 | |
|
"William"
May 2003
New Haven
44768 Posts |
Quote:
Would PMs or email instead of threads be preferred? That avoids the problem of reading other people's answers instead of figuring it out for yourself. If there is interest, then I also suggest that the professor (Bob) recruit some "teaching assistants" to handle these threads. I'll be mostly offline for the next two weeks, but volunteer to assist to the extent my limited access permits. |
|
|
|
|
|
|
#5 | |||
|
"Gang aft agley"
Sep 2002
2×1,877 Posts |
Quote:
Quote:
Richard Feynman on education in Brazil From Surely You’re Joking, Mr. Feynman!: Quote:
Last fiddled with by only_human on 2015-11-12 at 20:07 |
|||
|
|
|
|
|
#6 | ||
|
"Mike"
Aug 2002
202016 Posts |
Quote:
Quote:
|
||
|
|
|
|
|
#7 | ||
|
∂2ω=0
Sep 2002
República de California
103×113 Posts |
Quote:
Proof A: The distance d between the n-term (n finite) expansion and 1 is d = 10^(-n), which --> 0 as n --> oo, thus in the limit, 0.999... = 1. Proof B: Using the same notation as Proof A, the number of distinct real points in the length-d interval separating the n-term expansion and 1 is infinite (in fact uncountably so). Incrementing n by 1 cuts the distance by a factor of 10, but the number of distinct reals in the new smaller interval is still uncountably infinite. Thus no matter how large we take n, there remains an uncountably infinite number of points separating the point corresponding to the resulting expansion from 1, hence 0.999... != 1. Wikipedia describes the difficulties involved in such problems: Quote:
|
||
|
|
|
|
|
#8 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
11000001101002 Posts |
1/3 = 0.33333...
2/3 = 0.66666... 3/3 = 0.99999... |
|
|
|
|
|
#9 |
|
∂2ω=0
Sep 2002
República de California
103·113 Posts |
You also neglect to detail the many assumptions behind those '=' signs. Please provide a convincing refutation of my Proof B.
[Agree with wblipp that such 'sidetrack discussions' should probably be split off into separate threads - here we are veering out of the field on number theory as the subforum likely intends it to mean.] Last fiddled with by ewmayer on 2015-11-13 at 01:56 |
|
|
|
|
|
#10 | |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
22×1,549 Posts |
Quote:
Last fiddled with by retina on 2015-11-13 at 02:50 |
|
|
|
|
|
|
#11 |
|
"Carl Darby"
Oct 2012
Spring Mountains, Nevada
32·5·7 Posts |
Proof B seems to depend on the mistaken assumption that an uncountable set cannot be written as a countable union of uncountable sets.
As for the TDH problem, if you think about it for a minute, you will realize that if T,D, and H represent times to finish the job, then T + D =2, T + H =3, and D + H = 4 make no sense. In Toom's defense, i think this was what he wanted the student to realize. Last fiddled with by owftheevil on 2015-11-13 at 02:46 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| mfaktc and CUDALucas side-by-side | TObject | GPU Computing | 2 | 2012-07-21 01:56 |
| Topic of Peepholes Friendship :) | coffee1054 | Lounge | 7 | 2012-02-17 03:38 |
| very large finite numbers - another topic | ixfd64 | Lounge | 46 | 2006-06-28 20:38 |
| Off-Topic: Spurious IRQ Interrupt? | moo | Hardware | 4 | 2005-03-26 19:38 |
| AMD vs. Intel topic | Pjetro | Hardware | 11 | 2002-11-04 21:00 |