I've a problem with my individualized bullet points in itemize. The text is transparent, but the bullet points aren't. It looks like the following slide: The images for the bullet points are defined in a beamer theme template through: \setbeamertemplate{itemize item}{\includegraphics[height=1.6ex]{Dot_sub.png}} \setbeamertemplate{itemize subitem}{\includegraphics[height=3ex]{Dot_subsub.png}}  I want those defined images to also show up transperant in the beginning. How can I manage that? \begin{frame}[plain] \setbeamercovered{transparent}   \vspace{-0cm} \frametitle{Example slide}  \begin{itemize}     \item &lt;1-&gt;one    \item &lt;2-&gt;two    \begin{itemize}      \item &lt;3-&gt;one      \item &lt;4-&gt;two    \end{itemize} \end{itemize}  \end{frame}
With \setbeamercovered{transparent} covered parts of a slide are displayed transparently. If there is a (small) picture among the text, it is shown as it is. Beamer has only this picture, so it shows this picture. My question: How can I give a gray version of the picture to beamer such that in covered parts of a slide, this gray version is used?
Prove every element of $G$ has finite order. Let $G$ be a group such that the intersection of all its subgroups which are different from $\{e\}$, is a subgroup different from $\{e\}$. Prove that every element of  $G$  has finite order.  Assume that $a$ has infinite order in $G$. Then let $y\neq e$ belong to the intersection of all subgroups of $G$ different from $\{e\}$. Then $y=a^n$ and $y$ will also belong to subgroup generted by $a^2$ hence  $y=a^{2m}$ for some integers $m$. This contradicts that $a$ has infinte order.  Is this correct? If $(X_n)$ is i.i.d. and $ \frac1n\sum\limits_{k=1}^{n} {X_k}\to Y$ almost surely then $X_1$ is integrable (converse of SLLN) Let $(\Omega,\mathcal F,P)$ be a finite measure space.  Let $X_n:\Omega \rightarrow \mathbb R$ be a sequence of iid r.v's  I need to prove that if:  $ n^{-1}\sum _{k=1}^{n} {X_k} $ converges almost surely to $Y$ then all $X_k$ have expectation.  If I understand correctly then $X_k$ has expectations means $X_k$ is in $\mathcal L^1(\Omega)$.  And I know that on finite measure space Converging in expectations is converging in $\mathcal L^1(\Omega)$ and it's stronger than almost sure convergence.  And I know that from linearity of expectation even if one of the sequence is not in $\mathcal L^1(\Omega)$ then $Y$ is not in $\mathcal L^1(\Omega)$.  How do I continue? Can compact sets completey determine a topology? Suppose that $\tau_1$ and $\tau_2$ are two topologies on a set $X$ with the property that $K\subset X$ is compact with respect to $\tau_1$ if and only if $K$ is compact with respect to $\tau_2$. Then is this enough information to determine whether $\tau_1 = \tau_2$?  If not (which is suspect to be the case) is there a nice counterexample, and what is the minimum amount of extra information required for $\tau_1 = \tau_2$?  I feel like there would be an issue regarding 'points at infinity.' What's the starting wealth for higher levels? The PHB only gives starting wealth for Level 1 PCs. Based on my experience in other games, specifically Pathfinder, I would expect to get more at higher levels. Where can I find an appropriate table or calculation? Logic gate - What will be the second input of each gate? Full:    Cropped   :    In the second image (cropped) which is the same as the first (full) image... why the 1st Gate outputs "0"? How can I select part of a mesh and make it seperate? I want to make the teeth a separate child object from the mouth. I want to know the best way to do this.   I have tried going into edit mode with Tab and trying to select all the vertices but that doesn't move the teeth. Is there an easy way to select just that part and make it a separate child mesh to the rest of the mouth? How do I install the Nvidia drivers? I just ordered the Nvidia GTX card. I have a dilemma, though. Should I keep using the driver which is available in "additional drivers" in Ubuntu, or should I install the driver from the Nvidia site?  So which driver is the best for me? Matching Gmail filters on BCC mail How to randomly subset X% of selected points? What methods are available in ArcGIS 10.2 to randomly subset a selection of points.  For example, in the attached screenshot I am interested in keeping 20% of the selected points and deleting the rest. What could we call a person with deep knowledge in various fields? I've made a simple snowfall particle simulation (using gandalf3's solution: ). Is there a way to loop the animation, so the transition between last frame and first frame is not visible? Is there a setting to do it? What's the canonical way to check for type in Python? Building a graph from OSM? I spent days looking in all questions here and trying tutorials. I need to build a graph for a region (It will be my input in simulation) I downloaded Postgresql and Postgis and osm2pgsql. Now i can load .osm files into a database. I want to have a complete database with roads ids so i can generate a table of edges and nodes then build my graph  nodes = intersections and edges = roads for a city using python.  Please any detailed help with steps.I saw a lot of keywords (Postgresql/postgis, Networkx, QGIS ..) but i couldn't manage to assemble a good tutorial  I am a very beginner. Story where the protagonist is turned off from an automated system of professional attribution and instant learning Inheriting non-implicit constructors on Apex classes If I have an abstract parent class like this:  abstract class Vehicle {     public Vehicle(Person driver) {         //     } }   and then I create a child class like this:  public class MagicCarpet extends Vehicle {     //this won't compile }   I encounter the following Compile Error:     Error: Parent class has no 0-argument constructor for implicit construction at line ... column ...   Obviously I can explicitly re-declare a constructor on the child class toget it to compile:  public class MagicCarpet extends Vehicle {     public MagicCarpet(Person driver) {         super(driver);     } }   But I feel this isn't DRY. Not sure what's actually going on under the covers here.  How can I get a constructor (other than the implicit 0-argument one) to be inherited by a child class? Is it posible to change the locale of my device? A method for evaluating sums/discrete functions by assuming they can be made continuous and differentiable? Suppose I had a function that satisfied the property $f(x)=f(x-1)+g(x)$.  For any $x\in\mathbb N$, it is easy enough to see that this boils down to the statement  $$f(x)=f(0)+\sum_{k=1}^xg(k)$$  If we return to our functional equation and differentiate it $n$ times, we get  $$f^{(n)}(x)=f^{(n)}(x-1)+g^{(n)}(x)$$  Once again, for any $x\in\mathbb N$, we have  $$f^{(n)}(x)=f^{(n)}(0)+\sum_{k=1}^xg^{(n)}(k)$$  One could then integrate both sides.  For example, this asserts that  $$\sum_{k=1}^xg(k)=xf'(0)+\int_0^x\sum_{k=1}^tg'(k)dt$$  If the sum inside the intagral is generalized to any upper bound.  How would I justify this for discrete functions?    An example of this is letting $f_p(x)=\sum_{k=1}^xk^p$, as it seems to follow the above result.  We can see from the above that  $$f_p(x)=a_px+p\int_0^xf_{p-1}(t)dt$$  $$a_p=1-p\int_0^1f_{p-1}(t)dt$$  which appears to be a true recursive formula.    Under what conditions can I extend discrete functions $f(x)$ and $g(x)$ into continuous differentiable functions and apply this method? a better way to express "an idea/thought suddenly came to me" What are some grandiloquent, or simply better, ways of expressing "an idea/thought suddenly came to me", or "an idea/thought struck me", or "I was struck by an idea/thought"? No continuous function switches $\mathbb{Q}$ and the irrationals Is there a way to prove the following result using connectedness?  Result:  Let $J=\mathbb{R} \setminus \mathbb{Q}$ denote the set of irrational numbers. There is no continuous map $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(\mathbb{Q}) \subseteq J$ and $f(J) \subseteq \mathbb{Q}$. Question: If $c\neq 1$ is an $n^{th}$ root of unity then, $1+c+...+c^{n-1} = 0$  Attempt: So I have established that I need to show that $$\sum^{n-1}_{k=0} e^{\frac{i2k\pi}{n}}=\frac{1-e^{\frac{ik2\pi}{n}}}{1-e^{\frac{i2\pi}{n}}} =0$$ by use of the sum of geometric series'. My issue is proceeding further to show that this is indeed true.