What is this symbol on top of my service bar?
What is the status icon that looks like a house?
Convert ls -l output format to chmod format Phone : nexus 5 version 2013 Android version : 6.0 Kernel version : 3.4.0-g2aa165e Build number : MRA58N   For the last few days, 10118 has been draining my phone's battery. It drains battery by using GPS. I typed 'ps' in a terminal emulator, and there was no application with PID 10118. I don't know what exactly 10118 is. My guess is that it's one of recently installed weather apps.  How can I fix this?    Screenshots (click images for larger variants) First, this question is motivated by the imprecise question: Is there a sensible notion of parity (evenness and oddness) for real numbers?   Here are some properties a notion of parity for $\mathbb{R}$ should have:    It should be an equivalence relation on $\mathbb{R}$ with exactly two equivalence classes.  Each equivalence class should be dense in $\mathbb{R}$. There should be some kind of symmetry between the two equivalence classes. (This is intentionally imprecise.)   If we divide $\mathbb{R}$ into rationals and irrationals, this lacks symmetry, since the rationals have measure zero and are countable, while the rationals have infinite measure and are uncountable.   So we could require that each equivalence class be uncountable and/or have positive (or infinite) measure. Then take one equivalence class to be the rationals, union with countably many fat cantor sets with positive measure, and the other class its complement. Then both classes are now dense, uncountable, and have infinite measure. But again, symmetry is lacking. One of these classes is "uncountable everywhere" and has "positive measure everywhere" while the other does not.   I propose some definitions: A subset $A \subset \mathbb{R}$ is uncountable everywhere if for any open interval $(a,b)$, the intersection $A \cap (a,b)$ is uncountable. A subset $A \subset \mathbb{R}$ has positive measure everywhere if for every open interval $(a,b)$, the intersection $A \cap (a,b)$ has positive measure. We can see immediately that having positive measure everywhere implies being uncountable everywhere, since a positive measure set must be uncountable.   Finally, my questions:    Is there a partition of $\mathbb{R}$ into two sets that are both uncountable everywhere?  Is there a partition of $\mathbb{R}$ into two sets that both have positive measure everywhere?  Is there a partition of $\mathbb{R}$ into two sets that split each interval $(a,b)$ into two parts of equal measure?   Potential generalizations for extra credit: What about partitions of $\mathbb{R}$ with $n$ equivalence classes, where $n \in \mathbb{N}$, or even with countably many, or even uncountably many equivalence classes?  Note: If you've seen these definitions of uncountable everywhere or positive measure everywhere somewhere under a different name, please let me know. I've never found anything where other people were thinking about these notions.  EDIT: By "measure," I mean Lebesgue outer measure, so we don't have to worry about anything being measurable. using underscore's “difference” method on arrays of objects The  specifically says not to ask  for career advice but people do it anyway.  Should I consider the Help Center outdated or only loosely enforced?    And what about a career advice site on the network?  There are 70+ sites, and most of them are for relatively narrow interests (which is not a criticism, I enjoy looking through the many sections).  A career section seems like it would be very popular.  Also, a careers section would help keep career questions off the other sites. How to prove that $z\gcd(a,b)=\gcd(za,zb)$ I need to prove that $z\gcd(a,b)=\gcd(za,zb)$.    I tried a lot, for example, looking at set of common divisors of the two sides, but I can't conclude anything from that. Can you please give me some advice how I can handle this problem? And $a,b,z \in \mathbb{Z}$. How to check if $\sum_{n=1}^\infty \frac 1{n!}$ is converging or diverging by direct comparison test? $$\sum_{n=1}^\infty \frac 1{n!}$$   I think we may compare it with $\frac{1}{n^n}$, and say that $\frac{1}{n!}&gt;\frac{1}{n^n}$. But I am not sure of the convergence or divergence of $\frac{1}{n^n}$ itself, so this turns out to be useless.  What other way is there? Having trouble creating an array of objects What sci-fi work first showed a weapon of galactic-scale mass destruction? Currently, I have two examples in my mind:   Halo (Halo video game series; 2001): Can destroy all sentient life within three galactic radii The Moment/ Eye of Discord/ Galaxy Eater (Doctor Who (2005) TV series; 2013): Can destroy entire galaxy within a moment   What sci-fi work first showed a weapon of galactic-scale mass destruction? Assume $R=(\mathcal{U}_n)_n$ is a sequence of distinct ultrafilters on some set $X$. Since every Hausdorff space has an infinite discrete subspace, there is a subsequence $R=(\mathcal{V}_n)_n$ of $R=(\mathcal{U}_n)_n$ such that $\{\mathcal{V}_n|n \in \mathbb{N} \}$ is a discrete subspace of $\beta X$. In particular, there is a sequence $(A_n)_n$ of sets with $A_n \in \mathcal{V}_m$ if and only if $m =n$. If we let $B_n=A_n - (A_0 \cup...\cup A_{n−1})$, then the sequence $(B_n)_n$ is pairwise disjoint and $B_n \in \mathcal{V}_m$  iff $m=n$. If we let $B =\cup_n B_{2n}$, then $B \in \mathcal{V}_m$ if and only if $m$ is even. In other words, if $B =\{ \mathcal{V} \in βX|B \in \mathcal{V}\}$, then $B$ is a clopen set with $\mathcal{V}_m \in B$ iff $m$ is even. Therefore, we conclude that the sequence $(\mathcal{V}_m)_m$ cannot converge to any point, so the sequence $(\mathcal{U}_n)_n$ cannot converge to any point either.     I would like to know that:      (1) Why "$B_n \in \mathcal{V}_m$  iff $m=n$"? And " $B =\cup_n B_{2n}$, then $B \in \mathcal{V}_m$ if and only if $m$ is even "?      (2)$B$ is a clopen set with $\mathcal{V}_m \in B$ iff $m$ is even How to set static IP address? I have configured network adapter of guest Ubuntu to work in a bridged mode so I could ssh to it from the host machine.   The problem is that the guest Ubuntu ip address keep changing.   Even though it changes  within a very short range 192.168.0.4-10 it is still takes time to configure Putty and other programs each time.  Is there a way to make the guest Ubuntu ip address to be static?  My guest OS has the full GUI. What dried food can I take across the American border from Canada? We will be driving from Banff to Glacier National Park while on our camping trip and I was told to be careful with taking food across the border. We don't eat meat so that's one less issue and I already know that many fresh fruits/veggies can get complicated so I'm only thinking of taking dry stuff across (mostly grains but possibly also dried veggies).  My plan at first was to stock up at BulkBarn in Calgary since they have tons of stuff and you can just take what you need but I'm afraid that since the packaging is generic and unsealed that it might cause more problems. What are the criteria to be able to take dried food across the border? Truncated trivariate normal - conditional expectation Proof for Property of Complex Numbers Is the inequality $\lvert z_1 + z_2 \rvert \ge \lvert z_1 \rvert - \lvert z_2 \rvert$ incorrect, where $z_1$ and $z_2$ are any two complex numbers? I need an example to prove that it is. And in case it is correct, can you please give the proof? Thanks for any help. Bevel specific edges Get Last Friday of Month in Java How to prove $\lim\limits_{n \to \infty} (1+\frac1n)^n = e$? SUMIF Horizontal I am searching for a column header and return a value under it.  Example:  _|A|B|C  1|X|Y|Z  2|1|2|3   If the value is Y, it must return 2. I tried =SUMIF(A1:C1,"B", A2:C2), but realized that IFSUM does not support searching horizontal.  I would appreciate an alternative solution! Prove that between any two roots of $f$ there exists at least one root of $g$ $$f(x)= 1 - e^x\sin(x)$$   $$g(x)= 1 + e^x\cos(x)$$   Prove that between any two roots of $f$ there exists at least one root of $g$.   I know Rolle's Theorem and the Intermediate Value Theorem (I think) need to be used. Can someone show a step by step proof for this? How is the derivative of $\mbox{Trace}\left\{ X^T A X B\right\}$ with respect to matrix $X$ equal to $AXB + A^TXB^T$?  \begin{align}   \nabla_X \ \textrm{Trace}\left\{ X^T A X B\right\} = AXB + A^TXB^T \end{align}  where $A$ and $B$ matrices are given.