Can I use Apple's fonts in my Atom text editor.  seems to suggest I can't. Can anyone confirm this? I know, of course, Apple has no way of finding out if I do. I just don't want to use it if I'm not allowed to.
I thought the new Apple font was called San Francisco, but I cannot find it in the font list of the Keynote.app for my Mac. Is it called another way or it is not available for Keynote?  I am currently using OS X El Capitan.
listing files with pattern with starting and ending I want to list all files in a directory that start with 'abc' and end with '.zip'  I'm trying to use ls.  The directory has a lot of zip files starting with abc&lt;date&gt; and xvz&lt;date&gt;. I only want to get the list of the abc&lt;date&gt;.zip Node Package Manager got corrupted in some way, now it cannot be installed Creating point features with exact coordinates in QGIS Two arrays in foreach loop bash: /usr/bin/locale-check: No such file or directory error after i downgraded from ubuntu 18.10 to 18.04 I want to mount the device /dev/sda3 to the directory /foo/bar/baz. After mounting the directory should have the uid of user johndoe. So I did:  sudo -u johndoe mkdir /foo/bar/baz stat -c %U /foo/bar/baz johndoe   and added the following line to my /etc/fstab:  /dev/sda3 /foo/bar/baz ext4 noexec,noatime,auto,owner,nodev,nosuid,user 0 1   When I do now sudo -u johndoe mount /dev/sda3 the command stat -c %U /foo/bar/baz results in root rather than johndoe. What is the best way to mount this ext4-filesystem with uid johndoe set? Instantiating object of type parameter How can I upgrade Ubuntu LTS to the next one offline? I'm using Ubuntu 12.04 on my computer and I want to upgrade to Ubuntu 14.04.  I do not have internet at home, so I need to do the upgrade offline.  On openSUSE there a way to make the upgrade offline simple and effective way is by using  the iso DVD.  My question is: Is there any way to make Ubuntu upgrade offline as in openSUSE ? How to test a power supply? My computer powered off the other day on its own, and now when I push the power button, nothing happens. My assumption would naturally be that the power supply is done (possibly well done) but is there any good way to test this before I buy a new one? How can I access and process nested objects, arrays or JSON? remote action function encountering CPU time out limit exception CPU time out limit was being hit while processing child records on the inline opportunity visualforce page, to handle this i wrote a remoteActionFunction on the page that invokes controller method that's taking long to process and when i get CPU LIMIT exception in the result, i am invoking javascript call back function that invokes a action function which handles the same code asynchronously(@future).  Question: by setting the timeout (Visualforce.remoting.timeout = 120000;) can't we overcome CPU TIME out limit of 10,000 ms. In Data Extension one field 'HTML' have Data that I have shown below, Now I have to Find the 'Href', and and at the last of URL append some text like '&amp;MC='. It may have Multiple 'Href'. Please help me on this.   &lt;table width="540" style="margin: 0px; padding: 0px;" bgcolor="#ffffff" border="0" cellspacing="0" cellpadding="0"&gt;  &lt;tbody&gt;   &lt;tr&gt;    &lt;td valign="top"&gt;    &lt;h5 style="margin: 0px; padding: 0px 0px 2px; line-height: normal; font-family: &amp;quot;Segoe UI&amp;quot;, &amp;quot;Lucida Grande&amp;quot;, Verdana, Arial, Helvetica, sans-serif; font-size: 16px; font-weight: normal;"&gt;    &lt;a style="text-decoration: none;" href="https://test.4.com/testRegistration/testLobbyServlet?target=reg20.jsp&amp;eventid=897605&amp;sessionid=1&amp;key=2F3D1EB963D9DB7738BF2877DFFDBA01&amp;partnerref=Social&amp;sourcepage=register&amp;loc=zOTlocz&amp;prod=zWAz&amp;tech=zsecz&amp;prog=zOTprogz&amp;type=zOTtypez&amp;media=zWCz&amp;country=zUSz" alias="Success with Enterprise Mobility: Making email and Office 365 secure on mobile devices"&gt;    Success with Enterprise Mobility: Making email and Office 365 secure on mobile devices     &lt;/a&gt;    &lt;/h5&gt;    &lt;p style="margin: 0px; padding: 0px; line-height: 20px; font-family: &amp;quot;Segoe UI&amp;quot;, &amp;quot;Lucida Grande&amp;quot;, Verdana, Arial, Helvetica, sans-serif; font-size: 12px; font-weight: normal;"&gt;    &lt;span style="color: rgb(103, 103, 103);"&gt;    &lt;em&gt;December 9, 2014, 10:30 A.M.&amp;ndash;11:30 A.M. Pacific Time&lt;/em&gt;&lt;br&gt;    An enterprise mobility strategy involves identity, management, and productivity. In this session featuring Brad Anderson, you will learn about the integration and the Office mobile apps while enabling secure mobile productivity.    &lt;/span&gt;    &lt;/p&gt;    &lt;/td&gt;   &lt;/tr&gt;   &lt;tr&gt;    &lt;td valign="top"&gt;&amp;nbsp;    &lt;/td&gt;   &lt;/tr&gt;   &lt;tr&gt;    &lt;td valign="top"&gt;    &lt;h5 style="margin: 0px; padding: 0px 0px 2px; line-height: normal; font-family: &amp;quot;Segoe UI&amp;quot;, &amp;quot;Lucida Grande&amp;quot;, Verdana, Arial, Helvetica, sans-serif; font-size: 16px; font-weight: normal;"&gt;    &lt;a style="text-decoration: none;" href="http://test.TTr.com/?Wt.mc_id=IG15W2NWTN&amp;loc=zOTlocz&amp;prod=zWAz&amp;prod=zWSz&amp;tech=zCLz&amp;prog=zOTprogz&amp;type=zEVz&amp;media=zOTmediaz&amp;country=zUSz" alias="Test: Everything about enterprise technology under one roof"&gt;    Test: Everything about enterprise technology under one roof    &lt;/a&gt;    &lt;/h5&gt;    &lt;p style="margin: 0px; padding: 0px; line-height: 20px; font-family: &amp;quot;Segoe UI&amp;quot;, &amp;quot;Lucida Grande&amp;quot;, Verdana, Arial, Helvetica, sans-serif; font-size: 12px; font-weight: normal;"&gt;    &lt;span style="color: rgb(103, 103, 103);"&gt;    &lt;em&gt;May 4&amp;ndash;8, 2015, Chicago, IL&lt;/em&gt;&lt;br&gt;    If you&amp;rsquo;re serious about technology, you don&amp;rsquo;t want to miss Test. This event will be the intersection of everything in enterprise technology. Get ahead in your job and your career.    &lt;/span&gt;    &lt;/p&gt;    &lt;/td&gt;   &lt;/tr&gt;  &lt;/tbody&gt; &lt;/table&gt; Strong Induction Proof: Fibonacci number even if and only if 3 divides index The Fibonacci sequence is defined recursively by $F_1 = 1, F_2 = 1, \; \&amp; \; F_n = F_{n−1} + F_{n−2} \; \text{ for } n ≥ 3.$ Prove that $2 \mid F_n \iff 3 \mid n.$   Proof by Strong Induction : $\bbox[5px,border:1px solid green]{\color{green}{n = 1 }}$ $2 \mid F_1$ is false. Also, $3 \mid 1$ is false. The implication [False $\iff$ False] is vacuously true.  $\bbox[5px,border:1px solid green]{\color{green}{\text{Induction Hypothesis}}}$ Assume that $2 \mid F_i \iff 3 \mid n$ for every integer $i$ with $1 ≤ i ≤ k$.  $\bbox[5px,border:1px solid green]{\color{green}{k + 1 \text{th Case}}} \;$  To prove:  $\quad 2 \mid F_{k + 1} \iff 3 \mid k + 1.$   $\bbox[5px,border:1px solid green]{\color{green}{n = k + 1 = 2}} \;$ $2 \mid F_2$ is false. Also, $3 \mid 2$ is false. So [False $\iff$ False] is vacuously true.  Hence assume that $k + 1 ≥ 3.$ We now consider three cases:  $\bbox[5px,border:1px solid green]{\color{green}{\text{Case 1: } k + 1 = 3q}}$ Thus $3 \require{cancel}\cancel{\mid} k$ and $3 \require{cancel}\cancel{\mid} (k − 1)$. By the ind hyp, $3 \require{cancel}\cancel{\mid} k    \iff F_k$ odd &amp; $3 \require{cancel}\cancel{\mid} (k − 1) \iff F_{k - 1}$ odd. Since $F_{k+1} = F_k + F_{k−1}$, thus $F_{k+1}$ = odd + odd = even.  $\bbox[5px,border:1px solid green]{\color{green}{\text{Case 2: } k + 1 = 3q + 1}}$  Thus $3 | k$ and $3 \require{cancel}\cancel{\mid} (k − 1).$ By the ind hyp, $3 | k \iff F_k$ even &amp; $3 \require{cancel}\cancel{\mid} (k − 1) \iff F_{k - 1}$ odd. Thus $F_{k+1}$ odd.  $\bbox[5px,border:1px solid green]{\color{green}{{\text{Case 3: }} k + 1 = 3q + 2}}$ Thus $3 \require{cancel}\cancel{\mid} k$ and $3 | (k −1).$ By the ind hyp, $3 \require{cancel}\cancel{\mid} k \iff F_k$ odd and $3 \mid (k − 1) \iff F_{k - 1}$ even. Thus $F_{k+1}$ odd. $\blacksquare$  $\Large{1.}$ Does the proof clinch the $(\Leftarrow)$ of the $(k + 1)$th case?   $\Large{2.}$ Since the recursion contains $n, n - 1, n - 2$, thus the recursion "time lag" is $3$ here. So shouldn't $3$ base cases be checked?   $\Large{3.}$ Further to #2, shouldn't "assume $k + 1 \geq \cancel{3} 4$" instead?   $\Large{4.}$ Shouldn't the $n = k + 1 = 2$ case precede the induction hypothesis?  I referenced . Source: Exercise 6.35, P152 of Mathematical Proofs, 2nd ed. by Chartrand et al    Supplement to peterwhy's Answer:  $\Large{1.1.}$ I wrongly believed that all 3 Cases proved the $\Leftarrow$. I now see that Case 1 is $\Leftarrow$ via a Direct Proof. Cases 2 and 3 are $\Rightarrow$ via a Proof by Contraposition. Nonetheless, how would one foreknow/prevision to start from $3 \mid n$  for both directions of the proof? What white point temperature should I set my LCD monitor to? I've got the Xrite Eye One Display 2, and tried the advanced calibration today for the first time.  It asked what white point I wanted, and had a default of 6500K.  I didn't realize that was up for discussion!  I would have assumed the daylight temperature, around 5500K, would be desired.  What temperature do I want my whites to be? Why can't white just be white?! Why did Palpatine wait so long before giving Order 66? How can I use sed to replace a multi-line string? I've noticed that, if I add \n to a pattern for substituting using sed, it does not match. Example:  $ cat &gt; alpha.txt This is a test Please do not be alarmed  $ sed -i'.original' 's/a test\nPlease do not/not a test\nBe/' alpha.txt  $ diff alpha.txt{,.original}  $ # No differences printed out   How can I get this to work? Finding the number of zeros of $f(z) = z^n$ if $|f(z)| < 1 $ for all $z$ with $|z|=1$. Suppose $f: \overline{\mathbb{D}} \to \mathbb{C}$ is continuous, analytic in $\mathbb{D}$ and satisfies $|f(z)|&lt;1$ for $|z|=1$. Find the number of solutions to the equation $f(z) = z^n$ where $n$ is a positive integer. ($\mathbb{D}$ is the unit disk).  Some of my own attempts: Using the Maximum/Minimum Principle, we can split up the the problem in $2$ parts: Suppose $f$ is constant. It then holds that $z^n = c$ has exactly $n$ zeros because of the fundamental theorem of algebra.  Suppose $f$ is not constant. It holds that $f$ has at least one zero  in $\mathbb{D}$. It of course also holds that $z^n$ has a zero of multiplicity $n$ at the origin. I think I'm supposed to hit with stuff like Rouché's theorem, the Argument Principle or Schwartz lemma, but nothing seems to fit.   Thanks in advance. Past participle vs being+past participle Suppose my speed is normally 30 feet. I get hit with a Slow spell, reducing my speed to 15 feet, and then I get knocked prone. How many feet of movement do I need to spend in order to stand back up from prone? How many feet of movement do I have left over once I've stood up?  What if I am also hit with a Ray of Frost spell while slowed, reducing my speed to 5 feet for 1 round? Am I able to stand up at all? Calculating p-values for two tail test for population variance A sporting goods manufacturer claims that the variance of string tensions for any decent tennis racquet should be about 9 pounds. The string tensions of 18 randomly selected tennis racquets produced a variance of 8.13 pounds. Find the p-value to test the manufacturer's claim (assume the population is normally distributed).  I tried attempting the question as follows: ${H_o}: {\sigma ^2} = 9$ ${H_1}: {\sigma ^2} \ne 9$ We are also given the following: $n=18$ $s^2 = 8.13$ Test Statistics: $\chi^2 = {{(n-1)S^2}\over{\sigma^2}}$ Calculating Test Statistics under $H_o$ gives us: $\chi^2 = {{(18-1)8.13}\over 9} = 15.35667$  For calculating the p-value I proceeded as follows: $p-value = 2\min\{P[\chi^2&gt;15.35667],\ P[\chi^2&lt;15.35667]\}\ =2\times 0.430192 = 0.860384$  I am not certain if my method for calculating the p-value is correct or not. Can someone please tell if the above process is valid?  Thanks in advance!