Hot network questions causes inconsistent voting
Prevent questions on Hot List from being upvoted by casual visitors (only rep is from association bonus)
I know you can create a rounded-corner rectangle; but, how do you create a triangle with rounded corners in Photoshop?  I am actually interested in making it from scratch, not basing it on a custom shape that is available in Photoshop. Thanks. Stack Overflow in ES, PT, RU, JP have mixed-language descriptions When you pass a collection like list, array to another function in python, does it make a copy of it, or is it just a pointer? Value of Vandermonde type determinant Let $x_1,...,x_n $ are distinct real numbers.  Is it a formula for the Vandermonde type determinant $V(x_1, \cdots,x_n)$  whose last column is $x_1^k,\ \cdots,\ x_n^k$, where $k \geq n$, instead of $x_1^{n-1},\ \cdots,\ x_n^{n-1}$?  Thanks Lately I've been seeing this cookie popup that blocks a lot of the screen.  When I try to do the &quot;manage cookies&quot; thing, all it shows me are several categories, with a green oval containing a black circle to the right of each.  Clicking on that oval makes it disappear.  Clicking on the same spot again makes it reappear.  But I see no indication as to which state is off or on. So how can I make this popup go away, never to bother me again?  Or failing that, could you at least provide some indication as to what those buttons do?  Like maybe simple text saying &quot;Off&quot; or &quot;On&quot;? What is the use of the yield keyword in Python? What does it do? For example, I'm trying to understand this code1: def _get_child_candidates(self, distance, min_dist, max_dist):     if self._leftchild and distance - max_dist &lt; self._median:         yield self._leftchild     if self._rightchild and distance + max_dist &gt;= self._median:         yield self._rightchild    And this is the caller: result, candidates = [], [self] while candidates:     node = candidates.pop()     distance = node._get_dist(obj)     if distance &lt;= max_dist and distance &gt;= min_dist:         result.extend(node._values)     candidates.extend(node._get_child_candidates(distance, min_dist, max_dist)) return result  What happens when the method _get_child_candidates is called? Is a list returned? A single element? Is it called again? When will subsequent calls stop?   1. This piece of code was written by Jochen Schulz (jrschulz), who made a great Python library for metric spaces. This is the link to the complete source: [Module mspace][1]. Do the predictions of a Random Forest model have a prediction interval? Auto reply to text and/or iMessage? Is it possible to set up an auto-reply to an incoming text or iMessage, either on my iPhone (or the connected Message app on my Mac)?  Ideally I'd like to customize this depending upon the sender. $a$ and $b$ are natural numbers and $p$ is a prime number. Prove that if $a^{p}-b^{p}$ is divisible by $p$, then it is also divisible by $p^{2}$.  My attempt: Based on Fermat's theorem $(a^{p}-a)$ and $(b^{p}-b)$ are divisible by p, therefore their difference is divisible by $p$. I.e. $(a^{p}-a)-(b^{p}-b)=(a^{p}-b^{p})-(a-b)$ is divisible by $p$. Since the left hand side of this equation is divisible by $p$, the right hand side also should be divisible by $p$. Based on the problem's assumption $(a^{p}-b^{p})$ is divisible by $p$ therefore we conclude $(a-b)$ must be divisible by $p$. Now We can factorize $(a^{p}-b^{p})$ $$(a^{p}-b^{p})=(a-b)(a^{p-1}+a^{p-2}b+....+b^{p-1})$$ we have to prove $(a^{p}-b^{p})$ is multiple of $p^2$ which means we have to show the right hand side should be multiple of $p^{2}$. But $(a-b)$ is multiple of p therefore we have to show  $(a^{p-1}+a^{p-2}b+\cdots+b^{p-1})$ is multiple of $p$ and I am stuck here. Any help would be appreciated. Area of intersection between two circles Suppose you have 2 circles that intersect each other in such a way that each circle passes through the other's center. What is the area between the circle(or common area) i.e. area between the centres of the circles? Windows 7 File Explorer search not working How do I prove this function is bijective? $$ v(s,p)=2^{p-1}(2s-1). $$ The domain is natural numbers and the codomain is also the natural numbers.  And this one: $$ f(s)=2s-1. $$ The domain is the natural numbers, and the codomain is the odd numbers in the natural numbers.  With this one I would do this to show it's injective: $$ \begin{align} v(s)&amp;=v(s_1)\\ \implies 2s-1&amp;=2s_1-1\\ \implies (2s_1)/2&amp;=(2s_2)/2\\ \implies s=s_1 \end{align} $$ So it's injective since if $v(s)=v(s_1)$ then $s=s_1$.  And to show it's surjective $f(s)=y$: $$ \begin{align} y&amp;=2s-1\\ \implies s&amp;=(y+1)/2 \end{align} $$ Then the function must be surjective since every $y$ is the same as the codomain for $f$.  Am I correct? Run a web server from any directory In my program I have one array with 25 double values 0.04 When I try to sum these values in a loop I get following results:  0.0 + 0.04 = 0.04 0.04 + 0.04 = 0.08 0.08 + 0.04 = 0.12 0.12 + 0.04 = 0.16 0.16 + 0.04 = 0.2 0.2 + 0.04 = 0.24000000000000002 0.24000000000000002 + 0.04 = 0.28 0.28 + 0.04 = 0.32 0.32 + 0.04 = 0.36 0.36 + 0.04 = 0.39999999999999997 0.39999999999999997 + 0.04 = 0.43999999999999995 0.43999999999999995 + 0.04 = 0.4799999999999999 0.4799999999999999 + 0.04 = 0.5199999999999999 0.5199999999999999 + 0.04 = 0.5599999999999999 0.5599999999999999 + 0.04 = 0.6 0.6 + 0.04 = 0.64 0.64 + 0.04 = 0.68 0.68 + 0.04 = 0.7200000000000001 0.7200000000000001 + 0.04 = 0.7600000000000001 0.7600000000000001 + 0.04 = 0.8000000000000002 0.8000000000000002 + 0.04 = 0.8400000000000002 0.8400000000000002 + 0.04 = 0.8800000000000002 0.8800000000000002 + 0.04 = 0.9200000000000003 0.9200000000000003 + 0.04 = 0.9600000000000003   Why on earth could that happen?! DEFINE vs Variable in PHP Why do we even need the "delete[]" operator? This is a question that's been nagging me for some time. I always thought that C++ should have been designed so that the delete operator (without brackets) works even with the new[] operator.  In my opinion, writing this:  int* p = new int;   should be equivalent to allocating an array of 1 element:  int* p = new int[1];   If this was true, the delete operator could always be deleting arrays, and we wouldn't need the delete[] operator.  Is there any reason why the delete[] operator was introduced in C++?  The only reason I can think of is that allocating arrays has a small memory footprint (you have to store the array size somewhere), so that distinguishing delete vs delete[] was a small memory optimization. Moment of inertia: why $\mathrm{dI}=r^2\mathrm{dm}$ instead of $\mathrm{dI}=m\mathrm{dr^2}$? I accidentally removed my /etc/apt/sources.list file. Is it hosted by Canonical somewhere so I can re-add it to the system? It's a bit of an emergency, so I hope someone can provide a quick answer. "There are no comments" vs. "There is no comment" Why can't a normal user `chown` a file?