Shortcuts on my desktop?
How to avoid using sudo when working in /var/www?
Ubuntu 20.04 Font and UI elements too big on login I'm running Ubuntu 20.04 on an ASUS X99-E-10G WS w/ an NVIDIA 1080Ti and an LG 4k 32&quot; monitor which persistently gets recognized as 27&quot;. When I log in, the text of certain UI elements is ~2x the normal size. After I go to settings/universal access and turn large text on and then off again, everything is the normal size I expect. Screenshot after logging in  After turning &quot;large text&quot; on  After turning &quot;large text&quot; off  How do I get the conditions I have after cycling the &quot;large text&quot; feature to be present immediately after booting? I have the 440 version of NVIDIA's drivers installed. how many conditional sentence types are possible? I wonder how many conditional sentence types are possible. Basically, there are four main and two mixed types. By mixing tenses, it could be up to nine of them. Are the rest viable?  I came across the following examples in Full Spate Pre-Profficiency Primer:   After you have just sold alcohol to a young guy. If he is if under eighteen, you should not have sold him the alcohol. If he promised to bring the drinks, he will. If you will take a seat, the doctor will see you shortly. (Likely, the former will demonstrates politeness only.) I would be grateful if you would tell me a little about your friends. (The same politeness, but would instead.) If he will keep eating all those biscuits, he can not expect to stay as slim as he used to be.   I would be grateful if someone could shed more light on the topic. Does the point at which salt is added to a dish affect how the flavor is changed? What are the differences between executing shell scripts using "source file.sh", "./file.sh", "sh file.sh", ". ./file.sh"? Have a look at the code:  #!/bin/bash read -p "Eneter 1 for UID and 2 for LOGNAME" choice if [ $choice -eq 1 ] then         read -p "Enter UID:  " uid         logname=`cat /etc/passwd | grep $uid | cut -f1 -d:` else         read -p "Enter Logname:  " logname fi not=`ps -au$logname | grep -c bash` echo  "The number of terminals opened by $logname are $not"   This code is used to find out the number of terminals opened by a user on the same PC. Now there are two users logged on, say x and y. I am currently logged in as y and there are 3 terminals open in user x. If I execute this code in y using different ways as mentioned above the results are :  $ ./file.sh The number of terminals opened by x are 3  $ bash file.sh The number of terminals opened by x are 5  $ sh file.sh The number of terminals opened by x are 3  $ source file.sh The number of terminals opened by x are 4  $ . ./file.sh The number of terminals opened by x are 4   Note: I passed 1 and uid 1000 to all these executables.  Now can you please explain the differences among all these? Does a wireless-N (802.11n) network have poor performance when in b/g "mixed" mode? It seems to be an "old" wives tale that, when using a wireless-N router in "mixed mode" to support legacy 802.11b or 802.11g devices, the performance of 802.11n clients will suffer.      claim that when running in mixed-mode, all (some?) N clients run at G speeds.   make the same claim, but say it only happens when a G client is connected.    say N clients run faster, but still run about 30% slower than if the router were in N-only mode, even if there are no legacy B/G clients connected.    claim there is no speed drop for N clients when running on a mixed-mode network.  They say the only issue is that overall network throughput will be lower, because only one client can be transmitting at any time, so some of that transmission time must be shared with the legacy B/G clients running at lower speeds, reducing the overall throughput from what it would be if there were only N clients connected.    So, which is it?  Will running in mixed-mode slow down my network, even if there are no B/G clients?  If I'm running N, will having another client connected at B/G slow me down substantially vs. if they were running N? How could I detect (preferably with Python) duplicate MP3 files that can be encoded with different bitrates (but they are the same song) and ID3 tags that can be incorrect?  I know I can do an  checksum of the files content but that won't work for different bitrates. And I don't know if ID3 tags have influence in generating the MD5 checksum. Should I re-encode MP3 files that have a different bitrate and then I can do the checksum? What do you recommend? Chat messages should use consistent icon in iOS app It'd be nice if the chat notifications in the feed used the default Stack Exchange icon like the ones in the inbox do*:     Since items in the feed are grouped so that multiple items from the same site , the site icon helps delimit grouped items a bit less subtlely than the grey divider lines, and chat replies' lack of one causes them to sort of blend in to the previous group.  *Ideally it'd use the icon of the site the room was associated with, but I don't think that information is readily available Is there a term for switching syllables of words? Primary question: A common speaking mistake is to exchange syllables of words, saying "It's trace rhyme!" instead of saying "It's race time!", or pronouncing "kickin' chackatory" instead of "chicken cacciatore." Is there an existing name in poetry, linguistics, or English studies for switching syllables of (quasi-)consecutive words? I am not especially interested in the case when switching syllables results in interpretable homonyms or portmanteaus, like in the first example.  Secondary question: if not, what would you call it?  Tertiary question: is there somewhere a (playful?) taxonomy of fruitful or unfruitful lingual aberrations? Determining confidence interval with one observation (for Poisson distribution) Cannot find Underground Jungle Temple Adjusting space between array rows and columns \documentclass[english]{article} \usepackage[T1]{fontenc} \usepackage[latin9]{inputenc} \usepackage{babel} \begin{document} % ... \[ \begin{array}{ccccc} x(1) &amp; = &amp; \frac{x(0)}{1} &amp; = &amp; x(0)\\ x(2) &amp; = &amp; \frac{x(1)}{2} &amp; = &amp; \frac{x(0)}{2}\\ x(3) &amp; = &amp; \frac{x(2)}{3} &amp; = &amp; \frac{x(0)}{2.3}\\ x(4) &amp; = &amp; \frac{x(3)}{4} &amp; = &amp; \frac{x(0)}{4!}\\  &amp;  &amp;  &amp;  &amp; \vdots\\ x(n) &amp; = &amp; \frac{x(n-1)}{n} &amp; = &amp; \frac{x(0)}{n!} \end{array} \] % ... \end{document}   Because of the fractions in the array cells, array elements are vertically too close to each other, they are literally touching to each other. Also the horizontal spacing is too much as you see in the image (screen shot from the output PDF file).  How do I make these cell-spacings look better? Why do the planets' orbital distances fall on an exponential curve? Background: I was recently reading a book on the planets to my son and I noticed a pattern in the distributions of the planets.  The planets' distances roughly follow an exponential distribution.  Below is a plot of scaled, log orbital distances $$ \tilde{d_n} = \frac{\log(d_n/d_1)}{\log(d_2/d_1)} $$ with the line $an+b$:   Where $d_1$ corresponds to Mercury and so on. Ceres is included, Pluto is excluded.  By linear regression, $a = 0.90, b = -1.06$.  For the statistically minded, the data has a Pearson's correlation of 0.996.  Note that this is a well known phenomenon, see  and references.  The code used to generate the plot may be provided on request.  Question: What is the mechanism that leads to this distribution?  Aside: Is there a good introductory text on solar system formation for the mathematically inclined?  Update: This is also known as Titius–Bode law. How do I make a Villager Trade a Spawn Egg I am trying to make a Custom Trade on a villager. I need to make him buy 8 gold nuggets and sell a Cow Spawn Egg.  basically you pay 8 nuggets for a Cow Spawner.  The ID of the Cow Spawn Egg is 92 but I don't know where to put it in the command /summon Villager ~ ~2 ~ {Invulnerable:1,CustomName:Spawner_Vendor,Profession:2,Career:1,Offers:{Recipes:[{buy:{id:gold_nugget,Count:8},sell:{id:spawn_egg,Count:1}}]}} What is included in Wolfram Extras? Command to move a file to Trash via Terminal I would like to know if there is a command I can issue in a terminal so I do not classically remove (rm) the file, but instead move it to trash (i.e. Nautilus Move to Trash behavior).  In case there is such a command, I would also be interested in knowing what it is. Prove the inequality $n! \geq 2^n$ by induction I'm having difficulty solving an exercise in my course.  The question is:      Prove that $n!\geq 2^n$.   We have to do this by induction. I started like this:   The lowest natural number where the assumption is correct is $4$ as: $4! \geq 2^4 \iff 24 \ge 16$. The assumption is: $n! \ge 2^n$.   Now proof for $(n+1)$ which brings me to: $(n+1)! \ge 2^{(n+1)}$  I think I can rewrite it somehow like this:  $$ {(n+1)} \times {n!}  \stackrel{\text{(definition of factorial)}}{\ge} 2^n \times 2 $$  $$ (n+1) \times 2^n \ge 2^n \times 2 $$  Then I think I can eliminate the $2^n$ and have something like this: $n+1 \ge 2$, or $n \ge 1$.  But I think I'm wrong here some where and was hoping somebody has some advice on this. How can I prove the above assumption?  Any help would be appreciated, kind regards. How should I unit test multithreaded code? When people want to classify a group with certain (small) order, they seem to find a normal subgroup $H$ and a subgroup $K$, and then consider how many distinct $H \rtimes_\varphi K$ are there.  My question is: For any group $G$, does it always exist normal subgroup $H$, subgroup $K$ and $\phi : K \rightarrow Aut(H)$ s.t. $G\cong H \rtimes_\varphi K $?  Sorry if this question is too basic...  Thanks the comment and the answers. Then if the $G$ is not simple, can we have can $G\cong H\rtimes_\varphi K$ for proper subgroup $H$, $K$, with $H$ normal?  EDIT:  If we have a group $G$, that is not simple (then $G$ has at least one normal subgroup), are there always a non-trivial normal subgroup $H$ and a proper subgroup $K$ s.t. $G \cong H \rtimes K$. (Note that if $G$ is simple this is clearly not possible).  But the quaternion group and $Z_4$ given in answers have shown that we cannot always have it. How do I enable Scroll Lock? Is there a way to programmatically determine if a font file has a specific Unicode Glyph? I'm working on a project that generates PDFs that can contain fairly complex math and science formulas.  The text is rendered in Times New Roman, which has pretty good Unicode coverage, but not complete. We have a system in place to swap in a more Unicode complete font for code points that don't have a glyph in TNR (like most of the "stranger" math symbols,) but I can't seem to find a way to query the *.ttf file to see if a given glyph is present.  So far, I've just hard-coded a lookup table of which code points are present, but I'd much prefer an automatic solution.  I'm using VB.Net in a web system under ASP.net, but solutions in any programming language/environment would be appreciated.  Edit: The win32 solution looks excellent, but the specific case I'm trying to solve is in an ASP.Net web system.  Is there a way to do this without including the windows API DLLs into my web site?