Probability of having an even number of a specific face value of a die Here is the question: Given a fair die rolled $n$ times, what is the probability of having an even number of $6$s?  My approach:  $$\Omega = \{(x_{1}, x_{2}, ..., x_{n}) :1 \le  x_{i} \le 6\}$$ So $$|\Omega| = 6^{n}$$ Since the probability is space is a finite uniform one, $$P(A) = \frac{|A|}{|\Omega|}$$ Let $A_{i}$ be the event that there are exactly $i$ sixes in the $n$-tuple. Then, $$A = \bigcup\limits_{i=0}^{\lceil{(n-1)/2}\rceil} A_{2*i}$$ Since these events are disjoint, $$P(A) = P(\bigcup\limits_{i=0}^{\lceil{(n-1)/2}\rceil} A_{2*i}) = \sum\limits_{i=0}^{\lceil{(n-1)/2}\rceil} P(A_{2*i})$$ Now, $|A_{i}| = \binom{n}{i} * 5^{n-i}$. Hence, $$P(A) = \frac{1}{6^n} \sum\limits_{i=0}^{\lceil{(n-1)/2}\rceil} \binom{n}{2i} * 5^{n-2i}$$ As a side note, when I fed this sum into wolfram alpha engine, it couldn't compute it.  The book however says the anwer is $$\frac{1}{2}(1 + (\frac{2}{3})^{n})$$ Any suggestions?
Probability of an even number of sixes We throw a fair die $n$ times, show that the probability that there are an even number of sixes is $\frac{1}{2}[1+(\frac{2}{3})^n]$. For the purpose of this question, 0 is even.   I tried doing this problem with induction, but I have problem with induction so I was wondering if my solution was correct:   The base case: For $n=0$, our formula gives us $\frac{1}{2}[1+(\frac{2}{3})^0] =1$. This is true, because if we throw the die zero times, we always get zero sixes.  Suppose it's true for $n=k$. Then the odds of an even number of sixes is $\frac{1}{2}[1+(\frac{2}{3})^n]$, and thus the odds of an odd number of sixes is $1 - \frac{1}{2}[1+(\frac{2}{3})^n]$.    For $n=k+1$, there are two ways the number of sixes are even:  a. The number of sixes for $n=k$ was even, and we do not throw a six for $n=k+1$: $ \frac{5}{6} \cdot  \frac{1}{2}[1+(\frac{2}{3})^n]$  b. The number of sixes for $n=k$ was odd, and we throw a six for $n=k+1$: $\frac{1}{6}(1 - \frac{1}{2}[1+(\frac{2}{3})^n])$  So the probability $p$ for an even number of sixes at $n=k+1$ is $ \frac{5}{6} \cdot  \frac{1}{2}[1+(\frac{2}{3})^n] + \frac{1}{6}(1 - \frac{1}{2}[1+(\frac{2}{3})^n])$  I have two questions   How do I get from $ \frac{5}{6} \cdot  \frac{1}{2}[1+(\frac{2}{3})^n] + \frac{1}{6}(1 - \frac{1}{2}[1+(\frac{2}{3})^n])$ to $\frac{1}{2}[1+(\frac{2}{3})^n]$? I seem to have done something wrong, I can't get the algebra correct, I get $p = \frac{1}{3}[1+(\frac{2}{3})^n] + \dfrac{1}{6}$ Other than that, is my use of induction correct? Is it rigorous enough to prove the formula?
Given $a,b,c,d \in \mathbb{Z}$, there is $x,y$ such that  $$(a^2 + b^2)(c^2 + d^2) = x^2 + y^2$$  One can show this by considering the complex number $a + bi$ and $c+ di$, using complex properties to deduce that $x = ac - bd, y = ad + bc$ is a solution.   However, given that either $a^2, b^2$ are distinct or $c^2,d^2$ are distinct, then how can one can find nonzero solutions $x,y$?  Sorry, I am assuming $a,b,c,d$ are nonzero. How can gravity affect light? What is this agglomeration of pink cells I found attached to a stone? How to minimize the ink-to-data ratio for pgfplots Density of $\mathbb{Q}^n$ in $\mathbb{R}^n$ show that $x$ is in $\ell^1$ if $\sum x_ny_n$ is convergent for all $y=(y_n)\in{c_0}$ If $x=(x_n)$ is a sequence of complex numbers such that the series $\sum  x_ny_n$ is convergent for all $y=(y_n)\in{c_0}$. Then prove that $x\in{\ell^1}$. Can anyone tell me what is the meaning of $c_0$  in this question and how to proceed on proving it. Are proofs by contradiction really logical? Play a Sound with Python What are the increased possibilities (if any) of being able to crack a private key given the following:   The associated bitcoin (ECDSA Secp256k1-based) public key is known. The private key has been used to generate a public key from a different ECDSA curve and that public key is also known. It is known that the two public keys are derived from the same private key. It is known which ECDSA curves were used to generate the public keys. It is known which ECDSA curve was used to generate which public key.   Does it make any more difference if there is data that is known to have been signed by the private key and the signature(s) are known and the raw data is known?  EDIT: I should have pointed out that the conditions are ANDed, I.e. All conditions are known. Sorry, I should have been clearer the first time. Abelian quotient group I'm stuck on the following practice problem.   Any hints would be appreciated.  Suppose $N$ is a normal subgroup of  $G$ such that every subgroup of $N$ is normal in $G$ and $C_{G}(N) \subset N$. Prove that $G/N$ is abelian.  I'm not sure how to use the fact that $C_{G}(N) \subset N$.  Thanks Unexpected behavior of rule matching a pattern I'd like to user a FIDO2 key to log into Windows 10. There are various guides explaining how to add a key to a Microsoft web account, or to Windows 10 sign in options, but neither result in showing up as an option when I try logging into Windows.  How can I configure windows to use my FIDO2 key to log in? i install ubuntu and followed a guide to put 20gb in '/' and the rest (150gb) in '/home'. Now i just found out that a lot of the things installed in ubuntu usually goes to '/' instead of '/home'. I have a lot more things to install.  So what is the point of '/home' ? How do I fix this ? Should I transfer 150gb from '/home' to / ?  Filesystem      Size  Used Avail Use% Mounted on udev            7.8G     0  7.8G   0% /dev tmpfs           1.6G  9.5M  1.6G   1% /run /dev/sda6        19G   16G  1.8G  91% / tmpfs           7.8G  676K  7.8G   1% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           7.8G     0  7.8G   0% /sys/fs/cgroup /dev/sda2        96M   29M   68M  31% /boot/efi /dev/sda8       159G  1.1G  150G   1% /home tmpfs           1.6G   56K  1.6G   1% /run/user/1000   what is /boot ? Its not '/' or '/home' How can I change the local origin of an object, without changing the object location in the world space.  This is the object located at position (0,0,0) in the world space    This is the same object located at position (0,1,0) in the world space, but with its local origin offset so that the object is in the same place    Is there a way to do this in a single step? What is the lowest level of mathematics required in order to understand how encryption algorithms work? What mathematical fields of knowledge would be required in order to get a good understanding of encryption algorithms?   Is it basic algebra, or is there a "higher education" mathematical field dedicated to encryption? I know there is the cryptography field, but what is the subset of knowledge required for cryptographers? How to show $\lim_{x \to 1} \frac{x + x^2 + \dots + x^n - n}{x - 1} = \frac{n(n + 1)}{2}$? I am able to evaluate the limit $$\lim_{x \to 1} \frac{x + x^2 + \dots + x^n - n}{x - 1} = \frac{n(n + 1)}{2}$$ for a given $n$ using l'Hôspital's (Bernoulli's) rule.  The problem is I don't quite like the solution, as it depends on such a heavy weaponry. A limit this simple, should easily be evaluable using some clever idea. Here is a list of what I tried:   Substitute $y = x - 1$. This leads nowhere, I think. Find the Taylor polynomial. Makes no sense, it is a polynomial. Divide by major term. Dividing by $x$ got me nowhere. Find the value $f(x)$ at $x = 1$ directly. I cannot as the function is not defined at $x = 1$. Simplify the expression. I do not see how I could. Using l'Hôspital's (Bernoulli's) rule. Works, but I do not quite like it.   If somebody sees a simple way, please do let me know.    Added later: The approach proposed by Sami Ben Romdhane is universal as asmeurer pointed out. Examples of another limits that can be easily solved this way:   $\lim_{x \to 0} \frac{\sqrt[m]{1 + ax} - \sqrt[n]{1 + bx}}{x}$ where $m, n \in \mathbb{N}$ and $a, b \in \mathbb{R}$ are given, or $\lim_{x \to 0} \frac{\arctan(1 + x) - \arctan(1 - x)}{x}$.   It sems that all limits in the form $\lim_{x \to a} \frac{f(x)}{x - a}$ where $a \in \mathbb{R}$, $f(a) = 0$ and for which $\exists f'(a)$, can be evaluated this way, which is as fast as finding $f'$ and calculating $f'(a)$.  This adds a very useful tool into my calculus toolbox: Some limits can be evaluated easily using derivatives if one looks for $f(a) = 0$, without the l'Hôspital's rule. I have not seen this in widespread use; I propose we call this Sami's rule :). Prove $[\sin x]' = \cos x$ without using $\lim\limits_{x\to 0}\frac{\sin x}{x} = 1$ I came across this question:   From the comments, Joren said:     L'Hopital Rule is easiest: $\displaystyle\lim_{x\to 0}\sin x = 0$ and $\displaystyle\lim_{x\to 0} = 0$, so $\displaystyle\lim_{x\to 0}\frac{\sin x}{x} = \lim_{x\to 0}\frac{\cos x}{1} = 1$.   Which Ilya readly answered:     I'm extremely curious how will you prove then that $[\sin x]' = \cos x$   My question:  is there a way of proving that $[\sin x]' = \cos x$ without using the limit $\displaystyle\lim_{x\to 0}\frac{\sin x}{x} = 1$. Also, without using anything else $E$ such that, the proof of $E$ uses the limit or $[\sin x]' = \cos x$.    All I want is to be able to use L'Hopital in $\displaystyle\lim_{x\to 0}\frac{\sin x}{x}$. And for this, $[\sin x]'$ has to be evaluated first.    Alright... the definition that some requested.   Def of sine and cosine: Have a unit circumference in the center of cartesian coordinates. Take a dot that belongs to the circumference. Your dot is $(x, y)$. It relates to the angle this way: $(\cos\theta, \sin\theta)$, such that if $\theta = 0$ then your dot is $(1, 0)$.  Basically, its a geometrical one. Feel free to use trigonometric identities as you want. They are all provable from geometry. As a programmer, I have no problem with seeing or using "and/or" in technical documentation. For example,     I can upvote an answer that satisfies me and/or mark it as accepted.   That's perfectly good English to me. However, if I were writing a novel, or even just an essay, or — heaven forbid — a poem, "and/or" would seem extremely out of place.  My question is, what should I be using instead? (I solemnly swear I will not use that knowledge to actually write a poem.) Plot construction for a velocity vs position graph. Interpolation for phase-diagram construction? Showing that $f_0 (x_1, \ldots, x_m) \mathrm tr A =\displaystyle{ \sum_{i=1}^n} f_0(x_1, \ldots, Ax_i,\ldots, x_m)$