Monotone/ desaturated reflection material in Blender/ Cycles
How to change the shadow color in Blender Cycles?
Placement of the asterisk in pointer declarations I've recently decided that I just have to finally learn C/C++, and there is one thing I do not really understand about pointers or more precisely, their definition.  How about these examples:   int* test; int *test; int * test; int* test,test2; int *test,test2; int * test,test2;   Now, to my understanding, the first three cases are all doing the same: Test is not an int, but a pointer to one.  The second set of examples is a bit more tricky. In case 4, both test and test2 will be pointers to an int, whereas in case 5, only test is a pointer, whereas test2 is a "real" int. What about case 6? Same as case 5? Let $F$ be a field and $f: \mathbb{Z} \to F$ be a ring epimorphism. Is it true that $||a|^p - |b|^p| \le C_p|a - b|^p$ for $1 < p < \infty$? If $a, b \in \mathbb{C}$, then we have the standard triangle inequality for the difference:  $$||a| - |b|| \le |a - b|.$$  I am wondering if this inequality generalizes to exponents greater that one.     My question is, for $1 &lt; p &lt; \infty$, does there exists a constant $C_p$ such that $||a|^p - |b|^p| \le C_p|a - b|^p$ for all $a, b \in \mathbb{C}$?   I am aware of the "standard" triangle inequality for $p &gt; 1$:  $$|a +b|^p \le 2^{p}(|a|^p + |b|^p),$$  and that $2^p$ may not be sharpest constant possible. If I try to use this estimate to prove, say, that $|a|^p - |b|^p \le C_p |a - b|^p$, I get stuck with an extra term that I'm not sure what to do with.  $$|a|^p - |b|^p \le 2^p|a -b|^p + (2^p -1)|b|^p.$$  A resolution on this matter is greatly appreciated. listing files with pattern with starting and ending Why are the lower 3 bits of curve25519/ed25519 secret keys cleared during creation? I am currently experimenting with ed25519 and I noticed that on secret key creation, bit 254 is always set and the lower 3 bits are always cleared. I found that bit 254 is always set to protect against timing attacks in this question:   But why are the lower 3 bits cleared. Obviously it has to do with the formula in the curve25519 paper:  The set of secret keys is defined to be $\{\underline{n} : n \in 2^{254} + 8\{0, 1, 2, 3,\ldots, 2^{251}-1\}\}$  It's because of the 8 in there, but why is that 8 there? I suspect it has something to do with theorem 2.1 in the curve25519 paper, but I am not sure, because I do not understand fully what is being proven there.   I am experimenting with ed25519 primitives in some cryptographic routines which need me to add scalars to the secret key (add secret keys). Even if I add two well formed ed25519 secret keys, the result will not always have bit 254 set and the lower 3 bits cleared. Is this a security problem? I understand the risk for bit 254 but not the lower 3. Multivariable Delta Epsilon Proof $\lim_{(x,y)\to(0,0)}\frac{x^3y^2}{x^4+y^4}$ --- looking for a hint It should be trivial, and it might even be in the help, but I can't figure out how to navigate it. How do I indent multiple lines quickly in vi? Show a connected metric space (X,d) is $\epsilon$-chainable for $\epsilon &gt;0$       $\epsilon$-chainable Definition      (X,d) is $\epsilon$-chainable if given any two points $a,b \in X$, $\exists$ a finite set $\{ x_0,x_1,...,x_n\}$ of points in X with $x_0 = a$, $x_n=b$ and $d(x_{n-1},x_n)&lt;\epsilon$, $\forall$ n      Clopen Definition      A set is clopen $iff$ its boundary is empty      Connected Metric Definition      Let $(X,d)$ be a metric space. It is connected $iff$ it has no proper subsets which are clopen      The following are equivalent:         $X$ is connected   The only subsets of $X$ that are clopen are $\emptyset$ and $X$   $\nexists$ non-empty, disjoint, open sets $A$ and $B$ such that $X=A\bigcup B$   $\nexists$ non-empty, disjoint, closed sets $A$ and $B$ such that $X=A\bigcup B$         Theorem      Let $(X,d)$ be a metric space, and let $S$ be any subset of $X$. Then $S$ is closed $iff$ $S^c$ is open.     So how would someone show this exactly?  Let the set $A$ be the set of all elements in $(X,d)$ that can be reached from $a\in X$ in a finite number of steps with length less than $\epsilon$.  Does this mean that there should be no isolated points? (an isolated point would be at distance infinity from any other point, or distance zero from itself, since $\epsilon &gt;0$ we don't want this?)  Knowing that $X$ is connected $\implies$the only subsets of X that are clopen are $\emptyset$ and $X$  Also, by construction of A;   A is the set of all $\epsilon$-chains between any element and $a$  And, so $A^c = \emptyset$ if $A$ was $\epsilon$-chainable (because A has to have a path from all elements to a, for this to be true, the complement wouldn't have anything in it)  Leaving only $A$ as the remaining clopen set  Does this make any sense? Or should an alternative be used, and how to formalize it.  Thanks. Redefining \listoffigures and \listoftables as tables I don't want to award a bounty if I feel that the user hasn't answered the question in the right fashion. How do I prevent it? When is "Y" a vowel? In school we are taught the vowels: A, E, I, O, U, and sometimes Y.    got me thinking about when the letter Y is considered to be a vowel.  I understand (perhaps incorrectly) that in words like bicycle and why it is a vowel. What about the word voyeur (as mentioned in the XKCD alt-text)?   If I've got this backwards, and Y is almost always a vowel, how can I tell when it is a consonant? Thinking back, I don't think my education ever covered the difference between them, we just memorized which letters were which. What is Hawking radiation and how does it cause a black hole to evaporate? My understanding is that  isn't really radiated from a black hole, but rather occurs when a particle anti-particle pair spontaneously pop into existence, and before they can annihilate each other, the antiparticle gets sucked into the black hole while the particle escapes. In this way it appears that matter has escaped the black hole because it has lost some mass and that amount of mass is now zipping away from it.  Is this correct? If so, wouldn't it be equally likely that the particle be trapped in the black hole and the antiparticle go zipping away, appearing as if the black hole is spontaneously growing and emitting antimatter?  How is it that this process can become unbalanced and cause a black hole to eventually emerge from its event horizon and evaporate into cosmic soup over eons? How can I stream live video on YouTube? Nowadays, I see a lot of users live streaming on YouTube and wanted to try it for myself. However, when I go to my channel I don't see an option for live streaming.  I tried researching how to do this on YouTube and Google, but without luck.  So I was wondering, how can I live stream on YouTube?  I don't have any pro account or any of that, but I've watched livestreams from users who I don't think have pro accounts either.  So livestreaming is open for everyone, right? Debugging errors of SAGA interpolation algorithms in QGIS Processing? I encounter recurrent problems with the geoalgorithms that perform interpolations. No matter what technique I use I end with the following errors. As stated in the OGR tab QGIS 2.0 is unable to open a file in C drive. I have very little IT background so the message error is meaningless.   Is there anybody able to decrypt the message and solve the problem?      here this is the algorithm i used Starting with the episode "Crossroads Part II" the      final five Cylons begin to hear Bob Dylan's "All Along the Watchtower" in their heads.   Have the creators/writers ever stated why they picked that song in particular and what it might mean to the story? Start a longtable in Latex at top of next page I want to use the longtable environment for a table. However, I do not know how to place it at the top of the next page, as I can do with the table environment. Do you know how to do it? Calculate the display width of a string in C#? A Java version of this question was just answered, and, well, I don't know how to do this in .net.   So how do you calculate the display width of a string in C# / .net? An element of a group has the same order as its inverse If $a$ is a group element, prove that $a$ and $a^{-1}$ have the same order.   I tried doing this by contradiction.    Assume $|a|\neq|a^{-1}|$  Let $a^n=e$ for some $n\in \mathbb{Z}$ and $(a^{-1})^m=e$ for some $m\in \mathbb{Z}$, and we can assume that $m &lt; n$.  Then $e= e*e = (a^n)((a^{-1})^m) = a^{n-m}$. However, $a^{n-m}=e$ implies that $n$ is not the order of $a$, which is a contradiction and $n=m$.  But I realized this doesn't satisfy the condition if $a$ has infinite order. How do I prove that piece? What is with words that have forms that end both in -zation and -sation, such as localization and localisation?  Many spell checkers recommend -zation. I just manually summoned the Eye of Cthulhu, going into battle with copper armour, tungsten broadsword, gold bow, jester arrows and plenty of lesser healing potions. I came rather close to death but I managed to stay alive. However, the Eye took off when I had his health down to ~1700. I'm assuming this means you only have a few minutes to finish it off after a certain point. Is there any equipment I'm missing to help kill the Eye faster and to help my survivability? If it's relevant, my current life is 120.