I wondered if a continuous interval like $[0,1]^{\mathbb{R}}$ has countable or uncountable infinite elements.  So i looked for a bijective mapping and found following:  $f:\mathbb{N} \to ]0,1[^{\mathbb{R}}$  $f:x \mapsto \frac{x}{10^{\lfloor\log_{10}x\rfloor+1}}$  $f(1234) = 0.1234$  Therefore $[0,1]^{\mathbb{R}}$ should have countable infinite elements, shouldn't it?
Every real number in $[0,1]$ has a decimal expansion $0.d_1d_2d_3...$, so construct an infinite tree rooted at 0 where each node has branches leading to $\{0,1,2,3,4,5,6,7,8,9\} $, and let each path through the tree represent the successive decimal digits of a real number. To enumerate them, go through the tree breadth-first i.e. layer-by-layer.
$p = x^2 + xy + y^2$ if and only if $p \equiv 1 \text{ mod }3$? Can someone decide to be hit? I am using Log4Net with the AdoNetAppender to log messages from a simple systray application into a SQL Server 2005 database.  I want to log the machine name along with the log message because this application will be running on multiple machines and I need to know on which one the message originated.  But, I cannot find a way to expose this information via the log4net.Layout.PatternLayout that I am using with the appender.  Is there a way to log the machine name via log4net in this manner? Fourier series of Log sine and Log cos I'd like to setup a WCF service to send emails. The System.Net.MailMessage doesn't seem to be serializable, and cannot be passed in a [DataContract]  The error I receive is      Type 'System.Net.Mail.MailAddress'   cannot be serialized. Consider marking   it with the DataContractAttribute   Any suggestions? A simple algebra that is not semisimple Convert audio stream to WAV byte array in Java without temp file Given an InputStream called in which contains audio data in a compressed format (such as MP3 or OGG), I wish to create a byte array containing a WAV conversion of the input data. Unfortunately, if you try to do this, JavaSound hands you the following error:  java.io.IOException: stream length not specified   I managed to get it to work by writing the wav to a temporary file, then reading it back in, as shown below:  AudioInputStream source = AudioSystem.getAudioInputStream(new BufferedInputStream(in, 1024)); AudioInputStream pcm = AudioSystem.getAudioInputStream(AudioFormat.Encoding.PCM_SIGNED, source); AudioInputStream ulaw = AudioSystem.getAudioInputStream(AudioFormat.Encoding.ULAW, pcm); File tempFile = File.createTempFile("wav", "tmp"); AudioSystem.write(ulaw, AudioFileFormat.Type.WAVE, tempFile); // The fileToByteArray() method reads the file // into a byte array; omitted for brevity byte[] bytes = fileToByteArray(tempFile); tempFile.delete(); return bytes;   This is obviously less desirable. Is there a better way? $5$ tourists plan to attend Octoberfest. Each attends a location at random from the choices: Alpine, Bingeman, Concordia, Kitchener, Queens, Schwaben, Transylvania. Q What is the probability that two attend one location and three attend another same location?  I get that there are $\binom{5}{2}$ possibilities to create 2 groups. There are $\binom{7}{2}$ ways to choose 2 places so shouldn't it be $\frac{\binom{7}{2}\binom{5}{2}}{7^5}$? Clever bounty reputation hack I say "hack" in the most favorable light. It's a clever idea and theoretically beneficial.  I noticed that an old question of mine suddenly started getting a lot of renewed attention. The question had been answered, with an answer accepted. But another user added a well reasoned and insightful answer to the list. He also opened a +100 bounty on that question.  The resulting increased attention quickly got his answer quite a lot of up-votes. Well more than the 100 points he had spent on the bounty. Therefore, he gets a net rep profit out of the transaction.  So here's the hack:   Find an interesting question Research and provide a very good answer Open up a bounty on that question to attract attention and votes to your new answer Profit!!!   2 and 3 may be out of order--I didn't see the timing of it. But either way, assuming he gets more than 10 votes, he still gets increased rep out of the deal.  I don't think this is necessarily bad for SO - it does generate some useful discussion and insightful answers. Plus you can increase your own rep very rapidly by making your answers highly visible, and therefore frequently voted upon.   However, it does slightly change the meaning and purpose of bounties away from starting a discussion and toward self-promotion. Still, interesting. This is a question from the free Harvard online abstract algebra .  I'm posting my solutions here to get some feedback on them.  For a fuller explanation, see  post.  This problem is from assignment $5$.     Prove directly that distinct cosets do not overlap.   Let $H$ be a subgroup of $G$ and let $a$, $b$, and $c$ be elements of $G$ such that $b\not\in aH$ and $c$ is in both $aH$ and $bH$.  Then there are elements $h$ and $h^\prime$ in $H$ such that $c=ah$ and $c=bh^\prime$.  So $ah=bh^\prime$ and $b=ahh^{\prime -1}$.  But $hh^{\prime -1}\in H$ so $b\in aH$.  This contradicts our original assumption. Therefore, there can be no element in more than one distinct coset.  Again, I welcome any critique of my reasoning and/or my style as well as alternative solutions to the problem.  Thanks. Trying to keep track of the updates to all the great, user-developed add-ons is fairly frustrating (at least for me). Is there currently a centralized resource where all these amazing add-ons are kept and updated in one location?  If there isn't such a resource, would it be possible to have blender query the collection of installed add-ins and then iterate through on-line references looking at version #'s for add-ins?  Since, as far as I know, it hasn't been done...I have to ask if there are any major flaws in the concept. Of course, in my dream scenario, there would be a "voting" front-end that would allow users to see what the most popular and useful add-ons are and where you don't have to read pages (and pages) of threads. Let $\Gamma$ be a circle that passes through the origin. Show that we can find real numbers $s$ and $t$ such that $\Gamma$ is the graph of $r = 2s \cos (\theta + t).$  I know this has to be converted to a cartesian equation, but how do I do this, and what do I do after?  Thanks I have a Asus ROG G551VW laptop and I'm trying to install Ubuntu 16.04 on my laptop, but when i try to load the installer, my laptop just freezes and its fan starts working for no reason. I have tried to install Ubuntu 14.04 on my laptop and the installation went smoothly. What should I do if I want to install Ubuntu 16.04 on my laptop?  Any help would be greatly appreciated. From  by Richard Brualdi  We have a chess master. He has 11 weeks to prepare for a competition so he decides that he will practice everyday by playing at least 1 game a day. To make sure that he's able to take a couple of breaks, he also decides that he wont play more than 12 games per week.  My question is, how do you prove/dis-prove that there will be a succession of (consecutive) days in which he will play k games, $k \geq  22$?  Specifically, I don't quite understand the use of the pigeonhole principle here.  Thanks in advance! :D  EDIT  I'll try to clarify what I'm asking:  The goal is to prove that for every possible practice schedule that the chess master makes, there will always be a consecutive sequence of days such that he plays exactly k games.  So for example, if k = 22, how do you prove that no matter what his schedule is like, he will always play exactly k games in r days, $1 \leq r\leq  77$.  My main question is: what is the general method for proving different values of k? Are there values of k (from 1 to 132 inclusive) that are impossible to obtain?  Note that he does not necessarily have to play 132 games within 77 days! Also, keep in mind the bounds of k. MacBook Pro: How to disable discrete GPU permanently from EFI? What special characters must be escaped in regular expressions? I am tired of always trying to guess, if I should escape special characters like '()[]{}|' etc. when using many implementations of regexps.  It is different with, for example, Python, sed, grep, awk, Perl, rename, Apache, find and so on. Is there any rule set which tells when I should, and when I should not, escape special characters? Does it depend on the regexp type, like PCRE, POSIX or extended regexps? Schengen visa refusal on threat to public policy, security, health Is an automorphism of the field of real numbers the identity map? Is an automorphism of the field of real numbers $\mathbb{R}$ the identity map? If yes, how can we prove it?  Remark An automorphism of $\mathbb{R}$ may not be continuous. hierarchical retreival of records in postgresql Can someone help me elucidate the definition of "income" from a tax perspective? More specifically, if Joe is paid for his work in avocados instead of dollars, then would Joe be exempt from paying any income tax for the year? Or would the value of avocados earned for the year be translated into dollars which would then be considered Joe's annual income? If so, what guidelines would one use to make this translation? (Make the assumption that Joe does not sell the avocados (for dollars) at a later date and either eats them or trades them for other real property)  What if he was paid in gold instead of avocados?