the entry level iMac doesn't have a DVD burner or bluetooth
Did they stop making BlueTooth standard on all iMacs? I have the entry-level (no DVD burner) 17" iMac G5 (May 2005 revision) and it *does* have BlueTooth... in fact, it was the first iMac where BlueTooth and 802.11g came standard, and that was the final push I needed to commit to switching to Mac.
I would be suprised (but not shocked, I guess) to learn that Apple has removed BlueTooth as a standard feature.
At least here at Virginia Tech, I know (well, I'm told by someone who would know) the football team actually provides a revenue stream to the academic side of campus, not the other way around. I'm told that college football teams are typically set up as a separate entity with a license to use the school's name, colors, logo, mascot, etc. I'm not sure where you'd find citations to prove any of that, though.
I have the ML-2010 as well. Great printer, but be warned if you plan to use it with a Mac: for some reason, I cannot turn off the toner save feature! I turned it on with the button on top, but the driver is (apparently) the only way to turn it off. The Windows driver, that is; the Mac driver does not have the capability to turn this feature off.
If anyone knows how to turn toner save off with a Mac, I'd really love to know...
Not to be too snarky about it, but OS X's GUI isn't "a program running in X". I believe SystemUIServer is what you're looking for. Here, I'll show ya:
PID TT STAT TIME COMMAND
1 ?? S<s 0:07.69/sbin/launchd
23 ?? Ss 0:00.01/sbin/dynamic_pager -F/private/var/vm/swapfile
27 ?? Ss 0:02.75 kextd
31 ?? Ss 0:00.04/usr/sbin/KernelEventAgent
32 ?? Ss 0:08.39/usr/sbin/mDNSResponder -launchdaemon
33 ?? Ss 0:02.71/usr/sbin/netinfod -s local
34 ?? Ss 0:00.54/usr/sbin/syslogd
35 ?? Ss 0:00.64/usr/sbin/cron
36 ?? Ss 12:01.23/usr/sbin/configd
37 ?? Ss 0:05.81/usr/sbin/coreaudiod
38 ?? Ss 0:03.59/usr/sbin/diskarbitrationd
39 ?? Ss 0:00.09/usr/sbin/memberd -x
40 ?? Ss 0:01.77/usr/sbin/securityd
42 ?? Ss 0:01.31/usr/sbin/notifyd
43 ?? Ss 0:06.03/usr/sbin/distnoted
44 ?? Ss 0:02.31/usr/sbin/DirectoryService
50 ?? S 0:00.32/usr/sbin/blued
51 ?? Ss 0:27.38/System/Library/CoreServices/coreservicesd
56 ?? Ss 7:09.75/usr/sbin/update
62 ?? Ss 67:49.33/System/Library/Frameworks/ApplicationServices.fra mew
64 ?? Ss 0:55.78/System/Library/Frameworks/ApplicationServices.fra mew
65 ?? Ss 0:07.20/System/Library/CoreServices/loginwindow.app/Conte nts
74 ?? Ss 0:01.05/System/Library/CoreServices/pbs
79 ?? S 0:26.11/System/Library/CoreServices/Dock.app/Contents/Mac OS/
80 ?? S 0:02.45 aped
81 ?? S 0:41.75/System/Library/CoreServices/SystemUIServer.app/Co nte
83 ?? S 4:40.97/System/Library/CoreServices/Finder.app/Contents/M acO
86 ?? S 1:01.77/Library/PreferencePanes/Growl.prefPane/Contents/R eso
87 ?? S 0:04.04/Applications/XShelf.app/Contents/MacOS/XShelf -psn_0
88 ?? S 0:06.59/Applications/Stickies.app/Contents/MacOS/Stickies -p
92 ?? S 1:19.13/Applications/Quicksilver.app/Contents/MacOS/Quick sil
93 ?? S 0:01.99/Applications/iCal.app/Contents/Resources/iCalAlar mSc
94 ?? S 0:10.59/Applications/iScrobbler.app/Contents/MacOS/iScrob ble
95 ?? S 0:00.97/Library/Application Support/Logitech/LCCDaemon.app/C
128 ?? Ss 0:00.00/usr/libexec/crashreporterd
129 ?? Z 0:00.00 (crashdump)
131 ?? Ss 0:05.09/usr/local/sbin/dyndnsd daemon
154
If you use a Mac, there's a great program called Tofu that'll put text in columns. It doesn't work right in your browser, of course, but you highlight the text and drag it into Tofu (no need to even use copy & paste). I'm sure there's something similar for Windows/Linux, I just don't know about them.
It's wrong because that's not the mental model users have of what's going on. Users believe that amber means charging, green means charged. For a variety of reasons, it doesn't matter what's actually going on, as long as the belief is a reasonable approximation to the results. I'm not doing this concept much justice; read Don Norman's The Design of Everyday Things and check out the section on refrigerator controls versus air conditioner controls.
I want to preface this by saying that I'm a die-hard Mac guy, but this caught my eye:
(Even if they're not smart enough to know what DRM is or why MemoryStick sucks, they realize it's a bad thing when the replacement power adaptor for a new digital camera costs $60 and you can't buy it at Radio Shack.)
A replacement power adaptor for the G4 Powerbook costs $70 and you can't buy it at Radio Shack... much to my chagrin when my cats chewed through mine... Well, actually, you can buy one of those iGo units. I had two die within 24 hours (and to my suprise, Radio Shack happily replaced them and ultimately refunded my money). But the power adaptor thing isn't stopping people from, buying Powerbooks. Not even people who care about things like that (me).
As a Verizon user, I don't disagree with most of what you said. However, point #3 is not entirely true. I've got an LG VX4500 with the data cable, and I've put both ringtones and wallpapers on my phone without going through GIN. They're MIDI ringtones, but I don't think the 4500 knows how to speak MP3 anyhow.
I'd post a list of ringtones I have installed, but it's Friday night and I'm going downtown. =) Yay beer.
I thought the same thing when I read that post... I just bought an '03 Sonata and couldn't be any happier. Great price (I realize it was used, but it was more car than I thought we could afford), some remaining warranty, and the user interface seems to be spot on. The only thing wrong with it is that the "Cancel" button on the cruise control doesn't seem to do anything; tapping the brakes is the only way to drop it out of cruise.
Thanks for a great puzzle, Council! I didn't understand how the case n=2 worked until I saw it in this light:
**SPOILER WARNING** (although I guess you already gave the solution above)
Say the blue eyes are p1 and p2; the number of other people is irrelevant as long as there's at least one of them. p1 expects p2 to leave because he looks around and only p2 has blue eyes. p2 expects p1 to leave because she looks around and only p1 has blue eyes.
Midnight comes and goes; neither leaves. Thus, p1 now knows that there's at least one more person on the island with blue eyes. Since he can see that everyone besides p2 has brown eyes, he deduces that the person p2 was waiting on is himself. Thus he knows he has blue eyes and has to leave that night. p2 goes through a similar thought process.
For the case n=3, there are three people (p1, p2, p3) who have blue eyes and at least one other person who has brown eyes. On day 1, p1 looks around and sees that exactly 2 people have blue eyes, so he expects them to leave not today but tomorrow (based on the n=2 case above). p2 and p3 have similar thought processes.
On the next day, p1 doesn't have any inkling that he has blue eyes so he does not leave. However, p2 and p3 are in the same boat, and they don't leave. Thus p1 is able to deduce, just like in the n=2 case above, that both p2 and p3 are waiting on at least one person. Again, everyone else on the island has brown eyes, so it must be him. He leaves that night. As before, p2 and p3 have the exact same thought processes.
So there's the inductive step: at day 1, each person with blue eyes expects the case n-1 (and thus that everyone with blue eyes will leave on day n-1). When case n-1 fails to happen (those with blue eyes don't leave on day n-1), the remaining person with blue eyes realizes they're waiting on him. Since this realization comes at the same time to everyone with blue eyes, they all leave on day n.
After rethinking this, I think the brown eyed people are just a red herring and this will actually work for the case where there are no brown eyed people (as long as there remains the possibility that any given person COULD have brown eyes). I think this solution should even work if the guru has blue eyes!
As I understand it, being in P means that if a problem is run on a regular old Turing machine, that machine will halt in polynomial time (that is, if given an input of size n, it will halt in O(n^x) time where x is some number).
The next step up, being in NP, means that a non-deterministic Turing machine will halt in polynomial time for that problem. A non-deterministic Turing machine is one that creates copies of itself (instantaneously) for each possible configuration of input and then halts when any of its copies halts.
Now, to determine if a problem is NP-complete, it has to be 1) NP and 2) NP-hard. To figure out if the problem in NP hard, you need a list of all the other problems you've shown to be NP. For all of those problems, find a way to transform your problem into them using only P time. If you can do that, you're NP-hard. Satisfy condition 1 above, and you're NP-complete.
I'm sure that there are two problems with my post: 1) everything is likely a gross oversimplification, and 2) it's been almost a year since I finished my undergraduate algorithm analysis course. A year ago, I had a pretty good grasp of the concepts involved, but now it's all very fuzzy and difficult to reconstruct. Please, if someone else knows what s/he's talking about, post here and destroy my fragile explanations.
>So yeah, it's a pretty dumb riddle, but the commonly accepted answer is supendously retarded. I can only surmise that readers are too distracted by the rhyming to notice. An equivalent mathematical puzzle would go something like this:
>"What's "i" squared?"
>"Um. Negative one..."
>"HAH! Wrong! You thought I meant the imaginary number didn't you?! In this equasion the variable i=5, so the real answer is 25! Haha, you fell for it."
>Yeah, real fucking hilarious...
(emphasis added) I'm lucky I hadn't started on my beer yet... I would have spit it all over my keyboard. That was one of the funniest things I've read in a while.
Then you will absolutely LOVE Quicksilver. Invoke QS by typing ^Space and you get a little translucent window in the middle of the screen. Start typing the name of a program, a folder, a Preferences panel, a bookmark, or an action within a program (like "Next Song" for iTunes) and it will immediately try to find a match among those types of resources. Even if you type it a little wrong, like typing "itnes" when you meant "itunes", QS will find it and allow you to launch it.
I realize how non-compelling it sounds... I was not impressed when it was explained to me either. Try it, though; it changes the way you launch programs with the same magnitude as Exposé changes the way you task-switch. Plus, it has a plugin architecture so you only use the stuff you need (for instances, you have to choose the bookmark modules for the browsers you use, and IIRC, the iTunes stuff is a plugin as well). Plugins are downloaded from within the program itself... it's nothing like Firefox plugin management.
CDMA's a popular type of cell network, at least in the Southeast (scroll down to the last map on the page). Virginia, where I now live, also has extensive CDMA coverage. As a sibling poster noted, anyone with Verizon is on a CDMA network.
None of the 6 phones I've had in the last 8 years (3 from US Cellular, 1 from Cricket, and 2 from Verizon) have had a SIM card. The network access information is all internal to the phone.
Disney's is called ToonTown. I used to play it for a little while, but it got old after a while. And all words in English are banned by default--you can only say a few canned phrases to other people unless you meet them elsewhere, agree on a "codeword", and both type the codeword into the game. Then, IIRC, you have unrestricted access to speak to that person.
As I understand it, the previous two posters are wrong. "Leechers" are actually just those who haven't finished downloading the entire file (those who have are called "seeders"). It's a misnomer since, as the above two posters pointed out, in most file sharing paradigms a leecher is someone who takes without giving back. I found http://www.slyck.com/bt.php to be quite helpful.
>[T]here are no primes in that set, because the original list is the list of all primes.
That's easily proven false. The most trivial example is: take the list of all known primes up to three: 2, 3. Multiply these together and add 1: 7. Now there's a prime in the set between the biggest old prime and the new number.
This example obviously doesn't demonstrate the entire principle since 7 is in fact a prime. The point everyone in this thread is making, though, is that just because you generated 7 by multiplying up some consecutive primes and adding 1 doesn't inherently make it a prime, but it does still prove that there are infinitely many primes.
Hope this doesn't come across as flamebait; it's not intended as such.
I was trying to use the first 5 primes as an example when I posted the previous comment. The problem is that (2)(3)(5)(7)(11) is 2310, and 2311 really is prime. Not sure where you got 30031 from, but it's nice to know that someone else was thinking down the same paths as me. =)
Because it may be divisible by a prime not already in the list. If you multiply all the known primes together and add 1, you're going to make a number much, much bigger than the biggest number in your list. It may be the case that this new number is divisible by two or more primes from the set of numbers greater than your biggest old prime.
I'm a little rusty on my discrete math, and it may be possible to prove that the new number is indeed prime, but it's easier to just say it's either a new prime OR the product of new primes (as the grandparent poster was doing).
If you can make it over to Ashburn, VA, to the Old Dominion Brewing Company, they make a **great** stout called Oak Barrel. Also, the Steelworkers Oatmeal Stout at Bethlehem Brewing Company (Bethlehem, PA) is pretty special. As for "national" micros/regionals, I like Redhook's and Sierra Nevada's stouts and porters.
I'm not much of a wheat fan myself, so I wouldn't know what's a good one and what's not.
"There are no beer experts, only beer drinkers with an opinion." --BeerAdvocate.com
As a beer snob, I take great offense to your statement that beers are all alike......or that beer is like Linux......or Windows......or something like that...
(no, seriously, taste the difference between a doppelbock and an American pale ale, for example... these are NOT the same beverage...)
Slashdot Mirror
Did they stop making BlueTooth standard on all iMacs? I have the entry-level (no DVD burner) 17" iMac G5 (May 2005 revision) and it *does* have BlueTooth... in fact, it was the first iMac where BlueTooth and 802.11g came standard, and that was the final push I needed to commit to switching to Mac.
I would be suprised (but not shocked, I guess) to learn that Apple has removed BlueTooth as a standard feature.
At least here at Virginia Tech, I know (well, I'm told by someone who would know) the football team actually provides a revenue stream to the academic side of campus, not the other way around. I'm told that college football teams are typically set up as a separate entity with a license to use the school's name, colors, logo, mascot, etc. I'm not sure where you'd find citations to prove any of that, though.
I have the ML-2010 as well. Great printer, but be warned if you plan to use it with a Mac: for some reason, I cannot turn off the toner save feature! I turned it on with the button on top, but the driver is (apparently) the only way to turn it off. The Windows driver, that is; the Mac driver does not have the capability to turn this feature off. If anyone knows how to turn toner save off with a Mac, I'd really love to know...
Not to be too snarky about it, but OS X's GUI isn't "a program running in X". I believe SystemUIServer is what you're looking for. Here, I'll show ya:
/sbin/launchd /sbin/dynamic_pager -F /private/var/vm/swapfile /usr/sbin/KernelEventAgent /usr/sbin/mDNSResponder -launchdaemon /usr/sbin/netinfod -s local /usr/sbin/syslogd /usr/sbin/cron /usr/sbin/configd /usr/sbin/coreaudiod /usr/sbin/diskarbitrationd /usr/sbin/memberd -x /usr/sbin/securityd /usr/sbin/notifyd /usr/sbin/distnoted /usr/sbin/DirectoryService /usr/sbin/blued /System/Library/CoreServices/coreservicesd /usr/sbin/update /System/Library/Frameworks/ApplicationServices.fra mew /System/Library/Frameworks/ApplicationServices.fra mew /System/Library/CoreServices/loginwindow.app/Conte nts /System/Library/CoreServices/pbs /System/Library/CoreServices/Dock.app/Contents/Mac OS/ /System/Library/CoreServices/SystemUIServer.app/Co nte /System/Library/CoreServices/Finder.app/Contents/M acO /Library/PreferencePanes/Growl.prefPane/Contents/R eso /Applications/XShelf.app/Contents/MacOS/XShelf -psn_0 /Applications/Stickies.app/Contents/MacOS/Stickies -p /Applications/Quicksilver.app/Contents/MacOS/Quick sil /Applications/iCal.app/Contents/Resources/iCalAlar mSc /Applications/iScrobbler.app/Contents/MacOS/iScrob ble /Library/Application Support/Logitech/LCCDaemon.app/C /usr/libexec/crashreporterd /usr/local/sbin/dyndnsd daemon
PID TT STAT TIME COMMAND
1 ?? S<s 0:07.69
23 ?? Ss 0:00.01
27 ?? Ss 0:02.75 kextd
31 ?? Ss 0:00.04
32 ?? Ss 0:08.39
33 ?? Ss 0:02.71
34 ?? Ss 0:00.54
35 ?? Ss 0:00.64
36 ?? Ss 12:01.23
37 ?? Ss 0:05.81
38 ?? Ss 0:03.59
39 ?? Ss 0:00.09
40 ?? Ss 0:01.77
42 ?? Ss 0:01.31
43 ?? Ss 0:06.03
44 ?? Ss 0:02.31
50 ?? S 0:00.32
51 ?? Ss 0:27.38
56 ?? Ss 7:09.75
62 ?? Ss 67:49.33
64 ?? Ss 0:55.78
65 ?? Ss 0:07.20
74 ?? Ss 0:01.05
79 ?? S 0:26.11
80 ?? S 0:02.45 aped
81 ?? S 0:41.75
83 ?? S 4:40.97
86 ?? S 1:01.77
87 ?? S 0:04.04
88 ?? S 0:06.59
92 ?? S 1:19.13
93 ?? S 0:01.99
94 ?? S 0:10.59
95 ?? S 0:00.97
128 ?? Ss 0:00.00
129 ?? Z 0:00.00 (crashdump)
131 ?? Ss 0:05.09
154
If you use a Mac, there's a great program called Tofu that'll put text in columns. It doesn't work right in your browser, of course, but you highlight the text and drag it into Tofu (no need to even use copy & paste). I'm sure there's something similar for Windows/Linux, I just don't know about them.
It's wrong because that's not the mental model users have of what's going on. Users believe that amber means charging, green means charged. For a variety of reasons, it doesn't matter what's actually going on, as long as the belief is a reasonable approximation to the results. I'm not doing this concept much justice; read Don Norman's The Design of Everyday Things and check out the section on refrigerator controls versus air conditioner controls.
I want to preface this by saying that I'm a die-hard Mac guy, but this caught my eye:
A replacement power adaptor for the G4 Powerbook costs $70 and you can't buy it at Radio Shack... much to my chagrin when my cats chewed through mine... Well, actually, you can buy one of those iGo units. I had two die within 24 hours (and to my suprise, Radio Shack happily replaced them and ultimately refunded my money). But the power adaptor thing isn't stopping people from, buying Powerbooks. Not even people who care about things like that (me).
As a Verizon user, I don't disagree with most of what you said. However, point #3 is not entirely true. I've got an LG VX4500 with the data cable, and I've put both ringtones and wallpapers on my phone without going through GIN. They're MIDI ringtones, but I don't think the 4500 knows how to speak MP3 anyhow.
I'd post a list of ringtones I have installed, but it's Friday night and I'm going downtown. =) Yay beer.
I thought the same thing when I read that post... I just bought an '03 Sonata and couldn't be any happier. Great price (I realize it was used, but it was more car than I thought we could afford), some remaining warranty, and the user interface seems to be spot on. The only thing wrong with it is that the "Cancel" button on the cruise control doesn't seem to do anything; tapping the brakes is the only way to drop it out of cruise.
How about gravity?
Thanks for a great puzzle, Council! I didn't understand how the case n=2 worked until I saw it in this light:
**SPOILER WARNING** (although I guess you already gave the solution above)
Say the blue eyes are p1 and p2; the number of other people is irrelevant as long as there's at least one of them. p1 expects p2 to leave because he looks around and only p2 has blue eyes. p2 expects p1 to leave because she looks around and only p1 has blue eyes.
Midnight comes and goes; neither leaves. Thus, p1 now knows that there's at least one more person on the island with blue eyes. Since he can see that everyone besides p2 has brown eyes, he deduces that the person p2 was waiting on is himself. Thus he knows he has blue eyes and has to leave that night. p2 goes through a similar thought process.
For the case n=3, there are three people (p1, p2, p3) who have blue eyes and at least one other person who has brown eyes. On day 1, p1 looks around and sees that exactly 2 people have blue eyes, so he expects them to leave not today but tomorrow (based on the n=2 case above). p2 and p3 have similar thought processes.
On the next day, p1 doesn't have any inkling that he has blue eyes so he does not leave. However, p2 and p3 are in the same boat, and they don't leave. Thus p1 is able to deduce, just like in the n=2 case above, that both p2 and p3 are waiting on at least one person. Again, everyone else on the island has brown eyes, so it must be him. He leaves that night. As before, p2 and p3 have the exact same thought processes.
So there's the inductive step: at day 1, each person with blue eyes expects the case n-1 (and thus that everyone with blue eyes will leave on day n-1). When case n-1 fails to happen (those with blue eyes don't leave on day n-1), the remaining person with blue eyes realizes they're waiting on him. Since this realization comes at the same time to everyone with blue eyes, they all leave on day n.
After rethinking this, I think the brown eyed people are just a red herring and this will actually work for the case where there are no brown eyed people (as long as there remains the possibility that any given person COULD have brown eyes). I think this solution should even work if the guru has blue eyes!
As I understand it, being in P means that if a problem is run on a regular old Turing machine, that machine will halt in polynomial time (that is, if given an input of size n, it will halt in O(n^x) time where x is some number).
The next step up, being in NP, means that a non-deterministic Turing machine will halt in polynomial time for that problem. A non-deterministic Turing machine is one that creates copies of itself (instantaneously) for each possible configuration of input and then halts when any of its copies halts.
Now, to determine if a problem is NP-complete, it has to be 1) NP and 2) NP-hard. To figure out if the problem in NP hard, you need a list of all the other problems you've shown to be NP. For all of those problems, find a way to transform your problem into them using only P time. If you can do that, you're NP-hard. Satisfy condition 1 above, and you're NP-complete.
I'm sure that there are two problems with my post: 1) everything is likely a gross oversimplification, and 2) it's been almost a year since I finished my undergraduate algorithm analysis course. A year ago, I had a pretty good grasp of the concepts involved, but now it's all very fuzzy and difficult to reconstruct. Please, if someone else knows what s/he's talking about, post here and destroy my fragile explanations.
(emphasis added) I'm lucky I hadn't started on my beer yet... I would have spit it all over my keyboard. That was one of the funniest things I've read in a while.
Have you tried XShelf? I can't live without it on my Mac.
Then you will absolutely LOVE Quicksilver. Invoke QS by typing ^Space and you get a little translucent window in the middle of the screen. Start typing the name of a program, a folder, a Preferences panel, a bookmark, or an action within a program (like "Next Song" for iTunes) and it will immediately try to find a match among those types of resources. Even if you type it a little wrong, like typing "itnes" when you meant "itunes", QS will find it and allow you to launch it.
I realize how non-compelling it sounds... I was not impressed when it was explained to me either. Try it, though; it changes the way you launch programs with the same magnitude as Exposé changes the way you task-switch. Plus, it has a plugin architecture so you only use the stuff you need (for instances, you have to choose the bookmark modules for the browsers you use, and IIRC, the iTunes stuff is a plugin as well). Plugins are downloaded from within the program itself... it's nothing like Firefox plugin management.
CDMA's a popular type of cell network, at least in the Southeast (scroll down to the last map on the page). Virginia, where I now live, also has extensive CDMA coverage. As a sibling poster noted, anyone with Verizon is on a CDMA network.
None of the 6 phones I've had in the last 8 years (3 from US Cellular, 1 from Cricket, and 2 from Verizon) have had a SIM card. The network access information is all internal to the phone.
Disney's is called ToonTown. I used to play it for a little while, but it got old after a while. And all words in English are banned by default--you can only say a few canned phrases to other people unless you meet them elsewhere, agree on a "codeword", and both type the codeword into the game. Then, IIRC, you have unrestricted access to speak to that person.
> I'm sure the University of Virginia is really happy that they've wasted thousands of man-hours developing computatinon software on Power.
I really hope you're not talking about Virginia Tech when you say "University of Virginia"... They're the enemy, you know ;)
>when it rains, it gets real soggy. when it pours, i'm under the tap just _waiting_ for the joy
Absolutely *love* the sig...
As I understand it, the previous two posters are wrong. "Leechers" are actually just those who haven't finished downloading the entire file (those who have are called "seeders"). It's a misnomer since, as the above two posters pointed out, in most file sharing paradigms a leecher is someone who takes without giving back. I found http://www.slyck.com/bt.php to be quite helpful.
>[T]here are no primes in that set, because the original list is the list of all primes.
That's easily proven false. The most trivial example is: take the list of all known primes up to three: 2, 3. Multiply these together and add 1: 7. Now there's a prime in the set between the biggest old prime and the new number.
This example obviously doesn't demonstrate the entire principle since 7 is in fact a prime. The point everyone in this thread is making, though, is that just because you generated 7 by multiplying up some consecutive primes and adding 1 doesn't inherently make it a prime, but it does still prove that there are infinitely many primes.
Hope this doesn't come across as flamebait; it's not intended as such.
I was trying to use the first 5 primes as an example when I posted the previous comment. The problem is that (2)(3)(5)(7)(11) is 2310, and 2311 really is prime. Not sure where you got 30031 from, but it's nice to know that someone else was thinking down the same paths as me. =)
Because it may be divisible by a prime not already in the list. If you multiply all the known primes together and add 1, you're going to make a number much, much bigger than the biggest number in your list. It may be the case that this new number is divisible by two or more primes from the set of numbers greater than your biggest old prime.
I'm a little rusty on my discrete math, and it may be possible to prove that the new number is indeed prime, but it's easier to just say it's either a new prime OR the product of new primes (as the grandparent poster was doing).
If you can make it over to Ashburn, VA, to the Old Dominion Brewing Company, they make a **great** stout called Oak Barrel. Also, the Steelworkers Oatmeal Stout at Bethlehem Brewing Company (Bethlehem, PA) is pretty special. As for "national" micros/regionals, I like Redhook's and Sierra Nevada's stouts and porters.
I'm not much of a wheat fan myself, so I wouldn't know what's a good one and what's not.
"There are no beer experts, only beer drinkers with an opinion." --BeerAdvocate.com
As a beer snob, I take great offense to your statement that beers are all alike... ...or that beer is like Linux... ...or Windows... ...or something like that...
(no, seriously, taste the difference between a doppelbock and an American pale ale, for example... these are NOT the same beverage...)