IMPORTANT EDIT  IT SEEMS DISCUSSION CAN ALREADY BE DONE IN CHAT. I JUST REALISED THIS BECAUSE I HAD JUST GET 20 REP TODAY. MOD MAY CLOSE THIS IMIDIATELY  Sometimes, we visit stackexchange to ask question that we does not know or wonder what the answer is. However, more often than not, I am asking question without knowing whether an exact answer is available; thus, causing me to accidentally make 'opinion-based' question followed by a bunch of vote down.   I always thought that this is somewhat unfair. "What will happen to this and that?" -- Vote down -2 rep. Vote down -2 rep. "HEY THAT IS OPINION BASED YOU ARE WRRRRONGK! GTFO from this 'fact' site!"   However, I argued that if we note down facts related to my question we can narrow down possibility and guess what will be more appropriate.  So, it seems the site is somewhat 'aggressive' and makes me sad :(     Now, in order to avoid that, I think we can do two things:  1. Make a discussion sub site. (subject.stackexchange.com/discussion/)  In this world, there is no right, wrong, vote up, down, or rep. Only pin answer/post, to point important conclusion and flag, in case of off-topic.   2. Advanced on-hold  In this 'advanced' version, question that is seems opinion based should be answered with facts as much as possible by people who is good at that subject (Naruto Master, Gravity Master, Logic Master, Harry Potter master, etc). Then, we shall take conclusion whether the conclusion is too wide or narrow enough. From that we can conclude whether it is purely opinion based or only 85% opinion based.
Sometimes you just want to let out some steam, and troll about some technology or software. You are not looking for any answers, but for users with similar experiences and interesting stories. So why not create a separate discussion site (trolling.stackoverflow.com?), where you could ask questions like "why do you hate technology X" or "What are the stupidest bugs you encountered in X"?
Is there an example of a ring $S$ with identity $1_S$ containing a non-trivial subring $R$ which itself has an identity $1_R$, but $1_R\neq 1_S$ (or equivalently $1_S\notin R$). I'd also like to know under what conditions the identities have to be equal. I know they must be equal if $S$ has no zero divisors, since for every $r\in R$ we have $(1_S-1_R)r=0$  In other words: Is the category of unital rings with identity-preserving morphisms a full subcategory of the category of rings (where morphism are only required to respect addition and multiplication)? My printer does not print light magenta. (Canon MP220 - CL-38) I have a Canon MP 220, with new cartridges. Prints fine everything, but it won't print light magenta. I cleaned it and deep cleaned it many times. I have no idea what could be the problem. Cartridge models: CL-38 and PG-37.  Any ideas ?  LE: Now it won't print magenta at all! I'm currently an M. Phil student in Math and I failed a course last semester because I was not able to hand in a home work assignment (which was worth 40% of my grade) on time (I was 30 minutes late).   Apart from that I'd say I'm a fairly decent student, I got an upper second class honours bachelors degree, I have a B+ and A's for all my other courses in my current programme and I'm almost finished with my first paper to be published.   I've however been deeply worried about this failure as it would reflect poorly on my transcript if I were to apply to a Ph.D or another Master's programme.   Will my failing grade affect my chances of getting into a competitive programme or greatly lower my chances of getting a scholarship? Is there an analytic function $f$ on $B(0,1)$ the open ball with radius 1 such that $f(1/n)=e^{-n}$ for $n=2,3,4,...$? Is there an analytic function $f$ on $B(0,1)\subset\mathbb{C}$ such that $f(1/n)=e^{-n}$ for $n=2,3,4,...$? I know the following doesn't work:  Let $g(z)=\exp(-1/z)$. Then, $f=g$ on a sequence with a limit point in $B(0,1)$ and so $f=g$ on $B(0,1)$. Since $g$ is not $\mathbb{C}$-differentiable at $0$, neither is $f$ and so such a function cannot exist.  This is not the solution because you cannot use the identity principle with a non analytic function like $\exp(-1/z)$ is not analytic at $z=0$. Any help using the identity principle another way? I understand that \bf and \it are now obsolete in LaTeX and that \textbf and \textit are proper, as they produce more sophisticated (in particular, cumulative and properly kerned) changes to font style. I have read the  and I understand the rules and their reasons, as well as the several other commands that are affected.  However, I find it convenient to use LaTeX for notetaking during lectures, and in that rushed environment, shortening a command by any number of keystrokes helps keep me from falling behind. \bf and its two-letter kin are still very useful to me for that reason, and once a presentation is finished I can go through and replace all appearances of \bf et al. with \textbf et al.  My question is this: is there a plan eventually to replace the short font style commands like \bf with the implementations of \textbf etc. some day, or should I expect \bf always to remain in existence but obsolete, for reasons of backward compatibility with original TeX? Original TeX has been greatly improved on in countless ways, but in the heat of transcription I sometimes miss its conciseness. Learning Insertion Sort in Ruby I have just started the MIT Introduction to Algorithms course through the material posted online. Along with the course I have also decided to learn/enhance my Ruby skills by coding the algorithms in it.   I am on the first algorithm given, which is Insertion sort, and I have the following code typed up but I am getting this error when I run it:     insertionsort.rb:5:in `>': comparison of Fixnum with nil failed (ArgumentError)   def  insertionsort(num) for j in 2..num.length     key = num[j]     i = j - 1     while i &gt; 0 and num[i] &gt; key         num[i+1] = num[i]         i = i - 1     end     num[i+1] = key end  puts num end  numbers = [23,34,46,87,12,1,66]  insertionsort(numbers)   I'm sure it is a fairly basic problem but I just can't grasp what it is at the moment. Any  help or tips would be very much appreciated. Suppose I wanted to travel to one of the recently discovered potentially Earth-like planets such as Kepler 186f that is 490 light years away. Assuming I had a powerful rocket and enough fuel, how long would it take me? Search results on https://stackexchange.com are broken because of "insecure content" The search results on  are blocked because of:     [blocked] The page at  ran   insecure content from .   I am using Chrome. Whilst I understand how the RSA algorithm works, I don't understand how the CPU operates when it needs to use the mod function with a huge number $n$, for example.  $n = 8192$ bits; $c = m^e \mod n$;  In essence my question is how does the CPU deal with this huge modulus? Trim string in JavaScript? How do I trim a string in JavaScript? That is, how do I remove all whitespace from the beginning and the end of the string in JavaScript? I am trying to remove all files and subdirectories in a directory. I used rm -r to remove all files, but I want to remove all files and subdirectories, excluding the top directory itself.  For example, I have a top directory like images. It contains the files header.png, footer.png and a subdirectory.  Now I want to delete header.png, footer.png and the subdirectory, but not images.  How can I do this in linux? Name for categorical product inside a monoid If a monoid is a category with a single object, is there a "monoid-theoretical" concept that the categorical product translates to? As an analogue, in a poset the product translates to the notion of meet (and the coproduct to its dual, the join).  Just by unwinding the definition one can see that this boils down to the existence of two monoid elements $p_1$ and $p_2$ such that for every $x$ and $y$ in the monoid there's a unique element $\langle x,y \rangle$ that factors as $x = p_1\langle x,y \rangle$ and $y = p_2\langle x,y \rangle$; the question is whether the concept is a known and/or useful one.  Incidentally, if the monoid in question is a group then the existence of a product makes the whole thing collapse into the trivial group; this might or not hint that the concept I'm looking for is "too boring" to have a name. In fact it suffices for one of the projections to be right cancellable, or for the pair $\langle x,x\rangle$ to be left cancellable for some $x$, to make the whole thing collapse. Downgrading from SQL Server 2008 to 2005 "She will be visiting" vs. "she will visit" When she goes to Mexico, she will be visiting Chichen Itza. When she goes to Mexico, she will visit Chichen Itza.  Is there a particular difference in meaning, or it is just the matter of style? Has it been practically proven that quantum superposition exists ? If yes, how does it even work? Steam Install Error on 14.04 Ubuntu 64bit Why does the sizeof operator return a size larger for a structure than the total sizes of the structure's members? I've been reading forum posts and blogs who mention "my guy" syndrome as a specific type of difficult player, but I can't seem to find a solid definition for the term. Can someone explain this particular kind of problem player to me? How do you deal with this kind of problem? How to find and replace in linux on a large file? Oh, hi; So I've got this big json file and I'm trying to find and replace a few things but when I've used sed I get an error and I need a sed or awk string to find and replace it, without getting an error.  prajwal  Current: {&quot;telephone_numbers&quot;:[&quot;1-  Future: {&quot;telephone_numbers&quot;:[&quot;+1-  This is the command i tried and the error i got. sed -i 's/{&quot;telephone_numbers&quot;:[&quot;1-/{&quot;telephone_numbers&quot;:[&quot;+1-/g' output.json sed: -e expression #1, char 56: unterminated `s' command I have binary data in an unsigned char variable. I need to convert them to PEM base64 in c. I looked in openssl library but i could not find any function. Does any body have any idea?