I was trying to install all python packages using sudo apt install python3*, but it gave me this error: newtron@newtron:~$ sudo apt install python3* Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package python3*
When I run this command :  apt install libkf5*   I get the following error :  Unable to locate package libkf5*    I'm sure that the packages whose names start with libkf5 exist (tab-completion says so) . So the problem is not about the absence of those packages.(Note the asterisk at the end of that error message , the wildcard's not working at all) I use apt v.1.9. Thanks in advance.
How to optimize images to improve pagespeeds / webpage loading times? This is almost a StackOverflow question, however it's completely related to Photoshop and other tools. With every Pagespeed test I do for all my website I get the comment "Optimize images by lossless compressing image X" which often increases my page rank a lot.  I already save EVERY image with 'save for web' with Photoshop, but I was wondering how I could "Optimize images by compressing lossless" even more. As far as I know I'm already doing everything I can.   How can I optimise images to improve my webpage loading speeds? Algebraic extension of perfect field in which every polynomial has a root is algebraically closed Let $F$ be a perfect field, i.e. every irreducible polynomial over $F$ has distinct roots in the algebraic closure of $F$. Suppose that $K$ is an algebraic extension of $F$ with the property that every non-constant $p(X) \in F[X]$ has a root in $K$.   I want to show that $K$ is algebraically closed, i.e. that $K = \overline{F}$, the algebraic closure of $F$.  If $K$ were a normal extension of $F$, this would follow immediately: Let $\alpha \in \overline{F}$ and $m(X)\in F[X]$ its minimal polynomial. By our assumption, $m(X)$ has at least one zero in $K$. Since $K$ is a normal extension of $F$, it thus contains all other roots of $m(X)$ including $\alpha$.  I don't have an idea as to how to show that $K$ is a normal extension. CString to char* We are using the CString class throughout most of our code. However sometimes we need to convert to a char *. at the moment we have been doing this using variable.GetBuffer(0) and this seems to work ( this mainly happens when passing the Csting into a function where the function requires a char *). The function accepts this and we keep going.  However we have lately become worried about how this works, and whether there is a better way to do it.  The way i understand it to work is it passes a char pointer into the function that points at the first character in the CString and all works well.  I Guess we are just worried about memory leaks or any unforseen circumstances where this might not be a good idea. After the therapy, eight children (43%) became able to crawl/move on their back.   Or should I use "on their backs"?   Singular because each child only has one back, or plural because we're dealing with eight backs? Understanding quantum entanglement.. help me validate this analogy! I'm struggling to understand the concept of quantum entanglement. I've distilled my understanding into an analogy, and I need your help to validate it. Here it is:  Let's say I receive two envelopes. Both envelopes have this written on them:     Hello! Open this letter...   If the paper inside is red, then other envelope has blue paper.   If the paper inside is blue, then other envelope has red paper.   So, if I open one letter, and the paper inside is red, then I know the other letter contains the blue paper.  Is this equivalent to quantum entanglement? The fact that I will know the color of the other paper when I open (i.e. observe) one envelope?  In theory, if one of the letters "appeared" in a different galaxy, I would still know the color of the paper inside that letter, just by opening my letter, instantly, correct?  Before I open the letter, is the paper inside each envelope in superposition (??), i.e. 50/50, red or blue?  In this analogy, I am assuming that what's written on the letters is true. Is this a correct assumption in quantum physics? I think so yes?  In real quantum physics, would I be able to change the color of one paper, so that I change the color of the other one? No right? Inequality involving the integral of vector valued function Suppose $f :[a,b]\to \mathbb{R}^n$ is given by $f(t)=\langle f_1(t), \ldots, f_n(t)\rangle$, where each of the $n$ component functions is integrable over $[a,b]$. I think the following inequality   $$\left|\int _a^b f(t) \, dt\right|\leq\int_a^b\left|f(t)\right| \, dt$$  still hold but I don't know how to prove it. Any idea?  Thanks I would like to remove selected commit log entries from a linear commit tree, so that the entries do not show in the commit log.  My commit tree looks something like:  R--A--B--C--D--E--HEAD   I would like to remove the B and C entries so that they do not show in the commit log, but changes from A to D should be preserved. Maybe by introducing a single commit, so that B and C become BC and the tree looks like.  R--A--BC--D--E--HEAD   Or, ideally, after A comes D directly. D' representing changes from A to B, B to C and C to D.  R--A--D'--E--HEAD   Is this possible? if yes, how?  This is a fairly new project so has no branches as of now, hence no merges as well. Is there any way to attract or repel neutrons? I know that neutrons are neutral and have no charge, but is there any other way to interact with them? iOS: Your passcode is required to enable Touch ID Use chown to set the ownership of all a folder's subfolders and files? How can I use the chown command to change the ownership of all a folder's subfolders and files? Smooth option sometimes produces incorrect arrow tips in PGFplots It seems that the smooth option applied to lines sometimes effects the arrow tips and produces incorrect results.  No problem with vertical lines, but any other seems to have a problem. Is this a known bug, or is there a reason why the smooth should not be applied to straight lines?  Updated: to show problem does NOT occur with TikZ, and problem also occurs with curves if smooth option is applied.  \documentclass{article} \usepackage{pgfplots} \begin{document}  \tikzstyle{MyStyle}      =[-&gt;, black, ultra thick,       ] \tikzstyle{MyStyleSmooth}=[-&gt;, black, ultra thick, smooth]  \begin{tikzpicture} \begin{axis}     % 'smooth' option seems to have no effect on lines '1' and '2'     \addplot [MyStyle      , green ] coordinates{(0,0) (0,1)} node [above] {1};     \addplot [MyStyleSmooth, blue  ] coordinates{(1,0) (1,1)} node [below] {2};     %     % But, can't seem to have the 'smooth' on lines, '4', '5' and '6'     \addplot [MyStyle      , orange] coordinates{(2,0)   (3,0)   } node [right] {3};     \addplot [MyStyleSmooth, red   ] coordinates{(4,0)   (2,0.5) } node [below] {4};     \addplot [MyStyleSmooth, red   ] coordinates{(2,1)   (3,1)   } node [left ] {5};     \addplot [MyStyleSmooth, red   ] coordinates{(3,0.8) (2,0.8) } node [right] {6};      % Similar problem with curves: "non-smooth" is ok, "smooth" is not     \addplot[MyStyle,       mark=none, domain=0:1,samples=50, blue] (x,x*x+1);     \addplot[MyStyleSmooth, mark=none, domain=0:1,samples=50, red ] (x,x*x+2);  \end{axis} \end{tikzpicture}  \begin{tikzpicture} % These are all fine     \draw [MyStyle      , green ] (0,0)   -- (0,1)    node [above] {1};     \draw [MyStyleSmooth, blue  ] (1,0)   -- (1,1)    node [above] {2};     %     \draw [MyStyle      , orange] (2,0)   -- (3,0)    node [right] {3};     \draw [MyStyleSmooth, red   ] (4,0)   -- (2,0.5)  node [below] {4};     \draw [MyStyleSmooth, red   ] (2,1)   -- (3,1)    node [right] {5};     \draw [MyStyleSmooth, red   ] (3,0.8) -- (2,0.8)  node [left ] {6}; \end{tikzpicture} \end{document} I am trying to prove this binomial identity $\sum_{r=0}^n {r {n \choose r}} = n2^{n-1}$ but am not able to think something except induction,which is of-course not necessary (I think) here, so I am inquisitive to prove this in a more general way.  The left side of an identity occurs while solving another problem (concerning binomial theorem) so I am more interested in deriving the right side from the left side, else I have to remember it now onward.  EDIT: I am more interested in an algebraic proof rather than combinatorial argument or something involving calculus (however I liked  and  solution), hence I am removing the combinatorics tag. I am in trouble with polarization and entanglement. Let's consider three cases : Case 1) : Statistical mixture of $|H\rangle$ and $|V\rangle$ polarized photons Case 2) : Photons in a superposition state $1/\sqrt{2}(|H\rangle+|V\rangle)$ Case 3) : Photons which are entangled with twin ones in $1/\sqrt{2}(|H,H\rangle+|V,V\rangle)$ state Which experiments can be conducted to differentiate the case  statistical mixture from the case  superposition state ?   Which experiments can be conducted to differentiate the case  statistical mixture from the case  entangled photons in superposition state ?   Using a $45^\circ$ polarizer I think you can differentiate case 1/case 2 but not case 1/case 3 I don't know how to differentiate case 1/case 3 except maybe using quantic tomography and Wigner function. Is it true ? Is there any other simpler way ? Thanks a lot for your answer and sorry for this maybe dummy question... What exactly is the singleton class in ruby? Conjugate subgroup strictly contained in the initial subgroup? Determinant of an $n\times n$ complex matrix as an $2n\times 2n$ real determinant If $A$ is an $n\times n$ complex matrix. Is it possible to write $\vert \det A\vert^2$ as a $2n\times 2n$ matrix with blocks containing the real and imaginary parts of $A$?  I remember seeing such a formula, but can not remember where. Any details, (and possibly references) for such a result would be greatly appreciated. I have a MicroSD card in a USB adapter (which plugs into a USB port on my machine, and acts like a USB flash drive). I was using Unetbootin to make this a bootable USB flash drive with Kubuntu. But I needed to cancel while it was working. So I killed the Unetbootin process from the console.  Since then, I can't format the MicroSD or delete the folder that Kubuntu made. I have also tried mkdosfs, with no success. I can't mount the drive anymore either? What can I do to make this drive usable again?  Trying to create a new partition table in GParted, as described in Eliah Kagan's answer, does not work. It fails with the error message "imposible crear tabla de particiones" ("unable to create a partition table"). P-adic expansion construction Lets say I have a domain already, for example www.automobile4u.com (not mine), with a website fully running and all.  The title of my "Website" says:    &lt;title&gt;Used cars - buy and sell your used cars here&lt;/title&gt;   Also, lets say I have fully SEO the website so when people searching for the term buy used cars, I end up on the second or first page.  Now, I want to end up higher, so I go to the google adwords page where you can check how many searches are made on specific terms.  Lets say the term "used cars" has 20 million searches each month.  Here comes the question, could I just go and buy that domain with the search terms adress, in this case www.usedcars.com and make a redirect to my original page, and this way when people search for "used cars", my newly bought domain name comes up redirecting people to my original website (www.automobile4u.com)?  The reason I believe this benefits me is because it seems search engines first of all check website adresses matching the search, so the query "used cars" would automatically bring www.usedcars.com to the first result right?  What are the downsides for this?  I already know about google spiders not liking redirects, but there are many methods of redirecting...  Is this a good idea generally? The probability of two dice summing to k is simple enough, make a diagram of the throws,  $$ \begin{array}{c}  &amp;|&amp;1&amp;2&amp;3&amp;4&amp;5&amp;6\\\hline 1&amp;|&amp;2&amp;3&amp;4&amp;5&amp;6&amp;7\\ 2&amp;|&amp;3&amp;4&amp;5&amp;6&amp;7&amp;8\\ 3&amp;|&amp;4&amp;5&amp;6&amp;7&amp;8&amp;9\\ 4&amp;|&amp;5&amp;6&amp;7&amp;8&amp;9&amp;\color{green}{10}\\ 5&amp;|&amp;6&amp;7&amp;8&amp;9&amp;\color{green}{10}&amp;11\\ 6&amp;|&amp;7&amp;8&amp;9&amp;\color{green}{10}&amp;11&amp;12\\ \end{array} $$  and the probability of a sum is just the length of the corresponding diagonal divided by $36$. For instance, $\mathrm{P}(\mathrm{sum} = 10) = \frac{3}{36} = \frac{1}{12}$. However, it's not as easy to draw a diagram for three dice or more, so how would a general formula look?