Is 110 degrees fahrenheit on average bad on a 2019 MacBook Air? (And other problems)
CPU Die temperatures reaches 90° C, is that normal?
How do I rename all folders and files to lowercase on Linux? Where can I find the teleport? I need to get the chocolate bars in the hole, but I can't get out of there. Where can I find the pogo stick or teleport? I may have missed it with the 3D, but I could have sworn I saw what I suspect was a lady Dwarf or two running from the Erebor in the beginning of the Hobbit, but they didn't seem bearded.    If dwarf women aren't bearded, then was Aragorn just kidding in the Two Towers (movie) when he intimated that they all had beards?    It's also stated by Tolkien in appendix A to The Lord of the Rings that female dwarves appear identical to males and we can assume they are also born with beards, just like their male counterparts. dpkg: error: parsing file '/var/lib/dpkg/updates/0045' near line 0: How do I get resolvconf to regenerate resolv.conf after I change /etc/network/interfaces? After updating /etc/network/interfaces with something very similar to below, how do I get /etc/resolv.conf to update?  I tried (as root) resolver -u, service networking restart but they didn't work. I also fixed the symlink for resolv.conf and tried resolver -u again. Finally in frustration I rebooted, which did fix the problem by rebuilding /etc/resolv.conf.  Ubuntu 12.04, 64bit server, all the latest patches installed.  Example /etc/network/interfaces:  iface eth0 inet static     address 192.168.3.3     netmask 255.255.255.0     gateway 192.168.3.1     dns-search example.com     dns-nameservers 192.168.3.45 192.168.8.10 $\LaTeX$ and Mathematica prevent php classes from being extends Show that $\lim\limits_{a \to 0^+} \int^1_0 ax^{a−1}f(x)dx=f(0)$. Suppose $f$ is Riemann integrable on $[0,1]$ and continuous at 0. Show that $$\lim\limits_{a \to 0^+} \int^1_0 ax^{a−1}f(x)dx=f(0).$$   Can anyone share some insight on this one? I have no idea where to begin. Maybe a substitution? Find the value of $\sum_0^n \binom{n}{k} (-1)^k \frac{1}{k+1}$ Find the value of $\sum_0^n \binom{n}{k} (-1)^k \frac{1}{k+1}$.  Writing out several terms, I think the answer is $1/(n+1)$, but I'm struggling to prove this. I would greatly appreciate it if someone could show how to prove this. List only regular files (but not directories) in current directory What makes RSA secure by using prime numbers? I am just learning about the RSA algorithm. Looking at the first two steps:   Choose two distinct prime numbers $p$ and $q$. Compute $n = pq$.    I have some probably stupid questions:   Why do $p$ and $q$ have to be prime numbers? Why couldn't they be any integers or odd integers? Or does that break the whole algorithm? Because prime numbers are rare in comparison to regular integers, does restricting the algorithm to only prime numbers reduce security? It would seem easier to find the private key if an attacker knows it's only going to be some prime number? How to disable all caches in safari 11? How can a function with a hole (removable discontinuity) equal a function with no hole? I've done some research, and I'm hoping someone can check me. My question was this:  Assume I have the function $f(x) = \frac{(x-3)(x+2)}{(x-3)}$, so it has removable discontinuity at $x = 3$. We remove that discontinuity with algebra: $f(x) = \frac{(x-3)(x+2)}{(x-3)} = (x+2)$. BUT, the graph of the first function has a hole at $x = 3$, and the graph of the second function is continuous everywhere. How can they be "equal" if one has a hole and the other does not?  I think that this is the answer:   Because the original function is undefined at the point $x = 3$, we have to restrict the domain to $\mathbb{R} \setminus 3$. And when we manipulate that function with algebra, the final result, $f(x) = (x + 2)$ is still using this restricted domain. So even though the function $f(x) = (x+2)$ would not have a hole if the domain were all of $\mathbb{R}$, we are sort of "imposing" a hole at $x = 3$ by continuing to throw that point out of the domain.   And then just to close the loop: Removing the removable discontinuity is useful because it allows us to "pretend" that we're working with a function that is everywhere continuous, which helps us easily find the limit. But the reality is that the function $f(x) = (x +2)$ is actually NOT continuous everywhere when we restrict the domain by throwing out the point 3. Or am I now taking things too far?   Thanks in advance!  EDIT: For anyone coming across this in the future, in addition to the excellent answers below, I also found this other question about the  helpful. How do I avoid the "S to Skip" message on boot? How do you do a deep copy of an object in .NET? I want a true deep copy. In Java, this was easy, but how do you do it in C#? The  is the stuff of legend () and is . My question is two-fold, really: Is the Golden Ratio really a good tool used in modern design (defined here as 20th century on forward), and if so, how often is it used outside of the aforementioned known uses?  EDIT: To @e100's first comment, examples of modern use of the Golden Ratio would be a great thing to add here if there any documented or arguably conclusive uses of it. I have a corrupt tarball on my hands. My first attempt at recovery went like this:  $ tar --ignore-failed-read --ignore-command-error -xf tarball.tar tar: Skipping to next header tar: Archive contains ‘180738 0’ where numeric mode_t value expected tar: Archive contains ‘0.445647 -9.’ where numeric time_t value expected tar: Archive contains ‘.259273 ’ where numeric uid_t value expected tar: Archive contains obsolescent base-64 headers tar: Archive contains ‘-0.94874’ where numeric gid_t value expected tar: text from a text file is here: implausibly old time stamp 1969-12-31 18:59:59 tar: more text file contents are here: Unknown file type 'p', extracted as normal file tar: Skipping to next header tar: Skipping to next header tar: Exiting with failure status due to previous errors   This didn't extract much from the tarball before erroring out. The exit status is 2 which the tar man page says is a fatal error.  The documentation for "" suggested this:  cpio -F tarball.tar -i -v   This extracted 1.2G of a 1.8G tarball, which is pretty good. It stops with a bunch of garbage entered after the terminal prompt -- it isn't printed to the screen, it's as if I had typed it and didn't hit return yet.  Is there a way to do any better? Is there a way to try and "jump over the bad chunks" of the tarball?  With --ignore-zeros tar seems to be reading through the entire tar file.  tar -R --ignore-failed-read --ignore-command-error --ignore-zeros -xvf tarball.tar [...] block 3670356: ** Block of NULs ** block 3670357: ** Block of NULs ** block 3670358: ** Block of NULs ** block 3670359: ** End of File ** tar: Exiting with failure status due to previous errors   There are a lot of Block of NULs errors so it looks like the contents might be irretrievable. How can I suppress all output from a command using Bash? I have a Bash script that runs a program with parameters.  That program outputs some status (doing this, doing that...). There isn't any option for this program to be quiet. How can I prevent the script from displaying anything?  I am looking for something like Windows' . When should I use Inline vs. External Javascript? I would like to know when I should include external scripts or write them inline with the html code, in terms of performance and ease of maintenance.  What is the general practice for this?  Real-world-scenario - I have several html pages that need client-side form validation. For this I use a jQuery plugin that I include on all these pages. But the question is, do I:   write the bits of code that configure this script inline? include all bits in one file that's share among all these html pages? include each bit in a separate external file, one for each html page?   Thanks. I need some help with the exercise I was assigned in math class. We were given a 3x3 square made of unit squares, and we wanted to paint all the squares. We had 3 sets of paint, red, blue, and green. Each paint was distinct from each other, but two unit squares with the same color were the same. Additionally, there's only enough paint of each color to color 3 unit squares, and all the paint has to be used. The goal of the exercise was to find the total amount of distinct possible ways such that no two unit squares that share an edge (that is to say they are next to each other vertically or horizontally, having same color across a diagonal is fine). I've started by trying to take a look at each possible arrangement of the bottom 3 unit squares, but I can't seem to find a pattern between it. Is there a better way than continuing by brute force? Any ideas on how I should proceed from here?