I switched Alpha to transparent in Shading menu, but renderred images still have grey background. How can i get the transparent background?
I would like to render an animation as a series of .png images with transparent backgrounds for use in a video. Is this possible?
Proof of an elementary property of Projection Operators I'm asked to show the following:  Let $X$ be a linear space, and let $P : X \rightarrow X$ be a projection operator. Restricted to the linear space $range(P)$, the projection $P$ is the identity operator, that is, $Px = x$ for all $x \in range(P)$.  If anyone could offer a hint for how to show this. I'm rusty with linear algebra so don't really know what I'm supposed to bring in outside of what's specified in the lemma/definition of projection. What is so special about the range of P that would make this so? Set of left cosets is a group Let $N$ be a normal subgroup of $G$. Let $G/N = \{gN : g \in G \}$. Show that the $(G/N, \circ, 1_{G/N})$ is a group, where:  $\circ : G/N \times G/N \rightarrow G/N$ is defined by $(gN \circ hN) = ghN$ and $1_{G/N} = 1*N$.  Thanks for your help. Prove that $1^2+2^2+\cdots+n^2=\frac{n(n+1)(2n+1)}{6}$ for $n \in \mathbb{N}$. Problem: Prove that $1^2+2^2+\cdots+n^2=\frac{n(n+1)(2n+1)}{6}$ for $n \in \mathbb{N}$.  My work: So I think I have to do a proof by induction and I just wanted some help editing my proof.  My attempt:  Let $P(n)=1^2+2^2+\cdots+n^2=\frac{n(n+1)(2n+1)}{6}$ for $n \in \mathbb{N}$.  Then $$P(1)=1^2=\frac{1(1+1)(2+1)}{6}$$ $$1=\frac{6}{6}.$$ So $P(1)$ is true.  Next suppose that $P(k)=1^2+2^2+\cdots+k^2=\frac{k(k+1)(2k+1)}{6}$ for $k \in \mathbb{N}$. Then adding $(k+1)^2$ to both sides of $P(k)$ we obtain the following: $$1^2+2^2+\cdots+k^2+(k+1)^2=\frac{k(k+1)(2k+1)}{6}+(k+1)^2$$ $$=\frac{2k^3+3k^2+k+6(k^2+2k+1)}{6}$$ $$=\frac{2k^3+9k^2+13k+6}{6}$$ $$=\frac{(k^2+3k+2)(2k+3)}{6}$$ $$=\frac{(k+1)(k+2)(2k+3)}{6}$$ $$=\frac{(k+1)((k+1)+1)(2(k+1)+1)}{6}$$ $$=P(k+1).$$ Thus $P(k)$ is true for $k \in \mathbb{N}$. Hence by mathematical induction, $1^2+2^2+\cdots+n^2=\frac{n(n+1)(2n+1)}{6}$ is true for $n \in \mathbb{N}$. Can I visit the UK as a tourist before my Student Visa starts? How to use SSH to run a local shell script on a remote machine? Is there a way to force a line break inside a math mode text?  My example:  \[   \underbrace{....}_\text{Some long text that should be multiline} \]   Trying  \text{Some long text that\\ should be multiline}   Didn't do the trick. Differences between Verb + to be + adjectives and Verb + adjective I'm trying to install pandas. When I do, it's automatically installing to the python installation for v 2.7.   How do I force pandas to install to the python 3.5 installation? Why is it possible to get significant F statistic (p<.001) but non-significant regressor t-tests? In a multiple linear regression, why is it possible to have a highly significant F statistic (p&lt;.001) but have very high p-values on all the regressor's t tests?  In my model, there are 10 regressors. One has a p-value of 0.1 and the rest are above 0.9    For dealing with this problem see the . Why is Modus Ponens valid? I am having trouble understanding what defines Entailment operator. On Mathoverflow I posted this question on what I perceive to be .  Consider: :     P therefore Q  P            Therefore, Q   My question is could we have arbitrarily defined it such as:     P therefore Q  P            Therefore, P   However, if an advanced civilization receives information in the form of following nested structures/containers or packets, how will they interpret Modus Ponens if in an alien land Modus Ponens is not defined?    Therefore, it raises the validity of MP. How do we define the implication or entailment operator? Because if we use an argument that relies on implication or entailment operator ipso facto, then it is trivial that logic is circular.  Is there a flaw in my rationale? Radius of convergence of a sum of power series I have  two series  $\displaystyle\sum_{n=1}^{\infty} a_n x^{n}$   $\displaystyle\sum_{n=1}^{\infty} b_n x^{n}$  with radius of convergence $2$ and $3$ respectively.  How can I find the radius of convergence for the following?     $\displaystyle\sum_{n=1}^{\infty} (a_n +b_n)x^{n}$   Can anyone help me? Recommended way to initialize srand? I need a 'good' way to initialize the pseudo-random number generator in C++. I've found  that states:     In order to generate random-like   numbers, srand is usually initialized   to some distinctive value, like those   related with the execution time. For   example, the value returned by the   function time (declared in header   ctime) is different each second, which   is distinctive enough for most   randoming needs.   Unixtime isn't distinctive enough for my application. What's a better way to initialize this? Bonus points if it's portable, but the code will primarily be running on Linux hosts.  I was thinking of doing some pid/unixtime math to get an int, or possibly reading data from /dev/urandom.  Thanks!  EDIT  Yes, I am actually starting my application multiple times a second and I've run into collisions. Initializing a member array in constructor initializer I would like to get a USB token to secure my keys. My use case is protection of 3 GnuPG keys that I will be using 10 times per day at least. I plan to create a new key ring from scratch. Because ECC seems more future-oriented than RSA, this is what I chose to use. I'm wondering which USB token to choose as well as which curve.  On  it is said that many people think curves recommended by the NIST or defined by Brainpool have a doubtful origin; therefore, they recommend the non-standardized Bernstein’s Curve 25519. On  one poster says that    He is not aware of any profound criticism of Brainpool curves, and Bernstein’s Curve 25519 is hard to protect against side-channel attacks when implemented in embedded devices.   As a result, I'm a bit lost as to which key/curve to choose. "I think him to be about 50" or "I think he is about 50"? I have two options. Which one is correct?      a) I think him to be about 50.   b) I think he is about 50.   If both are correct, should I avoid one or the other? How to show the parent and child taxonomy term? Finding an item in a List using C# SQL comma-separated row with Group By clause When can I make opportunity attacks? What provokes an opportunity attack?  In 3.X moving out of a threatened square, standing up from prone, casting a spell (unless cast defensively), or making a ranged attack provoked, while in 4e moving out of a threatened square or making a ranged/area attack provoked. Possible Duplicate:          The  describes the expansion of the $n$th power of the sum $(a+b)$:  $$(a+b)^n = \sum_{k = 0}^n {n\choose k}a^kb^{n-k}$$  In calculus, there is a generalization of the product rule called , which describes the expansion of the $n$th derivative of the product of two functions $f$ and $g$:  $$(fg)^{(n)} = \sum_{k = 0}^n {n\choose k}f^{(k)}g^{(n-k)}$$  It's not difficult to prove using the product rule and induction, what I'm really trying understand here is why the formula is true. Is there a way to prove it using the binomial formula? How are these two formulas related? Is there a combinatorial proof for Leibniz's rule like there is for the ?   I understand this question is a bit vague, but I hope you'll agree that these two formulas look so similar it just feels like there should be some relation between the two. Of course this is not necessarily true, but I'm hoping it's not just a crazy coincidence.