Ubuntu OS install in Android Mobile device using ubuntu-device-flash
What hardware does Ubuntu Touch support?
Finding a pair of functions with properties I need to find a pair of functions $f$, $g$ such that    $f$ is not differentiable at  $x = 0$ $g$ is not differentiable at $f(0)$ $g \circ f$ is differentiable at $x = 0$   I've tried a lot of functions but just can't seem to find ones that work. Any help would be appreciated, thank you. Shine a light into a superconductor A type-I superconductor can expel almost all magnetic flux (below some critical value $H_c$) from its interior when superconducting. Light as we know is an electromagnetic wave. So what would happen if we shine a light deep into a type-I superconductor? Suppose the magnetic field of the light is significantly lower than $H_c$.  And what about type-II superconductors? Does ReLU layer work well for a shallow network? Using the same code behind file for multiple .aspx pages When Bottom Navigation Isn't Best I'm developing a mobile app and dealing with various UI/UX issues. I'm open to all kinds of ideas at this stage, however some designers I consult with seem to be zealots for bottom-navigation and are hesitant in actually analyzing whether the bottom-nav is actually best for my app; they just want me to use the bottom tabs navigation as if it's some UI law.  One point I try to bring up is that my business model has users who aren't typical one-handed mobile users, are tech savvy, would use my app more of a tool, and would spend only a few minutes in it. The app isn't a typical lazy-content-browsing experience where you want to minimize fingers-over-top-of-screen interference, and where you want to keep the use transfixed and spending time in the app.  Anyways, I'd like to hear about situations where a bottom nav was decided-on, or started-with, and you had good reason to eliminate it and go with another navigation design.  Most articles out there talk about eliminating hamburger menus and diving into bottom nav. Is the converse simply going back to hamburger menu? Re-install Ubuntu without losing data in home folder What does the operator "<<" mean in C#? `lmodern` package reduces the size of automatically sized delimiters in math mode I want to get random decimal digits out of a 6-faced die.  Let's say the die is fair, with an equal probability for each outcome. (But feel free to share any consequences of that not being true, if you feel like it.)  I will represent the outcome of a die roll as a base-6 number:   In base-6 there are only 6 possible digits: $\{0,1,2,3,4,5\}$. The die has faces numbered 1 to 6. Face $f$ corresponds to digit $f-1$.   Thus, I can represent as many die rolls as I like with a base-6 number:   If the die is rolled once:   Let's say the die stopped on face $5$. The final base-6 number will be $4$.  If the die is rolled twice:   Let's say the die stopped on face $5$. And then on face $3$. The final base-6 number will be $42$.  If I roll the dice 10 times:   Let's say the die stopped sequentially on faces $5$, $3$, $4$, $6$, $2$, $3$, $3$, $3$, $2$, and $4$. The final base-6 number will be $4235122213$.    Since I want decimal digits, I need to convert to base-10.   Base-6: $4235122213$ Base-10: $44753985$   For any given number of die rolls, how many different combinations exist? If there are $r$ die rolls, the total of possible combinations is $6^r$.   $r$ rolls — $6^r$ different combinations. $0$ rolls — only $1$ combination. $1$ roll — $6$ different combinations. $2$ rolls — $36$ different combinations. $3$ rolls — $216$ different combinations. $4$ rolls — $1296$ different combinations. $5$ rolls — $7776$ different combinations. $6$ rolls — $46656$ different combinations. $7$ rolls — $279936$ different combinations. $8$ rolls — $1679616$ different combinations. $9$ rolls — $10077696$ different combinations.   $n_r$ ($\in \mathbb{N_0}$) is the number obtained after $r$ die rolls through the process described previously: "If the die is rolled once, twice, ..."  It is impossible for $n_r$ to reach the number of possible different combinations ($6^r$). It will be always short by least $1$:  $$ 0 \leqslant n_r &lt; 6^r $$   $r$ rolls — $n_r$ never surpasses $6^r-1$. $0$ rolls — $n_r$ never surpasses $0$. $1$ roll — $n_r$ never surpasses $5$. $2$ rolls — $n_r$ never surpasses $35$. $3$ rolls — $n_r$ never surpasses $215$. $4$ rolls — $n_r$ never surpasses $1295$. $5$ rolls — $n_r$ never surpasses $7775$. $6$ rolls — $n_r$ never surpasses $46655$. $7$ rolls — $n_r$ never surpasses $279935$. $8$ rolls — $n_r$ never surpasses $1679615$. $9$ rolls — $n_r$ never surpasses $10077695$.   I can never trust the leftmost nor the rightmost digit (fringe digits), since the possible values are potentially restricted.   For $0$ rolls, the outcome is always $0$. For $1$ roll, the fringe digit never surpasses $5$. For $2$ rolls, the leftmost digit never surpasses $3$, and the rightmost, $5$. For $3$ rolls, the leftmost digit never surpasses $2$, and the rightmost, $5$. For $4$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$. For $5$ rolls, the leftmost digit never surpasses $7$, and the rightmost, $5$. For $6$ rolls, the leftmost digit never surpasses $4$, and the rightmost, $5$. For $7$ rolls, the leftmost digit never surpasses $2$, and the rightmost, $5$. For $8$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$. For $9$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$.   The other digits seem perfectly random to me though. Am I wrong? I'm trying to continue the numbering of examples in enumerate environments in beamer. For example, I'd like one slide to feature   Foo Bar   and the next slide   Zip Yadda   My strategy so far has been to define a counter that saves the enumerate counter at the end of the first environment and can then be queried to set the enumerate counter at the start of the second enumerate environment. (This is essentially the proposal also found at )  That works wonderfully so long as I don't try to uncover elements of the slide sequentially. The problem, of course, is that as each of the pdf-pages that make up the slide is created, the counter is advanced. Here's a MWE.  \documentclass{beamer}  \setbeamercovered{highly dynamic}  \newcounter{saveenumi} \newcommand{\seti}{\setcounter{saveenumi}{\value{enumi}}} \newcommand{\conti}{\setcounter{enumi}{\value{saveenumi}}}   \begin{document}  \begin{frame}[&lt;+-&gt;]   \begin{enumerate}   \item foo   \item bar%     \seti   \end{enumerate} \end{frame}  \begin{frame}[&lt;+-&gt;]   \begin{enumerate}     \conti   \item zip   \item yadda%     \seti   \end{enumerate} \end{frame}  \end{document}   As the second slide is progressively uncovered (pages 3 and 4 of the resulting PDF), the counter at the beginning of the enumerate environment is advanced each time. So page 3 of the PDF has the right numbering, (3) and (4) respectively, while the fully revealed page has the wrong numbering. Pictures follow:   on one of the slides    on the following one How do I prove equality of x and y? If $0\leq x,y\leq\frac{\pi}{2}$ and $\cos x +\cos y -\cos(x+y)=\frac{3}{2}$, then how can I prove that $x=y=\frac{\pi}{3}$? Your help is appreciated.I tried various formulas but nothing is working. I'm wondering how it is correct to structure sentence and what punctuation should be used. In particular, is the next sentence correct:     I was wondering if there's any progress on the issue.    Or should I put a question mark in the end of it. Also, can it be restructured to:     I was wondering: is there any progress on the issue? What are the norms in Ito isometry? Itō isometry from :     Let $W : [0, T] \times \Omega \to \mathbb{R}$ denote the canonical   real-valued Wiener process defined up to time $T &gt; 0$, and let $X :  [0, T] \times \Omega \to \mathbb{R}$ be a stochastic process that is   adapted to the natural filtration $\mathcal{F}_{*}^{W}$ of the Wiener   process. Then $$      \mathbb{E} \left[ \left( \int_{0}^{T} X_{t} \, \mathrm{d} W_{t} \right)^{2} \right] = \mathbb{E} \left[ \int_{0}^{T} X_{t}^{2} \,  \mathrm{d} t \right], $$ where $\mathbb{E}$ denotes expectation with   respect to  $\gamma$. In other words, the Itō   stochastic integral, as a function, is an isometry of normed vector   spaces with respect to the norms induced by the inner products $$      ( X, Y )_{L^{2} (W)} := \mathbb{E} \left( \int_{0}^{T} X_{t} \, \mathrm{d} W_{t} \int_{0}^{T} Y_{t} \, \mathrm{d} W_{t} \right) =  \int_{\Omega} \left( \int_{0}^{T} X_{t} \, \mathrm{d} W_{t}  \int_{0}^{T} Y_{t} \, \mathrm{d} W_{t} \right) \, \mathrm{d} \gamma  (\omega) $$ and $$      ( A, B )_{L^{2} (\Omega)} := \mathbb{E} ( A B ) = \int_{\Omega} A(\omega) B(\omega) \, \mathrm{d} \gamma (\omega). $$   I was wondering what the two normed spaces are and what their norms are, so that the two normed spaces are isometric wrt their norms?  Thanks and regards! Text highlighting in revisions is wrong For example, when watching revision 2 in  in the side-by-side mode, word "answer" marked as deleted on the left hand side and as added again on the right hand side:        If we switch to the side-by-side markdown mode no "answer" word is highlighted at all (correctly): How to prove sum of powers property of roots of unity? We know that $1+\alpha_1+\alpha_2+...+\alpha_{n-1}=0$ where $\alpha_i$ are the roots of $z^n=1$. How can I prove that: $$1+\sum_{i=1}^{n-1}\alpha_i^m=\begin{cases}0\quad m\in Z,m\not\equiv0\pmod n\\n\quad m\in Z,m\equiv0\pmod n\\\end{cases}$$ What are the basics of commands in Minecraft Java Edition? Does anyone know where I can find cheat codes for Goldeneye 007 Wii? I know that the game hasn't even been out for a week, but does anyone know if any cheat codes have been released by Activision yet?  I know that they must exist since there is a cheat codes menu within the game. Finding Command-Line Arguments of Programs I know that unix has man pages, but is there a place I can look to discover command-line arguments of programs? Going to command prompt and typing notepad /? doesn't give anything. I have some HTML I am trying to parse.  There are cases where the html attributes alone are not going to help me identify the row type (header versus data).  Fortunately, if my row is a data row then it should have some values that can be converted to integers.  I have figured out how to convert the unicode to an integer for those cases that it is possible to make the conversion.  I am struggling to write the logic to move past the cells that the conversion will not work because the cell has content that must be treated as text.  for example if rowColumn[1][3] can be converted to an integer I can do so by   int(rowColumn[1][3].replace(',','').strip('$'))   but I get an error if rowColumn[1][3] has text content. root folder access via gui I'm new to linux and the terminal. As I learn how to use the terminal to navigate through directories, I like to use the gui file explorer to mirror my terminal navigation. The icons and file extension info in the gui file explorer help me figure out what everything is. However, I can't access the root folder via the gui, I can only access it via the terminal. Is there a way to enable access to the root folder outside of the terminal?