Expressions - is there an easy and "visual" way to combine them into another expression?
Combining two expressions (Expression>)
Android adware lets me opt out: is it safe? Recently my mom's phone running Android 5.0 has been infected with a piece of adware:    At first we thought this was caused by applications, but as you can see here, only the Google/METROPCS Internet browser is running.  In the photo, there is a button that reads 'opt out'. So I clicked on it and it took me to this link at http://tracker.tpc.re/optout/mobile/:    BUT both of these options smelly fishy. For starters, the manual app is not a download link in the play store but an APK, making it seem like a virus. The second (manual) as for sensitive information, which could harm me even more.   Which one of these options do I choose? Are they legit or do I have to do get rid of it another way? C++ cout hex values? How did the Community user earn the Civic Duty badge? Apparently, .  How the heck did that happen? I'm looking for a library/method to parse an html file with more html specific features than generic xml parsing libraries. Monotonicity in argmin function I have the following equation $$f(a)=\text{argmin}_{t\in\mathbb{R}} \sum_{i=1}^n\frac{1}{2}(1-a)(b_i-t)^2+a| b_i-t |, a\in[0,1]$$  How does one prove that the function is monotone in a? I'm trying to write a blog post which includes a code segment inside a &lt;pre&gt; tag. The code segment includes a generic type and uses &lt;&gt; to define that type. This is what the segment looks like:  &lt;pre&gt;     PrimeCalc calc = new PrimeCalc();     Func&lt;int, int&gt; del = calc.GetNextPrime; &lt;/pre&gt;   The resulting HTML removes the &lt;&gt; and ends up like this:  PrimeCalc calc = new PrimeCalc(); Func del = calc.GetNextPrime;   How do I escape the &lt;&gt; so they show up in the HTML? There are some kind of door devices which push the door back after we open the door and come out.  My problem is that the door area is not constructed in a way that such a device can be installed.  There is no space adjacent to the door anywhere.  Automatic closure of door is extremely important to me.   Please see following pictures and tell what choices do I have. Extracting usernames from the /etc/passwd file What is the complexity of finding SHA-1 collisions? Given the , what is the complexity of finding a SHA-1 collision?  Marc Steven's  is still detailing about 260. Does the previous complexity still hold? Let $f,g:X\to Y$ be maps of spaces such that $f\simeq g$. Is it true that the mapping cones $\operatorname{cone}(f)$ and $\operatorname{cone}(g)$ are homotopy equivalent?  Can we write down an explicit homotopy equivalence? It ought not to be too hard to get a map $\operatorname{cone}(f)\to \operatorname{cone}(g)$ from the existence of a homotopy $H:X\times I\to Y$, but I haven't been able to find a sensible candidate, despite trying for quite a while. En Dashes & Hyphens in Same Phrase Without recasting and in lieu of unsightly suspensive hyphenation, could these work? The en dash (which means "to") is used between the figures, and the hyphens are used in the compound modifier. To me, the examples below are concise and clear.  Do you agree that the examples below are 100% punctuated correctly--yes or no?  45–50-year-old men  10–20-mile radius  $45–$55-million-per-year industry  $100,000–$150,000-a-year savings  10–15-degree temperature difference  $2–$5-per-day service fees  45–75-cent-a-week raises  55–65-mph speed zone  15–20-ounce steaks  20%–40%-a-year tax increases Mirror modifier is not working, no mirrored object? I'm learning how to use the mirror modifier and I am having some trouble.  When I apply the modifier to my object I don't see a mirrored version of it.  What am I doing wrong? How to show that $x^4+1$ is irreducible in $\mathbb Z[x]$ but it is reducible modulo every prime $p$?   For example I know that $x^4+1=(x+1)^4\bmod 2$. Also $\bmod 3$ we have that $0,1,2$ are not solutions of $x^4+1=0$ then if it is reducible the factors are of degree $2$. This gives that $x^4+1=(x^2+ax+b)(x^2+cx+d)$ and solving this system of equations $\bmod 3$  gives that $x^4+1=(x^2+x+2) (x^2+2x+2) \pmod 3$. But is there a simpler method to factor $x^4+1$ modulo a prime $p$? This applies to all d20 systems, but with an example from the from the Pathfinder  (emphasis mine):  Stonecunning: Dwarves receive a +2 bonus on Perception checks to potentially notice unusual stonework, such as traps and hidden doors located in stone walls or floors. They receive a check to notice such features whenever they pass within 10 feet of them, whether or not they are actively looking.  In this case, does the GM roll the check in secret or ask the player roll the check? If the GM asks the player to roll for the check, what stops situations like:  GM: (interrupting) &quot;Gimli, Roll a perception check.&quot; Dwarf player: &quot;Oh, it's a natural one, I guess I don't see anything.&quot; Human player: &quot;Okay, I'll roll a perception check for anything unusual in this room. Nice! 19. How about 19, does 19 work for you?&quot; GM: &quot;Gimli, everything looks kosher to you. Aragon, you notice a rock coloured tarp on the ground here, covering what looks like a pit trap.&quot;  In this case, by telling the dwarf to roll his &quot;free&quot; perception check, he's telegraphed to the players that there is something to notice. How can this be fixed, without bluffing checks for nothing in particular to throw off the signal to noise ratio of similar checks? Is it a good practice to always scale/normalize data for machine learning? If I have a legendary creature out, and I make a copy of it (such as by enchanting it with  or making a ), do I get enters-the-battlefield effects from the creature before I have to sacrifice it to the legend rule? I am having trouble getting onto a server in Minecraft PE on iOS. When I tap on the person's server it just says invalid name:    I have tried turning off and restarting the iPad, going to home screen and logging back into the server but I have had no luck and no change. Is there a reason why this is so? How am I to "[u]se induction to show that $n$ straight lines in the plane divide the plane into $\frac{n^2+n+2}{2}$ regions"? It is assumed here that no two lines are parallel and that no three lines have a common point. Further, this is not a non-Euclidean problem, but I wouldn't mind a discussion on the non-Euclidean nature of the problem.  I was thinking it might be easier to show using the unit sphere.    A GOOD REFERENCE I FOUND THAT WILL BE USEFUL TO ANYONE COMING ACROSS THIS PROBLEM IS Concrete Mathematics, Graham, Knuth, Patashnik pp. 4–8. LaTeX seems to be having problems handling nested optional arguments. I've included a minimal code example that generates the error:  \documentclass[12pt,oneside]{book} \begin{document}  \newcommand{\termbad}[2][]{#2#1} \newcommand{\termgood}[2][]{#2#1}  \newcommand{\up}[1]{#1} \newcommand{\dd}[1][]{#1}  \termgood{\up{Tart}}{Pop} \termbad[\up{Tart}]{Pop}      \termgood{\dd[Tart]}{Pop} \termbad[{\dd[Tart]}]{Pop} %\termbad[\dd[Tart]]{Pop}   \end{document}   If you run this code, it works. If you remove the % in the second to last line, it fails with:  Runaway argument?  Tart{Pop} \par \par \end {document}  !File ended while scanning use of \dd.   After further tinkering, I have discovered the problem: LaTeX is reading the ] for the inner optional argument as the end of the outer optional argument and then passing a malformed argument in. So it is passing in \dd[Tart as the optional argument to \termbad instead of \dd[Tart].  This still feels like a bug to me. Nesting braces in arguments works, brackets should as well. The following are workarounds:   Enclose the inner optional argument in braces (as in the line before %). Redefine your inner function to require its argument instead of using optional arguments. Redefine your outer function to require its argument instead of using optional arguments.   Any one of the three works around the issue.  (Reposted here; question was originally posted to stackexchange and then closed instead of being migrated.) Why is the last digit of $n^5$ equal to the last digit of $n$?