How to resolve "Input string was not in a correct format." error?
Input string was not in a correct format
How do I catch a PHP fatal (`E_ERROR`) error? I can use set_error_handler() to catch most PHP errors, but it doesn't work for fatal (E_ERROR) errors, such as calling a function that doesn't exist. Is there another way to catch these errors?  I am trying to call mail() for all errors and am running PHP 5.2.3. Boggle: What is the dice configuration for Boggle in various languages? This is the dice configuration for the English Boggle:  Other variants and discussions concerning letter distributions for English can be found here:  , , ,  (Wikipedia).  I am interested in the 16 dice configurations for also other languages (Spanish in particular) and I am unable to find it anywhere online.  Versions I have managed to find so far:  ,  English 25 dice version:   Spanish 25 dice version:   Italian 25 dice version: I'm trying to prove the following statements in Folland's book.  Let $(X,\mathcal{M},\mu)$ be a measure space. If $f_n\to f$ in measure and $g_n\to g$ in measure, then $f_n+g_n\to f+g$ in measure and $f_ng_n\to fg$ in measure (in this last case, assume $\mu(X)&lt;\infty$).  The first one is already done, but the second one is giving me trouble.   My attempt: We can take subsequences $f_{n_k}$ and $g_{n_k}$ such that $f_{n_k}\to f$ a.e. and $g_{n_k}\to g$ a.e. In this case, we know that $f_{n_k}g_{n_k}\to fg$ a.e. Note that $\mu(X)&lt;\infty$, so we can use Egoroff's theorem to conclude that $f_{n_k}g_{n_k}\to fg$ almost uniformly. Finally, almost uniform convergence implies convergence in measure, therefore $f_{n_k}g_{n_k}\to fg$ in measure.   The problem is that I just have convergence in measure for some subsequence of $f_ng_n$ and I need convergence in measure for the whole sequence. Also I don't know if using Egoroff's theorem is unnecessary, if this is the case, I would appreciate to see some more elementary prove.  Detail: We say that $f_n\to f$ almost uniformly if for every $\varepsilon &gt; 0$ there is some $E\subset X$ measurable, such that $\mu(E) &lt;\varepsilon$ and $f_n\to f$ uniformly on $E^c$.  Thank you! series of young adult science fiction books from early 1980s about last of a race of martial experts that sees the destruction of his home planet How to automatically rotate images based on EXIF data? I'm trying to install the  IDE in my Ubuntu and in the process it's asking for my root password which I don't remember. I know my  user password. How can I recover my root password? Microsoft recommends using Rowversion over timestamp, but I can not find "rowversion" data type inside my sql server 2008 R2 Microsoft  mentioned that we should use the rowversion data type over Timestamps. Now inside my SQL Server 2008 R2, I want to create a column with the Rowversion data type. But in my SQL Server 2008 R2 Management Studio, I cannot find such a data type:  Also when I tried altering existing column named timestamp which is of type timestamp using this statement: ALTER TABLE [SkillManagement].[dbo].[Customer] ALTER COLUMN timestamp rowversion   I get this error: Msg 4927, Level 16, State 1, Line 1 Cannot alter column 'timestamp' to be data type timestamp  Can anyone advise? EDIT What's the quickest Schengen consulate to issue a visa in London? Today I was thinking about composition of functions.  It has nice properties, its always associative, there is an identity, and if we restrict to bijective functions then we have an inverse.  But then I thought about commutativity.  My first intuition was that bijective self maps of a space should commute but then I saw some counter-examples. The symmetric group is only abelian if $n \le 2$ so clearly there need to be more restrictions on functions than bijectivity for them to commute.  The only examples I could think of were boring things like multiplying by a constant or maximal tori of groups like $O(n)$ (maybe less boring).  My question: In a euclidean space, what are (edit) some nice characterizations of sets of functions that commute? What about in a more general space?   Bonus: Is this notion of commutativity important anywhere in analysis? Are there any galois fields which consist of product of two primes, as in $\mathrm{GF}(2\cdot 3) = \mathrm{GF}(6)$? I have to prove that a function $f:]0,1] \rightarrow \Bbb R$ : $$ f(x) = \begin{cases} \frac1q,  &amp; \text{if $x \in \Bbb Q$  with $ x=\frac{p}q$ for $p,q \in \Bbb N$ coprime} \\ 0, &amp; \text{if $x \notin \Bbb Q $} \end{cases} $$  is discontinuous in every point $x \in \ ]0,1] \cap\Bbb Q$.  And then to consider $x \in \ ]0,1] \backslash \Bbb Q$ and prove that it is continuous.  For now I learned different ways to prove continuity (epsilon-delta, sequences), but I'm never sure what would be better to use in each different case.  I wanted to prove the discontinuity by using sequences: $$\forall x_n \quad x_n\rightarrow a \quad \Rightarrow \quad f(x_n) \rightarrow f(a)$$  I tried creating a sequence $ x_n=\frac1n + a$, we know it converges to $a$ but $f(x_n)\ $ doesn't  converges to $\ f(a)$ because there would still be some points not in our set (irrational numbers that creates gaps).  But I don't think it works, so I'm asking you if you could help me solving the two questions. At what stage should acknowledgements be inserted into the paper if review is not double-blind? When the review process is double-blind, I guess (although I have not read this anywhere) that acknowledgements should not be written in the submitted paper, as this might break anonimity. They should only be inserted into the camera-ready version, after the paper is accepted.  What is the custom when the review process is not double-blind? Should I write the acknowledgements in the submitted version, or wait to the camera-ready version? How to prove $\,x^a-1 \mid x^b-1 \iff a\mid b$ Parallel.ForEach Slower than ForEach Bootstrapped confidence intervals: different values at every computation? I am running an ANOVA and computing bootstrapped CIs for my effect sizes. I am using for this the Measures of Effect Size Toolbox for Matlab.  To my surprise, if I re-run the same line of code, i.e. compute the same thing for the same data, the lower&amp;upper margins of the CI are slightly different each time.  I know that bootstrapped CIs are built from permutation analyses based on random generations of distributions. Still, I do not remeber reading anywhere this odd property of CIs of being never twice the same! What is an Electron? I am a n00b to physics. What physics I know comes from high school and popular science books.  At school we were taught about atoms and what make up atoms, but we weren't actually told what the particles were!  So sure an atom has electrons orbiting around a nucleus made of protons and neutrons, but what exactly is an ?  And if we don't know, how can we fire them from guns, like they do in experiments ... etc  Any clarification on this would be great. “Are” vs. “is” after “parents and the family” Messed up my PATH environment variable and can't login to desktop To get an maven environment variable to run, I tried several options. Basically, I followed some options from , such as ~/.pam_environment, /etc/bash.bashrc and I don't really know anymore. Within them I exported sth like export PATH=/opt/apache-maven-3.6.0/bin:$PATH (I'm being so unconcrete because I cannot look it up).   Afterwards, I did run gnome-session-quit and my machine got stuck.   So after hard restart I try to login again, but I'm not able to do that: I see my username, enter the password, hit enter, screen turns black and after 2 seconds I'm back at the login screen.   So, that very strange and worrying. Next step: Login via tty (Strg + ALT + F3). Within there I can login, but can not do much. I thought about sth like . But whatever I do: The command could not be located because '\bin' is not included in the PATH environment variable. I think, altogether thats alarming and I'm getting really nervous.  Executing export PATH="/usr/bin:$PATH seems to work and echo $PATHgives an output starting with /usr/bin:/usr/bin:/usr/bin:/home/user/Documents/.../esper/examples/transaction/etc:/home/user/anaconda3/bin:/usr/lib/jvm/java-1.8.0-openjdk-amd64/bin:/opt/apache-maven-3.6.0/bin:/opt/apache-maven-3.6.0/bin:/opt/apache-maven-3.6.0/bin but does not really help.  I'm running an Ubuntu 18.04 on an Lenovo G50-70.   Can you help me accessing my desktop again and/or fixing my PATH issue? I'm fairly certain this has happened to all of us at some point: You go into a room to get something, but once you're there, you can't remember what you intended to get. It seems like a specific, common phenomenon like this must have a name, but I can't think of it. Does anyone know a name (either formal or slang) for this?  I don't want a general term like forgetfulness or absent-mindedness, which could apply to all sorts of forgetting, or a term for not being able to remember a certain word. I'm looking for a word or phrase that describes this one specific situation of forgetting what you need to get as soon as you go to get it. Difference estimate & confidence intervals for $\chi^2$ test between 2 proportions I am using a chi-sq test between two proportions (). I am using this over the z-test for proportions because I do not think my data is normal.   My question is how do I get the difference (shift) estimate &amp; confidence intervals for this test.   For example,     Data1: 193/252=.77   Data2: 154/227=.68   P-value=.032 (I used the formula in the link above. I will also add my exact code below)  Shift Estimate: I assume its the difference between proportions, ie .77-.68=.09. Is this correct?   Confidence Interval: ??????????????????  Code for generating P-value (matlab):   % Pooled estimate of proportion  p0 = (n1+n2) / (N1+N2); % Expected counts under H0 (null hypothesis)  n10 = N1 * p0;  n20 = N2 * p0; % Chi-square test, by hand  observed = [n1 N1-n1 n2 N2-n2];  expected = [n10 N1-n10 n20 N2-n20];  chi2stat = sum((observed-expected).^2 ./ expected);  p = 1 - chi2cdf(chi2stat,1);  H=0; if(p&lt;.05), H=1; end