RSA attack, 1 message with different keys?
Deciphering the RSA encrypted message from three different public keys
How do you add CSS rules (eg strong { color: red }) by use of Javascript? Skype window problem in Ubuntu 14.04 As a disclaimer, I must admit this may benefit me (I haven't checked), but probably not as significantly as most others. This issue is also something that has prevented me from answering questions by users with 1 rep in the past, especially if they are poorly fashioned. The Problem New users with a programming question find SO from various methods, such as google. They ask a question with haste, hoping for a quick answer -- which they usually receive. Many of these users have no interest in Stack Overflow itself, but are simply interested in getting the solution they require. As a result of this, they'll check the site regularly for the first day or two until a sufficient answer has been posted. Once they get what they need, they bail; without the required rep or understanding that they should up-vote and select a response as the answer. The Result A great many questions on SO are abandoned by users with no intention of ever coming back. The answer they require has been provided, but for one or more reasons they have neglected their duty of contributing back by way of awarding reputation. The Reach (Since Jeff loves Datum) Some queries on the data dump examine the reach of this 'problem'. The query I used is based on extensions of the following base query; SELECT p1.Id, p1.Score, p1.OwnerUserId, p2.OwnerUserId, p2.Score FROM posts p1  INNER JOIN posts p2 ON (p1.Id=p2.ParentId) LEFT JOIN users ON (p1.OwnerUserId=users.Id) WHERE p2.Score &gt;= 2  AND p2.Score = ( SELECT MAX(p3.Score) FROM posts p3 WHERE p3.ParentId=p1.Id ) AND users.Reputation &lt; 15 AND p1.PostTypeId = 1 AND p1.AcceptedAnswerId = 0  Result: 3,288 Questions by users with under 15 rep which have answers with 2+ up votes that have no accepted answer. Adding: AND (users.LastAccessDate-p1.LastActivityDate) &lt; 604800 // 1 week AND p1.CreationDate &lt; 1249084800 // 1249084800 is 1 week before latest dump data  to the where clause further reveals that 877 questions that have answers with 2+ up votes have no accepted answer, and the owner of the question has not returned since the week the question was asked. Modifying there where clause, and removing the left join: AND p1.OwnerUserId = 0    Reveals a staggering 3,675 questions with answers of 2+ votes by deleted users.  These are questions that were probably answered but the users who did the work can never be recognized. Building off the previous and using an even more restrictive WHERE clause WHERE p2.Score &gt;=5  Still 1,178 posts that can never have an accepted answer. How many posts are there with over 5 up votes that don't provide the correct answer? Modifying the where clause for Reputation to AND users.Reputation = 1  Still reveals 388 questions by users with 1 rep have been abandoned. Solution Similar to how bounty questions work, if a user has abandons the site (not active since x time after the question was asked) with a question that has answers with 2+ up votes, force the answer with the most up votes to be the selected answer. This will reduce the amount of questions that are unanswered, and also give users more of an incentive to answer questions by new users without extra hesitation.  Update Added more statistics for deleted users.  Please feel free to add/remove rules to make this a truly practical feature. Is there a way to get the raw SQL string executed when calling PDOStatement::execute() on a prepared statement? For debugging purposes this would be extremely useful. Failed to fetch jessie backports repository I'm using a docker image as a base for my own development that adds the jessie backports repository in its Dockerfile and uses that to install a dependency. This image uses the following command to add the repository:  echo "deb http://ftp.debian.org/debian jessie-backports main" &gt;&gt; /etc/apt/sources.list   The problem is that fetching packages from the backports repository now  fails with the following error (this used to work previously):  W: Failed to fetch http://ftp.debian.org/debian/dists/jessie-backports/main/binary-amd64/Packages 404  Not Found  W: Failed to fetch http://deb.debian.org/debian/dists/jessie-updates/main/binary-amd64/Packages  404  Not Found   I looked on that server, and those paths are indeed not present there.  I tried to figure out on the Debian backports site whether this particular repository should still be available, and I didn't find any indication that this was deprecated or something like that.  Is this a temporary issue with the repository, or is the jessie-backports repository not available anymore? And if this is not a temporary issue, what options do I have to use this or an equivalent repository without upgrading to the newer Debian stable version? What follows if we fail to reject the null hypothesis? What conclusions can we draw if $p&gt;\alpha$? Does not rejecting the $H_0$ mean anything? I have read so many things already that I'm more confused than before. So decided to ask this by myself.  My paladin just got his Find Steed spell, and after some tweaking and talking, he decided to get a Worg and I was okay with it. This last session was his first time using it and I have few doubts when it comes to combat.  I know that while mounted, he uses the mounts movement and actions. But what about when unmounted? What if the combat began with him walking by his mount's side?   Does the mount share his initiative? Are the actions that the mount do, part of the Paladin's actions? Or are they both separately, having his Action, Movement and Bonus Action and then the mounts Action and movement?   We've stated that it can understand him but not talk back, he just telepathically receives feelings as a feedback to his commands, knowing that the mount understood what he needed. Last session he just said things to the mount like "I tell the mount to protect the ranger and the druid" and in case they got hit, it would attack them, but it didn't really do anything at all, as I didn't know when it would act and I had too many things already to remember about the mount. Should you include press interviews and articles about your work in your CV? Is it appropriate to include interviews (published online or in print magazines) in an academic CV?   What about articles/news published about your works? I mean brief (one paragraph) news that professional magazines publish about significant research articles.  If yes, how do you do this to avoid exaggeration? Why is $1$ not considered a prime number?  Or, why is the definition of prime numbers given for integers greater than $1$? How to identify "deictic center" for distinguishing "come" & "go"? Read this paragraph from this    My question is:  How to identify "deictic center" for distinguishing "come" &amp; "go"?  Let say I am at home &amp; I say "I am going to the zoo this evening", so the "deictic center" in this case is my home &amp; I move away my "deictic center".  But let say my friend Tom &amp; I currently at my home &amp; Tom said "Are you Coming to the zoo to see the lion?" &amp; I said "Ok, I am coming to the zoo this evening". So, the "deictic center" in this case is "the zoo" &amp; we move towards the "deictic center" (ie the zoo).  It feels like it is very arbitrary.  Note: See this , it said the selection of "deictic center" could be due to sympathy &amp; politeness. Whats this white stuff on my board? Why is a T distribution used for hypothesis testing a linear regression coefficient? In practice, using a standard T-test to check the significance of a linear regression coefficient is common practice. The mechanics of the calculation make sense to me.  Why is it that the T-distribution can be used to model the standard test statistic used in linear regression hypothesis testing? Standard test statistic I am referring to here:   $$ T_{0} = \frac{\widehat{\beta} - \beta_{0}}{SE(\widehat{\beta})} $$ Sum of $k {n \choose k}$ is $n2^{n-1}$ Proof that $\suṃ̣_{k=1}^{n}k {n \choose k}$ for $n \in \mathbb N$ is equal to $n2^{n-1}$.  As a hint I got that $k {n \choose k} = n {n-1\choose k-1} $.  I tried solving this by induction but, in the inductive step I'm not arriving to the correct result. How do I edit my profile? This is probably a noob question, but I forgot how to edit my profile.   Can anyone help me? There is no visible button for me. Suppose we have a natural number $n \ge 0$.  Given natural numbers $\alpha_1,\ldots,\alpha_k$ such that   $k\le n$ $\sum_i \alpha_i = n$   what is the maximum value that $\Pi_i \alpha_i$ can take?  I'm quite sure that there is a theorem telling me the result, but I cannot find it. For sure an upper bound is $n^k$ but I'm searching for a real upper bound. I'm pretty sure that upper the bound should be $n^2$, but I don't know I could prove it. How to calculate bounce angle? I played around with it for a while, but I simply can't figure it out.  I made a tank that fires missiles, and when the missiles hit the walls, I want them to bounce off, but I want them to bounce off to the right angle.  Right now I haven't got any obstacles, the missiles just bounce off when they get outside the viewportRectangle I made.  Is the solution I'm looking for quite advanced?  Is there a relativly simple way to do it? Can an iOS user play with pc users? I have a Mac only, so I am not able to get Terraria through Steam. I was wondering if I can play Terraria on my iPad Mini with a friend who has it on his PC. I was wondering this, because I saw that Deepworld on iOS is compatible with the Mac version. Find the coefficient of the term $x^2$ in $\left(x+\frac 2x\right)^{4}$ Find the coefficient of the term $x^2$ in $$\left(x+\frac 2x\right)^{4}$$   This is what I have done so far.  We know $a$ = $x$ and $b$ = $\frac2x$ and $n$ = 4  So what I have done is $4c2$ x $(x)^2$ x ($\frac2x$)$^2$  As we know that $^2$ + $^2$ = 4, and 4 is the $n$ value.  The answer is one though?  What have I done wrong?   P.S.  was the tutorial that helped me. FPDF error: Some data has already been output, can't send PDF How to estimate $P(x\le0)$ from $n$ samples of $x$? Suppose, we have $n$ samples $x_i$ of a random variable: $$x \sim \mathcal N(\mu,\sigma^2) $$ Based on the samples, we want to estimate the probability that $x$ is negative: $$P(x\le0)$$ Intuitively, I would first estimate: $$\hat \mu=\frac 1 n \sum x_i$$ $$\hat \sigma^2={\frac 1 {n-1} \sum (x_i-\hat \mu)^2}$$ and then calculate: $$P(x\le0)=\frac1{\sqrt{2\pi\hat\sigma^2}} \int_{-\infty}^0 e^\frac{x-\hat\mu}{\hat \sigma} dx$$ However $\hat \mu$ and $\hat \sigma$ have variance! If I use this method, I suspect I am ignoring that variance and making an incorrect estimation. Is this reasoning right? If so, how can I estimate $P(x\le0)$ more correctly, taking $\text {VAR}[\hat \mu]$ and $\text {VAR}[\hat \sigma]$ into account?