Now that   (officially, it is today), I tried to add the Stack Exchange OpenID to my account at . It failed for the Stack Exchange OpenID, but it worked using the Google OpenID.  Doing it    Crashed and burned After entering the email address and password (as for a normal login at a Stack Exchange site), I get the error  Detected an attempt to send an assertion when the identifier () is not owned by the logged in user.,   I tried with Firefox (with ) and Google Chrome. I also tried restarting the browsers and tried logging out from all Stack Exchange sites prior to an attempt. Resolution? Is this a bug in the Stack Exchange OpenID implementation, and is there a work-around?
The SourceForge signon page says I can associate an OpenID with my existing SourceForge account:    I enter my currently-signed-in SourceForge account password I select the custom OpenID URL and enter https://openid.stackexchange.com I'm redirected to https://openid.stackexchange.com/account/login?&lt;session key bits&gt; I enter my openid.stackexchange.com login information there I get the error message:     Cannot Complete Login      Detected an attempt to send an assertion when the identifier () is not owned by the logged in user.    I don't understand what that means.
How to turn off the iOS-style character picker menu I am flying from New Orleans to Dulles (IAD) on United Express, and from IAD to Frankfurt on United. I have a short connection (45 minutes) in IAD.   I'm trying to figure out how can I make it:  Will I need to go throughout security and border check since I'm leaving the US? How big is IAD airport? and are there different terminals for domestic and international flights? If so, how long would it take to walk between them? Formatting a float to ###.## (two decimals) I can buy Dell Latitude E7270 through my employer. It will come with Windows, but I would like to install Ubuntu (most likely 14.04). This model does not appear on the list of certified hardware, however. Does anyone know whether I should anticipate any problems with his laptop? Thanks! With variable length instructions how does the computer know the length of the instruction being fetched? String comparison in Python: is vs. == How to run a complete GUI as root? I don't care if I mess up the system (which is likely if I do things like this), or the potential security issues that this could imply. Note, that I don't just want to "", but run my GUI from bottom-up as root. I don't want to type my password for anything but just for login and have total control over it.  Of course, I want any application running as root, like Firefox, LibreOffice, etc. without having to mess up with the terminal. So, how do I do this?     This question tries to address users that do not like the current permission system with root being separated from normal users. I do not endorse such behaviors, but if a user wants to, for whatever reason, this question should fit their corncerns.   Not advisable for new users Using Rule of Three to obtain confidence interval for a binomial population I have a large population of data instances (say, 1000 instances) that are either of class1 or of class2. I would like to obtain a confidence interval for how many instances are of class1 without exhaustively checking all instances. I have randomly sampled 50 instances, and all 50 were of class1. I used the  to determine that a 95% confidence interval for the percentage that an instance is of class1 is  [0.94, 1].  From my sampling, I know that at least 50 instances are of class1. For the remaining 1000 – 50 = 950 instances whose classes are unknown, I assume I can apply the [0.94, 1] confidence interval found above. Therefore, can I conclude that, with a 95% confidence, there are at least 50 + (1000 – 50)(0.94) = 943 instances from the population of 1000 that are of class1?  If this conclusion isn’t statistically sound, how can I obtain a confidence interval for class1? Baby is 2 years 2 months old.  What will happen if we don't stop and at what age should we stop? Why?  From: What to Expect The Toddler Years (Arlene Eisenberg, ‎Heidi Murkoff, ‎Sandee Hathaway - 2009)     Even if a child doesn't show any such interest, family nudity could become a problem by age three, when it's believed that some children unconsciously become sexually stimulated by parental nudity, and are confused and embarrassed by these feelings. So it's probably wise to start donning bathrobes and segregating showers by your toddler's third birthday. You can explain such a change by saying, 'Now that you're older, you need to have some privacy, and so do I.' $\mathbb Z[\sqrt 3]$ contains infinitely many units I want to show for $x\in\mathbb{R}$, the following inequality holds. $$ \left|\sin x\right|+\left|\sin (x+1)\right|+\left|\sin (x+2)\right|&gt;8/5. $$ This trigonometric inequality has been verified by Mathematica using the Plot commend. However, using the sum formula for the sine function seems doesn't work, and I cannot give a rigorous proof of it. Any suggestion, idea, or comment is welcome, thanks! Understanding MongoDB BSON Document size limit Proving Cauchy condensation test I have to prove the  by tomorrow and I am really unconfident about what I did:  $$\sum_{n=1}^\infty a_n\text{ converges } \iff \sum_{n=1}^\infty 2^n a_{2^n}\text{ converges}$$  I did the following:  Let $(b_n)$ be a sequence as follow: $b_{2^k+m}:=a_{2^k}$ with $k\in\mathbb N_0$ and $0\leq m&lt;2^k$.  It's $a_{n+1}\leq a_n$ and so $0\leq a_{n+p}\leq a_n$ for all $n,p\in\mathbb N$.  So $\sum\limits_{n=1}^\infty b_n$ converges by the majorizing series $\sum\limits_{n=1}^\infty a_n$. And it's $\sum\limits_{n=0}^\infty b_n=\sum\limits_{n=0}^\infty\sum\limits_{m=0}^{2^n-1}a_{2^{n+1}}=\sum\limits_{n=1}^\infty 2^{n-1}a_{2^n}$ so $\Rightarrow$ is done.  For $\Leftarrow$ consider $c_{2^k+m}:=a_{2^k}$ with $k\in\mathbb N_0$ and $0\leq m&lt;2^k$.  It's $|a_n|\leq c_n$ and $\sum\limits_{n=0}^\infty c_n=\sum\limits_{n=0}^\infty\sum\limits_{m=0}^{2^n-1}a_{2^{n}}=\sum\limits_{n=1}^\infty 2^{n}a_{2^n}$ and so $\sum\limits_{n=1}^\infty a_n$ converges by the majorizing series $\sum\limits_{n=0}^\infty c_n$.  Is this in form and content correct? Use Cauchy product to find a power series represenitation of   $$1 \over {(1-x)^3}$$ which is valid in the interval $(-1,1)$.   Is it right to use the product of $1 \over {1-x}$ and $1 \over {(1-x)^2}$ if I know thier expantion (HOW).. Is there another way? Why is there this strange contradiction between the language of logic and that of set theory? In standard probability theory events are represented by sets consisting of elementary events. Consider two events for which (as sets) $A \subset B$. If an elementary event $x \in A$ takes places then we say that $B$ takes place as well. Since $A \subset B$, $x \in A$ implies that $B$ takes place too.  It seems that when for sets (representing events) $$A \subset B$$ $$then \ A \ implies \ B .$$  On the other hand, if we use the language of logic for the events then $$A \supset B$$ $$ \ means\  that \ A\  implies\ B .$$  Why is this strange virtual contradiction between the language of sets and the language of logic?  (In order to avoid down votes and unplesant comments I reveal that I happen to know that the true translation of the sentence $A \supset B$ of logic to the language of sets (representing events) is $\overline{A \cap \overline B}$.) Why does  get a pass, but I can't ask my own book recommendation question? Can I ask my own book recommendation question in a way that is acceptable to the community, like the C++ book list question? CSS Pseudo-classes with inline styles Legendre symbol, second supplementary law $$\left(\frac{2}{p}\right) = (-1)^{(p^2-1)/8}$$ how did they get the exponent. May be from Gauss lemma, but how.  Suppose we have a = 2 and p = 11. Then n = 3 (6,8,10), but not  $$15 = (11^2-1)/8$$  n is a way to compute Legendre symbols from Gauss lemma: $$\left(\frac{a}{p}\right) = (-1)^n$$ what's the type of movement when the electron jump from level to another when gaining or losing a quantum of energy is it actually jump or move in a specific movement? Proving bessel identity $[J_0(x)]^2 + 2[J_1(x)]^2 + 2[J_2(x)]^2 + \cdots = 1$ and $|J_0(x)|\le 1$ The generating function for a Bessel equation is:      $$g(x,t) = e^{(x/2)(t-1/t))}$$      Using the product $g(x,t)\cdot g(x,-t)$ show that:      a) $$[J_0(x)]^2 + 2[J_1(x)]^2 + 2[J_2(x)]^2 + \cdots = 1$$      and consequently:      b)      $$|J_0(x)|\le 1, \forall x$$      c) $$|J_n(x)| \le \frac{1}{\sqrt{2}}; n=1,2,3,\cdots$$   For a) I tried the product:  $$e^{(x/2)(t-1/t))}\cdot e^{(x/2)(-t+1/t))} = 1$$  I at least arrived at the right side of the equation. Since this generates the bessel functions, I should arrive at something related to $J_n$ in the left side. I know that  $$e^{(x/2)(t-1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)t^n$$  $$e^{(x/2)(-t+1/t))} = \sum_{n=0\infty}^{\infty} J_n(x)(-t)^n$$  but it's not just a matter of multiplying coefficients from the two infinite series, right?  For $b$, I tried to use  but it's not as obvious  I have no idea how to deal with $c$, could somebody help me?