Where should I ask questions about technology recommendations? I am looking for an appropriate Stack Exchange site to ask a technology recommendation question.  My question would be along the lines of:     I am looking for a Microsoft Azure storage solution to save unstructured data that comes from a web crawler like html code and images.
How to get product recommendations Possible Duplicate:          I have a question of the form "what companies provide service X?"  I checked meta, and apparently such questions are highly discouraged on all Stack Exchange sites. Which is fine, but it obviously raises the meta-question: Where can I ask my question?  (In particular, I know that there are people hanging out on Stack Overflow who have probably needed the same service, so if an answer exists, they possess it...)  Edit: I should perhaps point out that the service I'm looking for is rather specific and slightly obscure. Otherwise, yeah, this would be a 10-second exercise with Google.
How come unpolarized light does not undergo destructive interference? As far as I know, unpolarized light is defined as light which has no clear axis of polarization, but electric field vectors in all directions. However, I also know that electric fields can be superpositioned. So this leads me to the conclusion that if unpolarized light has equal $\vec E$ vectors in all directions, they should cancel.   Obviously, though, this is wrong (we've got light!). What's the explanation? Using a singular or plural verb after "and/or" If the subject of a sentence is separated by "and/or", should the verb be pluralized, as with "and", or agree with the rightmost subject, as with "or"? For example:     His co-workers and/or his boss was at fault.   vs.     His co-workers and/or his boss were at fault. Remove line containing certain string and the following line Show that $n$ lines separate the plane into $\frac{n^2+n+2}{2}$ regions Show that $n$ lines separate the plane into  $\frac{n^2+n+2}{2}$ regions if no two of these lines are parallel and no three pass through a common point.   I know we start with the base case, where, if we call the above equation P(n), P(0), for 0 lines would be 0.  But I really have no idea how to begin the inductive step.  How do we know what k+1 we're supposed to arrive at?  Thanks! Propose Newbie-Overflow site or section Because the perl section is looking like that right now. I believe that Stack Overflow is going out of it's charter in becoming a newbie FAQ when as far as the original reasoning it was meant to be something along the lines of an expert site.   is a good example of what I mean in Perl. It probably could be closed because it's a duplicate, or some other reason.   I would also like to indicate that I don't hold back answering newbie questions. It's just when I think of an obscure "stack overflow" error that's beating you some 3 am close to deadline, that's not "Howcum Perl print ..." and follows with something that causes a vast majority of Perl programmers to say oops, because they know exactly what's going on.   So the proposal is   A new site. "Move to Newbieville" A new "section" A new status somewhat similar to Closed ("Newbied") but still can be updated all the same as an open question.   I'm not against giving some newbies an assist, but I feel a FAQ for rank newbieism is not something that SO started out to be, based on the original concept of a Expert Site.   Including comment to Gnoupi:   I said nothing about making newbies unwelcome. Like I said. I answer them--heck, I think I've even answer homework questions. I've answered on the vague impressions that I can glean from posts that have 4 close votes. It can even lead to avoiding downvoting or yelling at newbies by more established curmudgeons if there is a special action you can do to gently inform newbies that this is a real newbie question.  However, you have to know that to some people newbies are already unwelcome. There is a site ethic, but the individual is also going to decide how much they welcome newbies. And people do post RTFM answers already.   Anyway, I'm one vote away from a peer pressure badge it seems. (Nope, nailed it.)    EDIT  For somebody jumping to the conclusion that I'm hostile to newbies:  just earlier Can I board if my flight arrives 1.5 hours before my UK visa becomes valid? My visa to UK is valid starting from June 25 but my flight to LGW is June 24 10:30 PM (edit: this is landing time not departure based on VCE-LGW flight times presented by easyjet.com). I still have 1.5 hours until my visa becomes valid. I prefer not to change my flight because I don't want to pay extra charges.   Will the EasyJet airlines going to allow me on board? I will be coming from Venice. How long does it take from landing to Immigration in London Gatwick? Can I stay longer in the airport before I pass through Immigration? Can I still see my luggage in the conveyor belt after 1.5 hours? How much time before they take away my luggage from the belt? How do I make ditto marks? In France, students are taught not to repeat the same text twice when there is little difference between a line and the one below. It's a quick way to take notes.  I reproduced this effect by tinkering:    The code is as follows:  \documentclass[aspectratio=1610]{beamer}  \usepackage[T1]{fontenc} \usepackage[french]{babel}  \usepackage{amsmath, amsfonts, amssymb} \usefonttheme[onlymath]{serif}  \begin{document} \begin{frame} Lorsque le \og \textit{carreau carré} \fg{}   mesure: \begin{itemize} \item $\rm 1\,cm$ de côté, l'unité d'aire est appelée le \og \textrm{centimètre carré} \fg{} et est noté $\rm cm^2$; \item $\rm 1\,dm$ \hspace{1mm}'' \hspace{3mm}'' \hspace{8mm}'' \hspace{8mm}'' \hspace{5mm}''\hspace{8mm}'' \hspace{5.5mm}''\hspace{1mm} \og \textrm{décimètre carré} \fg{} \hspace{2mm}'' \hspace{2mm}'' \hspace{4mm}'' \hspace{1.5mm} $\rm dm^2$; \item $\rm 1\,m$ \hspace{3mm}'' \hspace{3mm}'' \hspace{8mm}'' \hspace{8mm}'' \hspace{5mm}'' \hspace{7mm}'' \hspace{5.5mm}''\hspace{1mm} \og \textrm{mètre carré} \fg{}  \hspace{9mm}'' \hspace{2mm}'' \hspace{4mm}'' \hspace{1mm} $\rm m^2$; \item etc. \end{itemize} \end{frame} \end{document}   How can I get the same effect more simply than by tinkering like I just did? How to download Bootcamp drivers without Bootcamp assistant? I'm setting up my MacBook Air for a Windows-only boot setup. This was easy enough. It already had rEFIt on it, I just connected a Windows 7 boot thumb drive, and away I went.  However, it seems Apple does not let you download Bootcamp drivers outside of their assistant tool. Reinstalling OS X just for the drivers is ridiculous.  This laptop no longer has OS X on it at all. How do I get the required drivers? I cannot find them anywhere on Apple's support pages.  Every other manufacturer has their drivers available for download.   How do I download the Windows drivers for my 2010 MacBook Air without the BootCamp Assistant? Proofs with limit superior and limit inferior: $\liminf a_n \leq \limsup a_n$ I am stuck on proofs with subsequences. I do not really have a strategy or starting point with subsequences.   NOTE: subsequential limits are limits of subsequences  Prove: $a_n$ is bounded $\implies \liminf a_n \leq \limsup a_n$   Proof:  Let $a_n$ be a bounded sequence. That is, $\forall_n(a_n \leq A)$.  If $a_n$ converges then $\liminf a_n = \lim a_n = \limsup a_n$ and we are done.  Otherwise $a_n$ has a set of subsequential limits we need to show $\liminf a_n \leq \limsup a_n$:  This is where I am stuck... enclosing a lstlisting environment inside my own environment using matlab-prettifier I've just started using matlab-prettifier.    Since the line \begin{lstlisting}[style=Matlab-editor] is a lot to type, I created my own environment:  \newenvironment{myMP}      {\begin{samepage}\begin{lstlisting}[style=Matlab-editor]}      {\end{lstlisting}\end{samepage}}   I've used this syntax many times before, but in this case it doesn't work.  Is there any reason why I can't enclose the lstlisting inside my own one?  Here's sample code, illustrating the problem.  \documentclass{minimal} \usepackage[framed]{matlab-prettifier}%For matlab code \newenvironment{myMP}      {\begin{samepage} \begin{lstlisting}[style=Matlab-editor]}      {\end{lstlisting} \end{samepage}} \begin{document} \begin{myMP} matlab word \end{myMP} \end{document}   When I run this with pdflatex it returns a *, indicating that the environment wasn't closed properly.  Thanks! There are a lot of legendaries available in ORAS, however a lot of them will only show up/be available if certain prerequisites are met.  I know Groudon/Kyogre are available through the Story, and      Rayquaza &amp; Deoxys   through the postgame Delta episode, but what about the other available legendaries? What do I need to do to catch them? I am looking at this:    I need to create a boot disk to test Ubuntu to make sure it will run on a PC (Compaq Mini CQ10-120LA) I was given. I can create the boot disk off of a Mac (in English) or Windows (but Windows is in Spanish and foreign to me).   Questions:     What format do I choose for the USB stick? (I wish the instructions stated this). What is Dash? (Will I know when I run the installer?) Can I do this from a Mac or Windows computer? Or only from Ubuntu? Proving the inequality $\frac{n^k}{k^k}\leq\binom{n}{k}\leq\frac{n^k}{k!}$ involving binomial coefficient. What is the best way of proving inequalities including binomial coefficients in general? Lets look at this example:     $$\frac{n^k}{k^k}\leq\binom{n}{k}\leq\frac{n^k}{k!}$$   What I started with is:  $$\binom{n}{k}\frac{1}{n^k}\leq\frac{1}{k!}$$ $$\frac{n!}{k!(n-k)!}\frac{1}{n^k}\leq\frac{1}{k!}$$ $$\frac{(n-1)!}{(n-k)!n^{k-1}}\leq1$$ This is where I got stuck. How can I prove that is is lower than or equal to 1? Could you give me a hint? I've come across the word litotes, which means a rhetorical understatement. However, I’m having trouble understanding how to use it in colloquial English. Could someone please give an example? DBRefs (Mongo Document references) not fetched eagerly What is the intuition behind beta distribution? Disclaimer: I'm not a statistician but a software engineer. Most of my knowledge in statistics comes from self-education, thus I still have many gaps in understanding concepts that may seem trivial for other people here. So I would be very thankful if answers included less specific terms and more explanation. Imagine that you are talking to your grandma :)  I'm trying to grasp the nature of beta distribution – what it should be used for and how to interpret it in each case. If we were talking about, say, normal distribution, one could describe it as arrival time of a train: most frequently it arrives just in time, a bit less frequently it is 1 minute earlier or 1 minute late and very rarely it arrives with difference of 20 minutes from the mean. Uniform distribution describes, in particular, chance of each ticket in lottery. Binomial distribution may be described with coin flips and so on. But is there such intuitive explanation of beta distribution?    Let's say, $\alpha=.99$ and $\beta=.5$. Beta distribution $B(\alpha, \beta)$ in this case looks like this (generated in R):     But what does it actually mean? Y-axis is obviously a probability density, but what is on the X-axis?   I would highly appreciate any explanation, either with this example or any other. $a^m=b^m$ and $a^n=b^n$ imply $a=b$ Let $D$ be an integral domain and let $a^m=b^m$ and $a^n=b^n$ where $m$ and $n$ are relatively prime integers, $a,b \in D$.   How do I show $a=b$? "There are several reasons proposed for the collapse of the bridge." There are several reasons proposed for the collapse of the bridge.   Is this present simple tense or the present perfect tense? I thought it might be the latter since there is a retrospective aspect to the sentence. However, I am quite unsure. So first let me state my homework problem:  Let $X$ be a set, let $\{A_k\}$ be a sequence of subsets of $X$, let $B = \bigcup_{n=1}^{+\infty} \bigcap_{k=n}^{+\infty} A_k$, and let $C = \bigcap_{n=1}^{+\infty} \bigcup_{k=n}^{+\infty} A_k$. Show that (a) $\liminf_k\; {\xi_A}_{_k} = \xi_B$, and $(b)$ $\limsup_k \;{\chi_A}_{_k} = \chi_C.$  I know that, in the context I am familiar with, that $$\liminf_{k\rightarrow +\infty}\; X_k = \bigcup_{k=1}^{+\infty} \bigcap_{n=k}^{+\infty} X_n$$ and $$\limsup_{k\rightarrow +\infty}\;X_k = \bigcap_{k=1}^{+\infty} \bigcup_{n=k}^{+\infty} X_n.$$   I also know that the characteristics (indicator) function is defined as $\chi_A(x) = \begin{cases} 1, &amp; x \in A \\ 0, &amp; x \notin A .\end{cases} $  So I wrote out $B$ in some of its `glory': $B= (A_1 \cap A_2 \cap A_3 \cap \cdots) \cup (A_2 \cap A_3 \cap \cdots) \cup (A_3 \cap A_4 \cap \cdots) \cup \cdots$, and as the first argument is the smallest, with increasing size to the right, the last term in the expression for $B$ would be $B$, which would be the largest.  So if I replace the $X_k$'s above with $\chi$'s I still don't see how I can get the correct answer - though it looks pretty clear from the definition of $B$ and that of $\liminf$ being basically the same, except in this case for the $\chi$.  Any direction would be greatly appreciated. By the way, I have checked out  but I was somewhat confused by the topology, the meets/joins, etc.  Thanks much, Nate ssh into an account which has no home directory