Dual boot Ubuntu 20.04 can't connect to ethernet or wifi
Can't get RTL8125B working on 20.04
Any way to add CSS for a single page/node? I'm cleaning up my big crazy style sheets (possibly pertinent to a future question) and I'm wondering the best way to add custom CSS to a specific node or page. In particular, my work site's home page is a Panel Page and it has a bunch of different styling. Right now the CSS is just included with the main theme style sheet. Is there a way to say, &quot;if this is node Foo, then add foo.css&quot;? Is  what I'm looking for? I might be interested in generalizing this to other nodes/sections/etc, but at the moment I just want to handle this one item. Clarification for non-answers One of my flags for "non-answer" was declined and I was wondering if I misunderstood what "non-answer" means. I saw someone post an answer that was just a block of code, with nothing in it that was even the slightest related to the question, it was just a random block of code with no explanation. Should I have not used the "not an answer" tag even though the description explicitly says that it should be used when answers "do not attempt to answer the question"? I'm learning calculus, specifically derivatives and applications of MVT, and need help with the following exercice:      Show that, for all $n &gt; 1$ $$\frac{1}{n + 1} &lt; \log(1 + \frac1n) &lt; \frac1n.$$    I tried to follow the below steps in order to prove the RHS inequality:   Proving that $f &lt; g$ on $I$ from $a$ to $b$:  Step $1$. Prove that $f' &lt; g'$ on $\operatorname{Int}(I)$.  Step $2$. Show that $f(a) \leq g(a)$ or that $f(a^+) \leq g(a^+)$  Following the above steps, let $f(x) = \log(1 + \frac1x)$ and $g(x) = \frac1x$, for all $x &gt; 1$. One has  $$f'(x) =  -\frac{1}{x^2 + x} \quad \text{and} \quad g'(x) = -\frac{1}{x^2}.$$  We note that, for every $x &gt; 1$, $f'(x) &gt; g'(x)$. Moreover, $f(1^+) = \log(2) &lt; 1 = g(1^+).$   My problem is that I got the wrong inequality sign in Step $1$.    Looking at the solution in my textbook, the author suggests using the MVT but I don't know how to apply it in this case. The app keeps asking for a nickname, and I have entered dozens of names, but it keeps saying that the names aren't available. How can I find an available name? Show some indication that account is banned from asking new questions What is the difference between currying and partial application? I quite often see on the Internet various complaints that other peoples examples of currying are not currying, but are actually just partial application.  I've not found a decent explanation of what partial application is, or how it differs from currying. There seems to be a general confusion, with equivalent examples being described as currying in some places, and partial application in others.  Could someone provide me with a definition of both terms, and details of how they differ? Exposing database IDs - security risk? How to unlock device when I forgot my password? I've read  which states that there is an option to disable the lock using my Google account information. However I did not noticed such an option when I entered my password five times wrong. (Although there was also a 20s or 30s delay to complicate brute force attacks.) I use Android 4.0.3 on a Asus Transformer Prime TF201.  Would factory reset work? Under what conditions is the difference between a rank $1$, postive semidefinite matrix and a hermitian matrix positive semidefinite? Which of those functions are PRFs? Geometric solution to find a Set of totally ordered Subsets of $ \mathbb{N} $ is uncountable My question is, does there exist a set of subsets of the naturals, $S$, such that $S$ is uncountable, where for any two subsets $A,B \in S$ we have either $A \subset B $ or $B \subset A $?  Initially my thoughts were that we could construct a chain $A_{1} \subset A_{2} \subset \cdots $ and find a bijection by picking out one element which is 'new' to each set by axiom of choice and so we have bijected to a subset of naturals, however I'm not convinced this fully works.  Furthermore, I was thinking there may be a nice elegant solution by looking for such a set in either $ \mathbb{Q}^2 $ or $ \mathbb{Z}^2 $ for example, but any attempt seems to fail due to the 'ordering' part of the question. Exact sequence of sheaves with non exact sequence of global sections Let $X$ be some topological space. By $\mathcal{F}_i$ we denote some sheaves of abelian groups on $X$. The sequence of sheaves and morphisms  $$\mathcal{F}_1\longrightarrow \mathcal{F}_2\longrightarrow \mathcal{F}_3\longrightarrow... $$ is said to be exact if for each $x\in X$ the corresponding sequence of stalks $$(\mathcal{F}_1)_x\longrightarrow (\mathcal{F}_2)_x\longrightarrow (\mathcal{F}_3)_x\longrightarrow... $$ is exact. However if the sequence of sheaves is exact than the sequence of global sections is not necessarily exact! (The most famous example is the sequence of sheaves $$0\longrightarrow\mathbb{Z}\hookrightarrow \mathcal{O}\stackrel{\exp}{\longrightarrow} \mathcal{O}^*\longrightarrow0$$ considered as sheaves on $\mathbb{C}-\{0\}$, where $\mathcal{O}$ is a sheaf of holomorphic functions, $\mathcal{O}^*$ is a sheaf of holomorphic functions with no zeros).  So, could you give me some easy examples of such phenomenon ? Why sets of nonzero measure contain almost all the point from Borel-cantelli Leems? Calculus of variations -- how does it make sense to vary the position and the velocity independently? In the calculus of variations, particularly Lagrangian mechanics, people often say we vary the position and the velocity independently. But velocity is the derivative of position, so how can you treat them as independent variables? Compute Engine - 1000 GB disk cant decrease size i have a huuuuge problem.  Created a snapshot and image from my instance...instance has 1000GB of disk.  Now i need to reduce it but everytime i try to create an image or a snapshot from that, i get the same error "Disk need to be at least 1000GB".  There is a way to reduce disk size directly on instance? Some workaround? Is "princessship" a real word? Are there any other words which have the same letter 3 times consecutively? Suppose that, for a real application, I have ended up with a sorted list A = {$a_1, a_2, ..., a_{|A|}$} of elements of a certain kind (say, Type-A), and another sorted list B = {$b_1, b_2, ..., b_{|B|}$} of elements of a different kind (Type-B), such that Type-A elements are only comparable with Type-A elements, and likewise for Type-B.  At this point I seek to count the following: in how many ways can I merge both lists together, in such a way that the relative ordering of Type-A and Type-B elements, respectively, is preserved? (i.e. that if $P_M(x)$ represents the position of an element of A or B in the merged list, then $P_M(a_i)&lt;P_M(a_j)$ and $P_M(b_i)&lt;P_M(b_j)$ for all $i&lt;j$)  I've tried to figure this out constructively by starting with an empty merged list and inserting elements of A or B one at a time, counting in how many ways each insertion can be done, but since this depends on the placement of previous elements of the same type, I've had little luck so far. I also tried explicitly counting all possibilities for different (small) lengths of A and B, but I've been unable to extract any potential general principle in this way. How to make a complete factory reset, without anyone being able to retrieve my data? I will have a few Android phones that I will have to let go.   I would like to make a proper clean wipe of the data, without no one being able to retrieve them, and do a factory reset.  I have read about the , encrypting the device before doing a factory reset, doing both, etc.  Since I am not an Android/adb guru, I would like to know if some of you would have some idea on how to achieve this with certainty.  I know "certainty" is a big word when it comes to proper data erasure on flash memory but still.  I have found some answers here and somewhere else, saying that encrypting and doing a factory reset on your Android device is enough, but I could not find a reliable source.  Just a few information that could be useful:   I'm running Linux as my OS and, therefore, I'm not looking for a Windows-based solution My devices are non-rooted and (almost) identical (Samsung A510F + 1 A510FD) Changing CSV layer attribute value from text to number in QGIS? I read in a CSV file for linking to a .shp file.   All the variables that are just numbers came in as text.   How do I change the text variables to numeric in QGIS? char!=(signed char), char!=(unsigned char) The code below compiles, but has different behavior for the char type than for the int types.  In particular     cout &lt;&lt; getIsTrue&lt; isX&lt;int8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;char&gt;::ikIsX  &gt;() &lt;&lt; endl;   result in 3 instantiations of templates for three types: int8, uint8 and char. What gives?  The same is not true for ints: int and uint32 which result in the same template instantiation, and signed int another.  The reason seems to be that C++ sees char, signed char and unsigned char as three different types. Whereas int is the same as a signed int. Is this right or am I missing something?  #include &lt;iostream&gt;  using namespace std;  typedef   signed char       int8; typedef unsigned char      uint8; typedef   signed short      int16; typedef unsigned short     uint16; typedef   signed int        int32; typedef unsigned int       uint32; typedef   signed long long  int64; typedef unsigned long long uint64;  struct TrueType {}; struct FalseType {};  template &lt;typename T&gt; struct isX {    typedef typename T::ikIsX ikIsX; };   // This  int==int32 is ambiguous //template &lt;&gt;            struct isX&lt;int  &gt;    { typedef FalseType ikIsX; };  // Fails template &lt;&gt;            struct isX&lt;int32  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;uint32 &gt;  { typedef FalseType ikIsX; };   // Whay isn't this ambiguous? char==int8 template &lt;&gt;            struct isX&lt;char  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;int8  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;uint8 &gt;  { typedef FalseType ikIsX; };   template &lt;typename T&gt; bool getIsTrue(); template &lt;&gt;           bool getIsTrue&lt;TrueType&gt;() { return true; } template &lt;&gt;           bool getIsTrue&lt;FalseType&gt;() { return false; }  int main(int, char **t ) {    cout &lt;&lt; sizeof(int8) &lt;&lt; endl;  // 1    cout &lt;&lt; sizeof(uint8) &lt;&lt; endl; // 1    cout &lt;&lt; sizeof(char) &lt;&lt; endl;  // 1     cout &lt;&lt; getIsTrue&lt; isX&lt;int8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;char&gt;::ikIsX  &gt;() &lt;&lt; endl;     cout &lt;&lt; getIsTrue&lt; isX&lt;int32&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint32&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;int&gt;::ikIsX  &gt;() &lt;&lt; endl;  }   I'm using g++ 4.something