These apps keep showing up in my data usage screen. I have no idea what they are or where they came from. There are 25 of them by the way. All they seem to do is use up data and interfere with my phones operation. I.E. slowing it down, closing other programs, opening Google play asking me to download one thing or another, pretty sure they've ended a couple of my calls. Though I can't prove it. NO anti-malware picks them up.  If it is an app I've installed causing the problem how do I figure out which one (short of installing them one at a time)? Is there anyway to get rid of them (short of formatting phone again or performing a factory reset)?  I'm not a pro so I need it simply explained. Not dumb either. My phone is not rooted and I'd rather not if I don't have to. It looks like a pain and I'm not great with Linux systems. My phone it a ZTE Rapido LTE model Z932L, Android version 4.1.2. Any help would be great.  Edit: I don't think the question that is similar to mine answers my question. Tho the are very similar. I did not have my phone updated or messed with by the company I bought it from. Its a straight talk phone. To my knowledge there isn't anywhere I could take it. I have factory reset my phone twice and the problem continues. It could very well be something I did (infact that's the most likely conclusion). If it is I need to know what so I don't do it again lol. Also added screen shot of "removed apps," and two more have popped up since I posted this question. I have not uninstalled anything.    Screenshots (click images for larger variants)
A mysterious app named &quot;10102&quot; shows up in my data usage. It bears only the standard Android app icon (the Bugdroid logo with a cube on its torso). From what the graph tells me, it has used 36 megabytes of data in the background and zero on the foreground. I think I haven't uninstalled anything for months. Is it malware? I haven't sideloaded anything and only authorized my laptop as a USB debugger. If it's malware, how do I remove it? I have no idea how to find its package name and 10102 isn't in the list of downloaded apps in settings. I'm running stock &amp; never-been-rooted Android 4.4.4 on Nexus 4.
Understanding the proof of infinitely many primes $\equiv 3\pmod{\!4}$ Theorem: There are infinitely many primes congruent to $3 \mod 4$. Proof: Assume that $p_1 = 3, . . . , p_n$ are primes of the form $p_j ≡ 3 \mod 4$. We will construct a new one by looking at $N = 4p_1 · · · p_n − 1$ (putting $N = 4p_1 · · · p_n+3$ would also work).  There is more to this proof but the rest of it I understand, what I don't get is where it says &quot;$N = 4p_1 · · · p_n − 1$ (putting $N = 4p_1 · · · p_n+3$ would also work)&quot;. I do not understand why we are writing $4p_1 · · · p_n − 1$. Is there a more clear way to prove this theorem? So I took an introductory abstract algebra course a few semesters ago, and we were shown that groups and rings can both be made into products, i.e. if I have some group $G$ (resp. ring $R$) and some indexing set $I$, then I can make a group $G^{I}$ (resp. ring $R^{I}$) with the appropriate cardinality. However, it was also demonstrated that for fields, you cannot keep the multiplicative inverse under a product structure, i.e. if I have fields $F_{1}, F_{2}$, then $F_{1} \times F_{2}$ will still be a ring, but you will not (not just "not in general", but won't) have multiplicative inverses for all non-zero (i.e. not $(0, 0)$) elements, as you could pick $(0, x)$, where $x \neq 0$. According to Wikipedia, an ultraproduct will preserve field structure, but I'm not sure what the cardinality of $\prod_{i \in I} F_{i} / \mathscr{U}$ would be in general.  I saw  that said you could make a field of arbitrarily large cardinality by extending a given field through throwing in a whole bunch of "transcendental" elements. The example given was that if I had $\mathbb{Q}$, I could start by dumping in the complexes, but then I suppose after that I'd just start throwing in dogs and cats or something; I'm really not sure what that responder meant, and ceteris paribus, my dogs tend to stay inside, so I'd rather keep them out of my fields, particularly the large ones the thread was interested in.  Moreover, the thread mentioned earlier seemed more concerned with just making the fields big. My question is a bit more nuanced: Given any cardinality $\kappa &gt; 1$, can I generally construct a field $F$ of a cardinality $\kappa$? Moreover, how vague do I have to be about it (i.e. do I have to use some really choicy methods, or can I make it a bit more straightforward)?  Thanks.  EDIT: Sorry. I am aware that for finite fields, you are limited to powers of primes. I meant for infinite cardinals. I was readng Wikipedia article (English one) about radiation pressure because there is something I still cannot figure out. As I understand it, radiation pressure emerges from conservation of momentum. Photons or electromagnetic waves possess momentum and when they are absorbed, reflected or even emitted, the aborber/reflector/emitter experiences a pressure that is proportional to the irradiance (in watts per square meter). OK. In the case of a perfect reflector that does nothing but reflecting incoming radiation, it would seem the reflector is pushed and the radiation is reflected in opposite directions. But the radiation has not lost anything, it has only changed direction. And I do not understand how something can be set in motion (the reflector), which amounts to do work, yet the source of this work does not lose energy. I mean, if the radiation, after a U turn, meets a second reflector, it would have pushed two reflectors a way, yet it would continue in its original direction as if nothing happened...? What am I missing here? Should not photons lose something? How would you categorize email subjects to find similar emails? I have a list of email subjects like:  &lt;XYZ&gt; commented on &lt;ABC&gt; Weekly review for &lt;Company&gt; Your account is ready    And I want to find patterns in them so I can group them.  Is there a well known algorithm I can use?    Preferably with wide language implementations or easy re-implementation. The algorithm should be unsupervised. The number of different emails is not known.   Update:  I think I can break this down into two problems:   Group subjects by the similar words they use, resulting in the following. Each group should be very distinct from the rest (they should be almost perfectly exclusive) and the algorithm should give relatively small number of groups with good length of the common words.  [commented, on] [weekly, review] [your, account, is, ready]  Once grouped, it should be easy to find a state automaton that accepts only the group's subject and thus eliminates variable Then I can go back and check if there are any intersections and tweak the variables.   Having said that, is it better to use a completley different approach like neural nets maybe? I have zero experience with those, but if it makes more sense, I am open to learning. $n &gt; 2$ and $n$ is a prime number then $n$ is odd.  Prove by contradiction assume $n$ is even then there is some $k\in\Bbb N, n = 2k$ then $n &gt;2, 2k &gt; 2 , k &gt; 1$  Is this  a sufficient proof? How can we print line numbers to the log in java How to print line numbers to the log. Say when outputting some information to the log, I also want to print the line number where that output is in the source code. As we can see in the stack trace, it displays the line number where the exception has occurred. Stack trace is available on the exception object.  Other alternative could be like manually including the line number when printing to the log. Is there any other way? Want to install VirtualBox Guest Additions on CentOS 7 but get a header mismatch How can I get a copy of a Canadian visa refusal letter? I have applied for a Canadian Temporary Resident Visa (TRV); a previous paper application was refused in 2016. I have lost the copy of my refusal letter and want to submit it when I apply for my new visa. How how can I get the a copy of the 2016 refusal letter from Embassy? Typesetting 144...4 with "n times" under the 4's is easy, but what about \sqrt{144...4}? How do you keep parents of floated elements from collapsing? Although elements like &lt;div&gt;s normally grow to fit their contents, using the float property can cause a startling problem for CSS newbies: If floated elements have non-floated parent elements, the parent will collapse. For example:   &lt;div&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    The parent div in this example will not expand to contain its floated children - it will appear to have height: 0. How do you solve this problem? I would like to create an exhaustive list of solutions here. If you're aware of cross-browser compatibility issues, please point them out. Solution 1 Float the parent.   &lt;div style="float: left;"&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    Pros: Semantic code. Cons: You may not always want the parent floated. Even if you do, do you float the parents' parent, and so on? Must you float every ancestor element? Solution 2 Give the parent an explicit height.   &lt;div style="height: 300px;"&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    Pros: Semantic code. Cons: Not flexible - if the content changes or the browser is resized, the layout will break. Solution 3 Append a &quot;spacer&quot; element inside the parent element, like this:   &lt;div&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt;   &lt;div class="spacer" style="clear: both;"&gt;&lt;/div&gt; &lt;/div&gt;    Pros: Straightforward to code. Cons: Not semantic; the spacer div exists only as a layout hack. Solution 4 Set parent to overflow: auto.   &lt;div style="overflow: auto;"&gt;   &lt;div style="float: left;"&gt;Div 1&lt;/div&gt;   &lt;div style="float: left;"&gt;Div 2&lt;/div&gt; &lt;/div&gt;    Pros: Doesn't require extra div. Cons: Seems like a hack - that's not the overflow property's stated purpose. Comments? Other suggestions? Much effort has been expended on a famous unsolved problem about the .  Not surprisingly, it's called the Riemann hypothesis, which asserts:  $$ \zeta(s) = 0 \Rightarrow \operatorname{Re} s = \frac1 2 \text{ or } \operatorname{Im} s = 0 .$$  Now there are numerical methods for approximating $\zeta(s)$, but as I understand, no one knows any exact values except at even integers, which include the trivial zeroes for which $\operatorname{Im} s = 0 $.  So I've always wondered:  For the rest, how does one prove $\operatorname{Re} s = 1/2$ exactly?  (All I know that seems vaguely useful is the argument principle, which I'm not sure helps here, but I'd be happy to learn about other techniques that aren't too far advanced.)  Edit:  Looking over this again, I found out I missed the closed-form values at .  This doesn't affect the question but seemed worth correcting.  Thanks to the people who contributed. Asynchronous shell exec in PHP What is the association bonus, and how does it work? I was just awarded +100 reputation on all of my Stack Exchange accounts.  What is this bonus for? It simply says "Association Bonus" on my reputation overview.  Also:   What privileges does the association bonus grant users? Can I lose the association bonus? Does it make my reputation 101 everywhere? Can I earn the association bonus on sites I haven't joined yet? Does it matter which site I earn the 200 reputation on? Will I get an association bonus every time my reputation on a site crosses 200 points? Does the association bonus allow me to answer protected questions? Does the association bonus count towards the reputation cap? Can I get the association bonus if I only have a profile on one site? What else is there to know about the association bonus? Labelling figures in the tikz package Consider the following piece of code, which uses the tikz-feynman package:  \usepackage{tikz-feynman, contour} \tikzfeynmanset{compat=1.1.0}  \begin{document} \begin{center}     \begin{tikzpicture}[baseline={(current bounding box.center)}]     \begin{feynman}         \diagram [vertical'=a to b] {             {   [edges={draw=none}]                 a -- b [label=0:\(\mu_{3}\)]                 -- c [label=-180:\(\mu_{4}\)]                 -- d [label=-180:\(\mu_{1}\)]                 -- a [label=0:\(\mu_{2}\)],             },             {   [edges={photon}]                 a -- ap [particle=\(p_{2}\)],                 b -- bp [particle=\(p_{3}\)],                 d -- dp [particle=\(p_{1}\)],                 c -- cp [particle=\(p_{4}\)],             },         };         \diagram* {             (c) -- [fermion] (b)                 -- [fermion] (d)                 -- [fermion] (a)                 -- (c),         };     \end{feynman}     \end{tikzpicture}     %     \feynmandiagram[baseline={(current bounding box.center)}, vertical'=a to b,] {         {   [edges={fermion}]             a -- b [label=0:\(\mu_{3}\)]             -- c [label=-180:\(\mu_{4}\)]             -- d [label=-180:\(\mu_{1}\)]             -- a [label=0:\(\mu_{2}\)],         },         {   [edges={photon}]             a -- ap [particle=\(p_{2}\)],             b -- bp [particle=\(p_{3}\)],             d -- dp [particle=\(p_{1}\)],             c -- cp [particle=\(p_{4}\)],         },     };     %     \begin{tikzpicture}[baseline={(current bounding box.center)}]     \begin{feynman}         \diagram [vertical'=a to b] {             {   [edges={draw=none}]                 a -- b [label=0:\(\mu_{3}\)]                 -- c [label=-180:\(\mu_{4}\)]                 -- d [label=-180:\(\mu_{1}\)]                 -- a [label=0:\(\mu_{2}\)],             },             {   [edges={photon}]                 a -- ap [particle=\(p_{2}\)],                 b -- bp [particle=\(p_{3}\)],                 d -- dp [particle=\(p_{1}\)],                 c -- cp [particle=\(p_{4}\)],             },         };         \diagram* {             (a) -- [anti fermion] (b)                 -- [anti fermion] (d)                 -- [anti fermion] (c)                 -- (a),         };     \end{feynman}     \end{tikzpicture}     \end{center} \end{document}   This piece of code draws the following figure:    I would like to label each figure. I do not want a caption, but just a label beneath each diagram. The label should say Diagram I, Diagram II, Diagram III.  How do I implement this into my code? How to import a module given the full path? Entire function problem: translation For what powers $k$ is the polynomial $n^k-1$ divisible by $(n-1)^2$? How do you prove this?  $$\left(n-1\right)^2\mid\left(n^k-1\right)\Longleftrightarrow\left(n-1\right)\mid k$$ Is the oil thrown on a creature consumed when it's dealt fire damage and lit? I had the idea of throwing oil flasks on enemies at level 1, then hitting them with a torch to deal a bunch of bonus fire damage.  PHB 152:     If the target takes any fire damage before the oil dries (after 1 minute), the target takes an additional 5 fire damage from the burning oil.   PHB 152:     If you make a melee attack with a burning torch and hit, it deals 1 fire damage.   A flat 6 fire damage is pretty potent at level 1, but does the oil remain or does it burn out in a flash when hit (since it has no damage over time) when hit?  If not there is potential for a dual torch wielding PC to throw down 12 fire damage per round, or for multiple PCs to deal 6 damage per torch per PC per round. Add transparency to an existing PNG I'd like to use this image on a web site.    What I need to do is change the background from black to transparent, so I can use the arrow on my site maintaining the page background.  I used Gimp to convert the image to .png, but how do I proceed now? Proving the so-called "Well Ordering Principle" Is there anything wrong with the following proof?  Theorem. Every non-empty subset $B \subset\mathbb{N}$ has a least member.  Proof. Assume not. Then, of necessity, we'd have to have $B=\varnothing$, for if $B$ contained even one $b\in\mathbb{N}$, then that $b$ would satisfy $b=min(B). $ Contradiction, end proof.  I get the sense there is something wrong here, but I can't seem to define exactly what. Also, is there a context where one can simply take this principle as an axiom, and not have to prove it? After all, it is extremely intuitive. Thanks.