| Author |
Message |
Forum: Computers, Math, Science, and Technology Topic: N couples sitting at a table... |
| nudel |
|
Posted: 26 May 2009, 2:24 pm
|
|
Replies: 8
Views: 3,047
|
| I am going to reformulate the problem because I think it is easily misunderstood: There are N married couples to be seated around a table. The table is round. This means seating arrangements which can be reached by rotating the table are considered identical. There are two conditions to be fulfilled... |
|
 |
Forum: Computers, Math, Science, and Technology Topic: N couples sitting at a table... |
| nudel |
|
Posted: 26 May 2009, 11:02 am
|
|
Replies: 8
Views: 3,047
|
Hi,
can anyone here solve this problem?
N married couples are sitting at a round table with exactly 2N chairs. How many ways are there to seat them such that no couple is sitting together and that no two men or two women are sitting next to each other? |
|
|
Forum: Games and Video Games Topic: Who would win: Samurai or Knight? |
| nudel |
|
Posted: 25 Apr 2009, 4:00 pm
|
|
Replies: 27
Views: 5,384
|
| european medieval swordsmanship is simply not represented in popular media. asian swordsmanship is. I do have to agree. Movies & pop culture have exalted the samauri's reputation to that of mythical proportions. In reality, they were just guys with weapons & armor like medieval knights were... |
|
|
Forum: Computers, Math, Science, and Technology Topic: IE8 hacked |
| nudel |
|
Posted: 24 Mar 2009, 3:10 pm
|
|
Replies: 26
Views: 2,783
|
| Linux is almost virtually unhackable. It is hackable but since it is so hard no one attempts to try. It depends on system administration. No matter how good your operating system, in the end you are always yourself responsible for security. At my old school the LAN had a Linux Server but the admin ... |
|
|
Forum: Computers, Math, Science, and Technology Topic: IE8 hacked |
| nudel |
|
Posted: 24 Mar 2009, 11:54 am
|
|
Replies: 26
Views: 2,783
|
| ZDnet has an interview with Nils: http://blogs.zdnet.com/security/?p=2951 According to him, IE8 was actually the hardest browser to hack. He also says it is much easier to write exploits for OS X than Vista. Another interview, this time with Charlie Miller, also an interesting read: http://blogs.zdn... |
|
|
Forum: Games and Video Games Topic: have an idea for a game |
| nudel |
|
Posted: 17 Mar 2009, 5:14 am
|
|
Replies: 17
Views: 1,972
|
|
|
Forum: Computers, Math, Science, and Technology Topic: new to computing |
| nudel |
|
Posted: 01 Mar 2009, 6:43 am
|
|
Replies: 19
Views: 2,033
|
| 64 bit, however, can understand a total of 128. 128 GB is the maximum memory supported by Vista x64 (8GB Home Basic, 16GB Home Premium, 128GB all other versions). However a 64bit address space could support up to 16EB. Current implementations of x86-64 only have a 48bit address space (256TB max). |
|
|
Forum: Computers, Math, Science, and Technology Topic: lol, Simple Wikipedia |
| nudel |
|
Posted: 24 Feb 2009, 6:41 am
|
|
Replies: 18
Views: 2,532
|
| Simple English Wiki is meant to be read by people who are learning English as a foreign language. Readers have a limited vocabulary, they might know the verb "speak", but not "communicate". Bad example: It is more like likely that a person learning English would know "communication" than "to speak"... |
|
|
Forum: Computers, Math, Science, and Technology Topic: lol, Simple Wikipedia |
| nudel |
|
Posted: 24 Feb 2009, 6:20 am
|
|
Replies: 18
Views: 2,532
|
Simple English Wiki is meant to be read by people who are learning English as a foreign language. Readers have a limited vocabulary, they might know the verb "speak", but not "communicate".
The article was not written for mentally retarded native speakers. |
|
|
Forum: Computers, Math, Science, and Technology Topic: Can you explain math proofs? |
| nudel |
|
Posted: 11 Feb 2009, 1:53 pm
|
|
Replies: 14
Views: 1,252
|
| > Proposition: Given any group G, there exists only one identity element. Oh, dear, see, I don't understand what "identity element" means, so I can't follow this. When I said algebra, I meant the simple algebra you do before college. I suppose I should post an example. Edit, okay, here's an example... |
|
|
Forum: Computers, Math, Science, and Technology Topic: 0.9_ = 1? |
| nudel |
|
Posted: 02 Feb 2009, 4:18 am
|
|
Replies: 118
Views: 9,836
|
| There seems to be confusion regarding the definition of decimal representation. I'll just post this one from Wikipedia: http://upload.wikimedia.org/math/5/a/f/5afe758496f193d1e7628c3aeb8cadc7.png For 0.9_, a(1) = 0 and a(n) = 9 for all n>1. So this is simply a geometric series, which converges to (9... |
|
|
Forum: Politics, Philosophy, and Religion Topic: Names |
| nudel |
|
Posted: 01 Feb 2009, 1:12 pm
|
|
Replies: 50
Views: 3,505
|
| In Ancient Rome it was actually quite ok to just number your children. That's where names like Octavius (the eighth), Septimus (the seventh) etc. come from. |
|
|
Forum: Computers, Math, Science, and Technology Topic: 0.9_ = 1? |
| nudel |
|
Posted: 28 Jan 2009, 3:33 pm
|
|
Replies: 118
Views: 9,836
|
I wish people would discuss other mathematical problems with as much interest and skepticism.
0.9999999999...=1 is getting old.
This so reminds me of Zenos Paradox: The runner covers 90% of the remaining distance with every step. So he will never reach his destination. Or will he? |
|
|
Forum: Computers, Math, Science, and Technology Topic: 0.9_ = 1? |
| nudel |
|
Posted: 25 Jan 2009, 5:20 pm
|
|
Replies: 118
Views: 9,836
|
| You could also see it this way: If 0.9_ does not equal 1, then there has to be a real number A 'in between' 0.9_ and 1 ( 0.9_ < A < 1 ). It is quite easy to see that for any real number A < 1 you find a number B = 0.9...9 with a finite number of '9's such that B > A. E.g. if you chose A=0.9999999924... |
|
|
Forum: Computers, Math, Science, and Technology Topic: Solve for X |
| nudel |
|
Posted: 20 Jan 2009, 6:24 pm
|
|
Replies: 25
Views: 4,124
|
| I'm not really sure I see at all why we need to invoke anything about the Riemann rearrangement theorem in order to resolve this. Obviously, regrouping is based on a naive assumption that ignores what it means for a series to converge, so it seems completely unnecessary to say that I transition thr... |
|
|
Forum: Computers, Math, Science, and Technology Topic: Solve for X |
| nudel |
|
Posted: 17 Jan 2009, 2:43 pm
|
|
Replies: 25
Views: 4,124
|
| I'm not really sure I see at all why we need to invoke anything about the Riemann rearrangement theorem in order to resolve this. Obviously, regrouping is based on a naive assumption that ignores what it means for a series to converge, so it seems completely unnecessary to say that I transition thr... |
|
|
| Sort by: |
