Photoshop CS6 - Is there anyway to apply gradient overlay on multiple layers at once?
How to apply layer style to one object and apply it to multiple layers
Uniform convergence of $f_n(z)=nz^n$ in the set $|z|<\frac{1}{2}$ How to set up USB for Virtualbox? I read a story once about a man who escapes from his pursuers by doing an uncontrolled jump into hyperspace. If I'm not mixing my stories up he was blind but could see through the eyes of other sighted people/animals nearby. He was able to see through his pet but it dies and he thinks he's finished - he's blind and lost in hyperspace but there's a rat on board which he eventually catches by turning off gravity and then he can see through the rat's eyes. He works out how hyperspace operates and can hop back to where he came from.   Can anyone remember the name of the story and the author? I enjoyed it when I was a kid and would like to read it again. Why are integer literals with leading zeroes interpreted strangely? This prints 83  System.out.println(0123)   However this prints 123  System.out.println(123)   Why does it work that way? Is it possible to prove a null hypothesis? How do I create a permanent Bash alias? The title says it all.  If I was on a bus at 60 km/h, and I started walking on the bus at a steady pace of 5 km/h, then I'd technically be moving at 65 km/h, right?  So my son posed me an interesting question today: since light travels as fast as anything can go, what if I shined light when moving in a car?  How should I answer his question? How do the PHP equality (== double equals) and identity (=== triple equals) comparison operators differ? Is abstract algebra (mostly?) restricted to $2$-ary operators? Proving $\, a^b = (a\bmod n)^b\, \pmod{\!n}\ $ [Congruence Power Rule] I am working on a problem I am pretty close to solving but I can't figure out the last part. I used some algebraic manipluation to break the problem down. The problem is:     Show that the following congruence is true      a^b = ((a mod n)^b) (mod n)      for any positive integers a, b, and n.      Hint: Number a can be written as a = q*n + r, where q = floor brackets a/n, and r = a mod n.   My attempt it:     (q*n +r)^b = ((a mod n)^b) * (mod n)      (q*n)^b + (a mod n)^b = ((a mod n) ^b) * (mod n)      (a)^b -(r)^b = ((a mod n) ^b) * (mod n)      (a)^b = modn  ----> divided by ((a mod n)^b)   Am I doing this correctly and if so how can I prove this is true? Is there a trick I am missing? I think that by simplifying it further I would just keep going in a loop.  Thanks! Images instead of radio buttons or dropdown list? I have a hard time formulating proofs.  For this problem, I  can see that if $n$ is equal to $8,$ this statement is true.  $(\mathbb{Z}/8\mathbb{Z})^{\times}$ includes elements:  $1,3,5,7$, and all of these are roots of $1-x^2 \pmod 8.$  And obviously $8$ divides $24.$  But how do I prove this without depending on number calculations and only using theorems?  Help Please?  I need a step by step walk through of how to do this proof and what theorems would be appropriate to use. I don't have complex analysis at my beck and call, and I only have a low level of knowledge in topology, but I need to prove that this metric space (for any real $r$ and $R$ with $r &lt; R$)$$ X = \{ (x, y) \in \mathbb{R}^2 \ | \ r \leq x^2 + y^2 \leq R \}$$  with the Manhattan metric $d((x_1, y_1), (x_2, y_2)) = |x_1-x_2| + |y_1-y_2|$ is not simply connected.  I've already prooven that it's path connected, and now I need to show there are some points $P$ and $Q$ with two paths between them such that one cannot be continuously 'morphed' into the other.  $ \ $  What I have so far is as follows:  I take $P = (0, r)$ and $Q = (0, -r)$, with $f_0$ being a path from $P$ to $Q$ going clockwise around the circle radius $r$ and $f_1$ being much the same but going counterclockwise.  Now I assume there is a function $g : [0, 1]^2 \to X$ such that:   $g(s, 0) = f_0 (s)$ $g(s, 1) = f_1 (s)$ $g(0, t) = P$ $g(1, t) = Q$   To get the final result, I need to show that this function cannot be continuous, but for the life of me I cannot.  For some context, these are the topics which have been visited during the course, roughly in order of recentness.   Multiple connectedness Simple connectedness Pathwise connectedness Interior points Boundary points Open sets Compactness Complete metric spaces Bounded metric spaces Totally bounded metric spaces Closed sets Closure of a metric space Limit points Cauchy sequences Convergence Continuity Metric space quivalence Metric equivalence   Edit: I might have an argument that works, though it's far from rigourous. We can shrink $R$ to be as close to $r$ as we want, so we can essentially constrain the annulus down to a circle and thus force any path from the left side of the circle to the right side to go through $P$ or $Q$.  So holding $s \in (0, 1)$ constant and varying $t$ must produce a path through $P$ or $Q$ for any $s$. If for some $s$ it passes through $P$ and for some other $s$ it passes through $Q$, then there must be $s_0$ such that $\forall \epsilon &gt;0  \ \exists \delta \leq \epsilon$ st. $s_0$ produces a path through $P$ and $s_0 + \delta$ produces a path through $Q$.  Now we can consider the path $g(s, \frac{1}{2})$, and note that it must have a discontinuity at $s_0$.  Now consider the case where all $s$ produce paths through only one of $P$ or $Q$. WOLOG: $P$. Now, at $t = \frac{1}{2}$, $s$ arbitrarily close to $1$ are mapped away from $Q$, but $1$ is always mapped to $Q$ by definition, so $g(s, \frac{1}{2})$ has a discontinuity at $s=1$. Therefore $g(s, t)$ is not continuous.  This argument is definitely iffy to me, if no one has their own argument (using sufficiently low level concepts), then criticism on the above would be appreciated. Do parts of a hash carry the properties of the entire hash? When I need to generate unique id's based on some information hashing is typical choice. However, sometimes that id needs to be of a particular size.  I've seen a lot of schemes (HMAC-MD5-96 in SSH, CGA in SeND for IPv6) that use a portion of a hash, so I'm thinking it might be alright to use it that way.    Which properties of a hash are preserved and which do not apply anymore?  Obviously, with less bits, the chance of collision goes up, but can I still rely on the partial hash for uniform character distribution?  What about the ?  I'm guessing that if a hash modifies the entire hash upon the smallest change to the input, that would imply that a portion of that hash would be equally well changed.  Am I thinking about this correctly?  Also, would these behaviors be different for different hashing algorithms? How to tell if a certain item is in a player inventory? I am trying to create a challenge world where a certain item (e.g. a Netherite Sword) must be collected. How can I check automatically if a player has it (using commands), and then congratulate the winner? This question is specific to Bedrock Edition 1.16. I have tried other solutions so many times and they don't seem to work. See also: jQuery - regexp selecting and removeClass()? When looking for the path to an executable or checking what would happen if you enter a command name in a Unix shell, there's a plethora of different utilities (which, type, command, whence, where, whereis, whatis, hash, etc).  We often hear that which should be avoided. Why? What should we use instead? Interesting tab on StackOverflow One day I directed to SO and was met with the awesome Interesting page, which I really like. But when I travel away from it, I have to re-enter the query string to get it back. Is there a plan to make this tab visible so I can click to it anytime? What do all those cryptic number and letter codes in a lens name mean? This might be a stupid question, but nonetheless, it has been bothering me.  If you take a photon, make it go through some atoms in a solid, liquid or whatever, then you have the chance of this photon being absorbed by an electron, and thereby exciting the electron. This requires the photon to have enough energy to actually excite the electron to another energy level.  My question is then: How does the photon know if it has enough energy or not? Do they interact very quickly to determine if it's okay or not, or is it just something it "knows?"