Is it ok to use this font freely in a website you're creating for a school in the UK?
Basically I would like to use on website a "Norasi" font, that was bundled with Ubuntu, but I cannot find any license. Am I allowed to distribute that font through website? What is its license?
Disable the guest user completely in El Capitan without having to disable 'Find My Mac' I know it should be straight forward but unfortunately, it  isn't.  I did disable the guest user in the System Preferences by unchecking the checkbox for Allow guests to login in to this computer, but it still shows up on the login screen.  I have heard that disabling 'Find My Mac' would fix it for OS X Lion, but I want to keep it.  Is there a way to do this? My thinking:    acceleration corresponds to a force which is instantaneous, so the acceleration of a rigid body can be rather spiky (non-smooth) velocity (angular velocity) describes the ratio of change of the distance(angle), so it is smooth in the real world.   Conclusion, it makes sense to  (e.g., simple averaging) a velocity signal (temporal velocity), but it does not make so much sense to do smoothing on acceleration signal. Am I right? factorization of a^n+1? I'm trying to prove that $a^n+1$ can only be prime if $n$ is a power of $2$. Is there a general factorization of $a^n+1$? Question:      Let $p$ be any prime and $n \geq 3$. Show that there exists a non-abelian group of order $p^n$.    Attempt:   Take $n = 3$. Writing $\mathbb Z_p \times \mathbb Z_p = \{e, \alpha_1, \ldots, \alpha_{p^2 - 1}\}$ and considering $$\begin{align}\tau_{jk} : \mathbb Z_p \times \mathbb Z_p&amp;\to \mathrm {Aut} (\mathbb Z_p)\,\\e &amp;\mapsto id\\\alpha_j &amp;\mapsto id \\\alpha_i &amp;\mapsto \rho_k  \end{align}$$  $\forall i \neq j$ where $\rho_k : \mathbb Z_p \to \mathbb Z_p$ is such that $\rho_k (1) = k$, with $k \in \{2, \ldots, p-1\}$. Then we take the group $(\mathbb Z_p \times \mathbb Z_p) \ltimes_{\tau_{jk}} \mathbb Z_p$.   Then $$(\alpha_i , 2) \ltimes_{\tau_{jk}} (\alpha_i, 1) = (2\alpha_i, 1  + \tau_{jk} (\alpha_i)(2)) = (2\alpha_i , 1  +2 k)$$  and $$(\alpha_i , 1) \ltimes_{\tau_{jk}} (\alpha_i, 2) = (2\alpha_i, 1  + \tau_{jk} (\alpha_i)(2)) = (2\alpha_i , 1  +k)$$  taking $k = 1$ for example we have that the group $(\mathbb Z_p \times \mathbb Z_p) \ltimes_{\tau_{jk}} \mathbb Z_p$ is not abelian.    I was wondering if this is a good aproach. If not, is there an easier way to reach the result?  If this is the "best" way then would the higher cases ($n &gt; 3$) be more of a notation play game? What are the rules for China's visa-free transit programs? Assuming one wants to travel through China, what are the rules for visa-free access? To be more specific:   How does the 24-hour visa free transit work? How does the 72-hour version work? What does a person ineligible for either of these programs have to do to transit China? Do the programs apply to flights only or do they also work for transit on land? Would a visitor save much hassle by using visa free transit instead of just getting a visa?      NB: this is intended as a canonical question on transiting China How to set default style for arrow tips in TikZ? Composition of two Riemann integrable functions Stochastic processes book suggestions. I would like to find a book that introduces me gently to the subject of stochastic processes without sacrificing mathematical rigor. It would be great if the book has lots of examples and that the book is designed for undergraduates. Just like how there are rigorous undergraduate abstract algebra books (I am thinking of GAllian's contemporary modern algebra here).   I already studied measure theory, and prob. theory.  Thank you. How do I use Drush 8 site aliases in Drush 9? If sup A $\lt$ sup B show that an element of $B$ is an upper bound of $A$ (a) If sup A &lt; sup B, show that there exists an element of $b \in B$ that is an upper bound for $A$.  I have argued that if sup A $\lt$ sup B, then choose an $\epsilon&gt;0$ such that sup A +$\epsilon \in B$. Since $a \le $ sup A for all $a \in A$, it follows $a \lt $ sup A + $\epsilon$ hence sup A + $\epsilon $ is an upper bound of A as well as an element of B.  (b) Give an example to show that this is not always the case if we only assume sup A $\le$ sup B.  I am having trouble extending my argument into an example which makes me think that it may not be correct.   Question: Is my argument for (a) correct? If not how would one show this fact? Can you give an example asked for in (b)? Thanks in advance.  I need to understand how I am assuming what I am supposed to prove in my approach. Can someone elaborate on that please? The other question doesn't really address this issue. Show that a group of order $180$ is not simple. Why does the classical path give the dominant contribution in the path integral? Characterization convex function. Resolve the error "An illegal choice has been detected..." What can an app do with the "USE ACCOUNTS ON THE DEVICE" permission? Can such an app freely read my emails/calendar/message/docs/etc.?  The "USE ACCOUNTS ON THE DEVICE" permission is also known for developers as .  Example of such apps: , . Difference of the \dots* Show that $\mathbb{Q}\times \mathbb{Q}$ is denumerable I am new to functions and relations, and with some concepts I am not so familiar. I have a question in an homework:     Show that $\mathbb{Q} \times\mathbb{Q}$ is denumerable.   From what I understood, denumerable means that it is infinitively countable. There are some  on the web about this topic, but I am still not understanding their explanation, maybe because they are not explained so easily (for me).  From what I understood, a set is denumerable if there's a relation with the natural numbers (but I am still not understanding what is this relation).  I have heard also about equinumerous sets (contain a bijective function = onto + one-to-one function), but I cannot relate this information with the problem to try to solve it. To flag or not to flag question that don't show own effort? I am a little confused about what do with questions that are just asking      "I want this and that (...) and I want it to look exactly like that   (...) please help"   without showning ANY own effort?  According to  those kind of answers are not welcome  also the  says those questions should not be asked:     Don't ask about...   Questions you haven't tried to find an answer for (show your work!)   But does this mean that I should flag those kind of "helpdesk" questions or not? And if yes as what? low quality ? flag for moderator attention ? Or is just adding a kind comment asking for the asker's own attempts enough? Why does this intentionally incorrect use of strcpy not fail horribly? If we disbelieve $H_0$, why quote a p value calculated assuming $H_0$ was true? Hypothesis testing seeks to reject a null hypothesis ($H_0$) on the basis of an assumption made about the sample following a certain distribution. This assumption is conditional on $H_0$ being true. So what is the flaw with the following reasoning?     If I reject $H_0$ in favor of the alternative hypothesis ($H_1$), I   must then assume that (1) $H_1$ is true, and (2) that at the   same time the variable under examination follows the distribution   used to reject $H_0$. Since we also stated that the assumed   distribution is conditional on $H_0$ being true, it appears that $H_0$   has got to be true in order to justify the assumption made about the   distribution. Logically, it would therefore seem that both $H_0$ and   $H_1$ have to be true, which is a paradox, because they are mutually   exclusive!