How to comparing two x significant doubles correctly
Round a double to x significant figures
Prove that any finite group $G$ of even order contains an element of order $2.$ How do you empty the buffers and cache on a Linux system? As you can see, the off-topic page isn&#39;t quite right...    Could this (minor) issue be fixed? Is $f(x)=10$ a periodic function? Poisson / exponential distribution Next weekend you will be participating in 12km cross country race on a mountain.The average time between  two successive wild animal sightings on the mountain is reported to be 5 minutes  (a) What is the probability that you see at least one wild animal in the 11th minute of the     race given that you will see 3 wild animals since the start of the race?  (b) What is the probability that it will take more than a quarter of a hour before you see a wild animal after ten minutes of running?  Now I have attempted (a) , but I don't know whether my thinking is correct. (b) on the other hand makes little sense to me.  My attempt:  (a)$ X~ Poisson(\frac{1}{5})$ and $Y~Exponential(\frac{1}{5})$  $Pr(X&gt;4) = Pr(X&gt;1)$  (I am thinking that this is some variation of the memoryless property)  $Pr(X&gt;1) =Pr(Y&lt;1)$  $Pr(Y&lt;1)= 1 - (e^{(\frac{-1}{5})})$  Perhaps, I was a bit to vague in my attempt of (a). So here goes my attempt of(b).From my understanding of the question , it is asking what it the probability that the time between events(in this case animal sightings) is more than 25 minutes given you have been running for ten minutes  Now from what I know the fact that you have been running ten minutes is irrelevant this is due to memory-less property of the exponential  distribution   so without further ado  I present my attempt at (b)   let $X $ be exponentially distributed random variable with $\lambda = 1/5$  then  $Pr(X &gt;15) = 1 - Pr(X &lt;= 15)$ Reset post score to 0 on migration I suggest that when a post is migrated from one site to another, that the question vote score get reset to zero (or perhaps only a negative vote score is reset to zero). Often people will downvote a question when the only thing that's "wrong" with it is that it's posted on the incorrect site. After migration, those downvotes hang around as a negative score and may unfairly bias the treatment of the question. The suffix -phobia means fear of, often irrational fear of.  For example, according to Wikipedia:       or ophiophobia is a particular type of specific phobia,   the abnormal fear of snakes.   Is there a suffix attachable to ophidio- which would describe a person who is not afraid of snakes, except for, say, a coiled rattler encountered on a trail, but who dislikes them and would not willingly share space with one?  Similarly, an  (don't click here if you are at all arachnophobic) is someone who loves spiders.  Is there a suffix for someone who likes spiders but does not love them?  These are Greek suffixes, and the Greeks, theoretically, were in favor of moderation.  So, are there suffixes in use in English, derivable from Greek or not, for moderate like and moderate dislike?    Edit to explain why the question:  "Is there a suffix for loathing" does not answer my question.  My question is NOT about fear and/or loathing.  My question is about moderate dislike (and moderate like).  I can watch a snake cross my driveway with interest, but would not want it in the house or lounging on my patio.   A person who loathed snakes would not be able to admire the smooth motion of the snake as it glided over the rough gravel and disappeared into the woods.  Loathe is very different from moderate dislike; Phobia is very different from caution. Why don't electromagnetic waves require a medium? Calculate first difference by group in R When I try to start Runescape I get an error message that says: CLassNotFoundException and lists Rs2Applet.class. How do I fix this so I can play? How do I calculate rotation caused by bounce friction? To prove that if $n$ is odd, then $8 \mid n^2−1$, observe that as $n$ is odd either $n = 4k+1$ for some integer $k$ or $n=4k+3$ for some integer $k$. In the first case $n^2 -1=8(2k^2+k)$ and in the second case $n^2-1 = 8(2k^2 + 3k + 1)$.  Given an odd integer $a$, establish that $a^2 +(a+2)^2 +(a+4)^2 + 1$ is divisible by $12$. Solve by consideration of six cases. How to change ubuntu install from legacy to uefi Can a countable set contain uncountably many infinite subsets such that the intersection of any two such distinct subsets is finite? Can a countable set contain uncountably many infinite subsets such that the intersection of any two such distinct subsets is finite? I was pondering a bit more about  question regarding being able to &quot;omit&quot; the base case in a proof by strong induction due to vacuous truth. The post states:  Strong induction proves a sequence of statements $P(0), P(1), …$ by proving the implication &quot;If $P(m)$ is true for all nonnegative integers $m$ less than $n$, then $P(n)$ is true.&quot; for every nonnegative integer $n$. There is no need for a separate base case, because the $n=0$ instance of the implication is the base case, vacuously.  However, if we consider $n=0$, we would have that the statement is vacuously true, which I would take to mean that the implication is true regardless of the validity of $P(0)$. However, clearly it's necessary for $P(0)$ to hold for an induction proof to be valid. So I'm confused on how, by omitting the base case, $n=0$ isn't just a tautology, making the implication true regardless of whether $P(0)$ actually holds. This is a follow-up to .     When I click a link to an SE site in the Android app, it gives me an "open with" pop-up that has two options:         Chrome   Stack Exchange         I can then choose to open SE posts like this "Just once" or "Always."      The problem is that when I set the SE app to "always," and I click "open in browser,"   Except, the app crashes when trying to open it in browser.  LogCat (just right after selecting "Open in browser")  01-22 18:03:36.354: E/AndroidRuntime(16064): FATAL EXCEPTION: main 01-22 18:03:36.354: E/AndroidRuntime(16064): Process: com.stackexchange.marvin, PID: 16064 01-22 18:03:36.354: E/AndroidRuntime(16064): java.lang.NullPointerException: Attempt to invoke interface method 'int java.util.List.size()' on a null object reference 01-22 18:03:36.354: E/AndroidRuntime(16064):    at com.stackexchange.marvin.utils.Helpers.getNonMarvinViewIntent(Helpers.java:452) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at com.stackexchange.marvin.ui.question.QuestionDialog$1.onClick(QuestionDialog.java:39) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at com.android.internal.app.AlertController$AlertParams$3.onItemClick(AlertController.java:1108) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.widget.AdapterView.performItemClick(AdapterView.java:310) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.widget.AbsListView.performItemClick(AbsListView.java:1145) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.widget.AbsListView$PerformClick.run(AbsListView.java:3066) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.widget.AbsListView$3.run(AbsListView.java:3903) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.os.Handler.handleCallback(Handler.java:739) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.os.Handler.dispatchMessage(Handler.java:95) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.os.Looper.loop(Looper.java:148) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at android.app.ActivityThread.main(ActivityThread.java:5417) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at java.lang.reflect.Method.invoke(Native Method) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at com.android.internal.os.ZygoteInit$MethodAndArgsCaller.run(ZygoteInit.java:726) 01-22 18:03:36.354: E/AndroidRuntime(16064):    at com.android.internal.os.ZygoteInit.main(ZygoteInit.java:616)   I suspect it's related to , but not sure.  Specs:   Device model: Nexus 5 Android version: Android 6.0.1 SE app version: 1.0.82 (beta) Installed browser: Chrome 47.0.2526.83 (latest at current writing) I am trying to mimic the interesting proof from  to give a generating set of the ideal correspond to the $d$-uple embedding: We fix the notation $\Delta = \big\{ (\nu_0, \dots, \nu_n) \in {\mathbb{N}}^{n+1}_0 ~:~ \nu_0 + \dots + \nu_n = d \big\}$. The polynomial map is $\theta : k[y_\nu : \nu \in \Delta] \rightarrow k[x_0, \dotsc, x_n]$ given by $$ \theta ( y_\nu ) := x^{\nu_0}_0 \cdots x^{\nu_n}_n $$ and we know that ${\mathrm{ker}}~\theta$ is the ideal of the $d$-uple embedding, i.e., $\rho_d({\mathbb{P}}^n) = Z({\mathrm{ker}}~\theta)$ (cf. Exercise I.2.12 Hartshorne). Now let $W \leq k[y_\nu : \nu \in \Delta]$ denote the ideal $$ W := \Big\langle y_{\tau_1} y_{\tau_2} - y_{\tau^{\prime}_1} y_{\tau^{\prime}_2} ~:~ \tau_1, \tau_2, \tau^{\prime}_1, \tau^{\prime}_2 \in \Delta, \tau_1 + \tau_2 = \tau^{\prime}_1 + \tau^{\prime}_2 \Big\rangle $$ Clearly, $W \subseteq {\mathrm{ker}}~\theta$. Using the lemma in the above link, we need to produce a $k$-subspace $T \subseteq k[y_\nu : \nu \in \Delta]$ with the conditions $$ T + W = k[y_\nu : \nu \in \Delta], \hspace{.2in} \theta \lvert_{T} = {\mathrm{injective}} $$ After a few thoughts it seems reasonable to think of the following subspace as a candidate for $T$: First define the equivalence relation on $\Delta \times \Delta$ given by $(\tau_1, \tau_2) \sim (\tau^{\prime}_1, \tau^{\prime}_2)$ if $\tau_1 + \tau_2 = \tau^{\prime}_1 + \tau^{\prime}_2$. Let $\Omega \subseteq \Delta \times \Delta$ be a subset with a unique representative from each class of $\sim$. Now let $T$ be the $k$-span of the monomials $y^{\alpha_1}_{\tau_1} \dotsc y^{\alpha_r}_{\tau_r}$ (with the distinct elements $\tau_1, \dotsc, \tau_r \in \Delta$ and $\alpha_1, \dotsc, \alpha_r \geq 1$) such that $(\tau_i, \tau_j) \in \Omega$ for each $i \neq j$. Clearly, $\theta$ is injective if restricted to $T$. I got lost in the step : Each monomial $M$ of $k[y_\nu : \nu \in \Delta]$ satisfy $M \equiv b$ mod $W$ for some $b \in T$. Did I do anything wrong? Is there a difference between Bayesian and Classical sufficiency? The title pretty much says it all. I wonder whether there is any difference in the way Bayesians understand sufficiency vs. the way orthodox statistics understands sufficiency, or are they equivalent?  If there is a difference, what is it? Is an integer a sum of two rational squares iff it is a sum of two integer squares? Let $a\in \mathbb Z$. Is it true that $a$ is a sum of two squares of rational numbers if and only if it is a sum of two squares of integers?  I came to face this problem while dealing with quaternion algebras. Can't boot Windows 7 after installing Ubuntu I installed Ubuntu yesterday alongside Windows 7 and whenever I start my computer I don't have the option to boot Windows. When the computer starts it goes straight to Ubuntu without giving me an OS selection menu. When it goes to Ubuntu it gives me Ubuntu repair options and Ubuntu normal start option. I still have all of the Windows 7 files on my hard drive, but Windows 7 has no way to boot.