how to correct topology after boolean operation?
Is there an easy way to add a hole into an object?
What does the Canonical Commutation Relation (CCR) tell me about the overlap between Position and Momentum bases? Is it possible to do vector calculus in Mathematica? Does Python have a ternary conditional operator? I have the Xiaomi Mi A3 and I'm currently on both phone and PC latest stock update. I am using Windows 10 20H2 and I have tried everything – but still don't get it. I tried another Mi A3 and it got attached normally. I've tried installing all kind of drivers and different ports, nothing. When suddenly it worked and I installed the stock ROM – but because the stock ROM is kinda laggy and ugly I want to change it. But I can't because I am also on stock recovery and I can't install another recovery because my device isn't recognized in fastboot mode. My device is recognized in adb mode and in edl mode as well, only not in fastboot. "Oriented" vs. "orientated" How to set a shortcut for "Always on Top" for window? In 12.04 (Unity), I would like to assign a shortcut to the "always on top option" for a window. Probably something like Ctrl+Shift+Home to turn on and Ctrl+Shift+End to turn off, or whatever. Is there an option to do this somewhere in the Compiz Settings Manager?  This (old)  claimed that      For compiz, Enable Extra WM Actions. Check the properties, and insert ALT+A to Key field for Toggle Always-On-Top action.   But I couldn't find that. Can't boot into Ubuntu in Windows 10 / Ubuntu dual boot If you have the ability to cast a spell without a spell slot, can you cast that spell using a spell slot? Orthogonal Projection onto the $ {L}_{\infty} $ Unit Ball What is the Orthogonal Projection onto the $ {\ell}_{\infty} $ Unit Ball?  Namely, given $ x \in {\mathbb{R}}^{n} $ what would be:  $$ {\mathcal{P}}_{ { \left\| \cdot \right\| }_{\infty} \leq 1 } \left( x \right) = \arg \min_{{ \left\| y \right\| }_{\infty} \leq 1} \left\{ {\left\| y - x \right\|}_{2}^{2} \right\} $$  I managed to get an answer using the . Yet I would be happy to see if someone can derive the answer directly.  Thank You. Use the triangle inequality to show that $|a|+|b| \leq |a+b|+|a-b|$ How would I go about proving that  $$|a|+|b| \leq |a+b|+|a-b|$$  Using the triangle inequality?  I tried squaring both sides, yielding:  $$|a|^2 +|b|^2 +2|a||b| \leq 2|a|^2+2|b|^2+2||a|^2-|b|^2|$$  Is it correct to move the terms to the other side? I tried $$2|a||b| \leq |a|^2+|b|^2+2||a|^2-|b|^2|$$ Then it is obvious that  $$0\leq |a|^2+|b|^2-2|a||b| +2||a|^2-|b|^2|$$ $$0\leq (|a|-|b|)^2 +2||a|^2-|b|^2|$$ $$0\leq ||a|-|b||^2 +2||a|^2-|b|^2|$$  But I have neither used the triangle inequality, nor it looks mathematically rigorous for my real analysis class. Any tips and tricks for solving these problems? Came across this little practice exercise, and I couldn't properly convince myself of this relation:  Let $X,Y \subset \mathbb{R}^n$ and $g:X\times Y \rightarrow \mathbb{R}$. Show that $$\sup_{y \in Y} \inf_{x \in X}g(x,y) \leq \inf_{x \in X} \sup_{y \in Y} g(x,y).$$  My thinking was starting with $\inf_{x \in X}g(x,\overline{y}) \leq\sup_{y \in Y} g(\overline{x},y)$, but does that even hold for all $\overline{x} \in X$ and $\overline{y} \in Y$? Methods to compute $\sum_{k=1}^nk^p$ without Faulhaber's formula As far as every question I've seen concerning "what is $\sum_{k=1}^nk^p$" is always answered with "Faulhaber's formula" and that is just about the only answer.  In an attempt to make more interesting answers, I ask that this question concern the problem of "Methods to compute $\sum_{k=1}^nk^p$ without Faulhaber's formula for fixed $p\in\mathbb N$".  I've even checked this  without finding what I want.  Rule #1: Any method to compute the sum in question for arbitrary $p$ is good, either recursively or in some manner that is not in itself a closed form solution.  Even algorithms will suffice.  Rule #2: I don't want answers confined to "only some values of $p$".  (A good challenge I have on the side is a generalized geometric proof, as that I have not yet seen)  Exception: If your answer does not generalize to arbitrary $p$, but it still generalizes to an infinite amount of special $p$'s, that is acceptable.  Preferably, the method is to be easily applied, unique, and interesting.  To start us off, I have given my answer below and I hope you all enjoy. As far as I can tell downvoting is mostly useless.     For questions the only people who get downvoted are lower rep users, or incredibly stupid questions    most questions that are downvoted get closed anyway which should be sufficient downvoting doesn't have too much affect on your rep anyway a negative comment is more useful and more of a push too change or delete the question  For answers downvoting is often used incorrectly as well   people commonly competitively downvote (downvoting another answer to a question that you also answered) obviously not a good behavior downvoting (and upvoting) are contagious, meaning one downvote leads to a bunch of others even though downvotes don't effect rep that much they create a negative environment, no one wants their post downvoted, on the other hand criticizing comments, I think, are far more welcome      So basically in a nutshell a downvote serves no real purpose even if a post deserves it. Flagging, closing and commenting are much more useful to everyone including the poster than downvoting so why have it.    I now see from the answers and comments that downvotes do serve a purpose and would like to retract my request. I understand how Insight and Perception can be used passively: for the DM to determine if an enemy Deception or Stealth attempt is successful without alerting the players that someone is deceiving or sneaking.    But the Observant feat in the Player's Handbook states:      [...] You have a +5 bonus to your passive Wisdom (Perception) and passive Intelligence (Investigation) scores.     So in what situation would a DM be rolling something against the player's Investigation without letting them know? We know that any particle moving at speed of light will have infinite mass.  Since even Light has particles. Then what is the size of the Particle? How to imagine this with the mass of light particles. What can I do if a package is not available on the newest version of Ubuntu (18.04) but is available on older versions? I've seen a lot of people talking about FPGA's before and I know that it stands for field-programmable gate array but how does it work and what is the purpose of using an FPGA? How do I show that $\frac {a^2}b + \frac {b^2}c + \frac {c^2}d + \frac {d^2}a \ge 4$ for $a^2 + b^2 + c^2 + d^2 = 4$? Let $a, b, c, d$ be positive real numbers such that $a^2 + b^2 + c^2 + d^2 = 4$, show that $$\frac {a^2}b + \frac {b^2}c + \frac {c^2}d + \frac {d^2}a \ge 4.$$  My try:  $$\frac {a^2}b + \frac {b^2}c + \frac {c^2}d + \frac {d^2}a \ge a + b + c + d,$$  yet $$a + b + c + d \le \sqrt{4(a^2 + b^2 + c^2 + d^2)} = 4.$$  Thus, direct application of Cauchy-Schwarz inequality is too weak. I tried other methods but with no significant progress:  $$(\frac {a^2}b + \frac {b^2}c + \frac {c^2}d + \frac {d^2}a)^2 \ge \frac {(a^{4/3} + b^{4/3} + c^{4/3})^3}{a^2 + b^2 + c^2 + d^2} = \frac {(a^{4/3} + b^{4/3} + c^{4/3})^3}4.$$  I also observed that  $$(\frac {a^2}b + \frac {b^2}c + \frac {c^2}d + \frac {d^2}a) + (\frac {a^2}c + \frac {b^2}d + \frac {c^2}a + \frac {d^2}b) + (\frac {a^2}d + \frac {b^2}a + \frac {c^2}b + \frac {d^2}c) + (\frac {a^2}a + \frac {b^2}b + \frac {c^2}c + \frac {d^2}d) = 4 (\frac 1a + \frac 1b + \frac 1c + \frac 1d) \ge 16,$$  since $$\frac 1a + \frac 1b + \frac 1c + \frac 1d \ge \sqrt{\frac {(1 + 1 + 1 + 1)^3}{a^2 + b^2 + c^2 + d^2}} = 4.$$  Now my work might seem stupid or off-topic here, but I provide it here because I wish any of these attempts will lead to a solution. Any hints will be appreciated. In the sentence-     You must wear a suit to an interview   shouldn't the to be replaced by for? Or what's the difference between these two here? launch sms application with an intent