On ubuntu 16.04 (100% satisfaction) I used to select and open folders/files on desktop using keyboard, up/down, left/right arrow keys; not the mouse. I cannot do this anymore on ubuntu 20.04 Any work around ?
In Ubuntu 20.04, on the desktop, there is a number of actions I wish I could do, such as, by order of importance :  use keyboard shortcuts such as select all, copy / paste. use drag &amp; drop with icons deactivate the &quot;mouse over&quot; highlight, and restrict the clicking area to only the icon, not the surrounding square  To put it simply, I'd like to have the exact same features as offered by the desktop of Ubuntu 18.04 (probably related to a specific version of GNOME, and not Ubuntu itself). Am I missing something obvious here? I actually see no reason why those actions are removed or deactivated on the desktop, since they all work in any Nautilus window.
How to combine measurement error with statistic error Why is $ 561 = 3*11*17 $ the smallest Carmichael number? A composite integer n is a Carmichael number if the only Fermat   witnesses for $n$ are those $a \in \mathbb Z_n^+$ which are not   coprime with $n$. The smallest example of such a number is $561 = 3 ·  11 · 17$   I think I understand the definition, but I don't quite understand why is the smallest Carmichael number is the above mentioned number. Please clarify. For example, here are top five accounts in each site (this picture was taken when I was in Biology SE).    As you can see, all the badges are DNA, while Academia's badges should be hats, so on.  What do you think? How can I draw a dot under a symbol in math mode? Change folder permissions and ownership I would like the user to have full rights on this folder (as well as all sub-directories and files in it):  ~/.blabla   currently owned by root.  I have found numerous posts (in this forum and elsewhere) on how to do this for files but I can't find a way to do it for whole folders. Why is a black hole black? Picture rotation Is there a way to quickly rotate a picture in the SE editor without saving it on disk and rotating it in some image tool and reuploading it?  E.g. consider the picture below, assume I would like to quickly rotate it 90 degrees and wanted to do it expressly in the editor without the drudgery of saving it on disk, is there a shortcut in the stack exchange &quot;markup language&quot;?  If this feature is not available, I would like to nominate it for implementation. Do you recommend using semicolons after every statement in JavaScript? In many situations, JavaScript parsers will insert semicolons for you if you leave them out. My question is, do you leave them out?  If you're unfamiliar with the rules, there's a description of semicolon insertion on the . Here's the key point:     If the first through the nth tokens of a JavaScript program form are grammatically valid but the first through the n+1st tokens are not and there is a line break between the nth tokens and the n+1st tokens, then the parser tries to parse the program again after inserting a virtual semicolon token between the nth and the n+1st tokens.   That description may be incomplete, because it doesn't explain @Dreas's example. Anybody have a link to the complete rules, or see why the example gets a semicolon? (I tried it in JScript.NET.)   is related, but only talks about a specific scenario. How do I base64 encode (decode) in C? I have binary data in an unsigned char variable. I need to convert them to PEM base64 in c. I looked in openssl library but i could not find any function. Does any body have any idea? Word caption style -- different style for label and number? This should be a common problem for anyone involved in technical writing.  When you insert an image (or table etc.) caption in Word, you get  dialog. You enter your caption,  "A happy bicycle" (in yellow).  This might be fine for a happy bicycle, but I want to have captions that have one style for the "enumeration" (label and number) and one style for the description (caption text, as called by Word), as such:    I have tried searching for this but I haven't found anything yet... Flattening iterator I am currently in hard mode and during a blood moon, several of my NPCs including my guide and my healer died. it's been several in game "days" now and they have yet to respawn. Is there a way to check why they aren't respawning?   Is there a list of reasons for the NPCs to not respawn?   Edit in reponse to lunbok's answer:  1. They don't have appropriate housing - There is an in-game housing query function (changes your cursor into a ?) that lets you click on your house to see if it is still a suitable house and I clicked in every room in my house and they are all listed as "This housing is suitable" or "This housing is already occupied".  2. Their spawn conditions aren't met anymore. - This doesn't explain why my guide isn't respawning since they don't need a condition to respawn (other than having a suitable housing which the point above already prove isn't the problem).  3. There's a goblin invasion going on. - Do the invasions last that long? It has been about two reals days and a lot more in-game "days" now. As far as I can tell there shouldn't be an invasion going on.  4. It could be because you built your house in a part of the world that is now corrupted What if I run a virus/trojan Windows EXE on Ubuntu with Wine? Why are all the textures in my file pink? Was Louis stalked days in advance too? Finding the confidence level and number of successes? Given that the sample size is $1500$ and the confidence interval of $p$ is $(0.050, 0.083)$. Find the confidence level and the number of successes.  I have so far that $E=Z_{1-\alpha/2}∗\sqrt{(p∗({p-1}))/n}$   Where $p$ is the center of the given interval, so $p = (0.050+0.083)/2 = 0.0665$  Also, the error $E$ as the difference of the midpoint and the endpoint of the interval so $E=0.0665-0.050=0.0165$   Plugging this into the equation I got that  $0.0165=Z_{1-\alpha/2}*\sqrt{((0.0665)(1-0.0665))/1500}$   Solving for $Z_{1-\alpha/2}$ gives $Z_{1-\alpha/2}=2.56$ and since $Z_{2.96} = 0.99$   $Z_{1-\alpha/2} = 0.01$  Is what I have so far right? If so, how do I find the number of successes? Is it just to multiply 0.99 by the number of trials?   So that way I would get $1500*0.99=1485$ ? How would one be able to prove mathematically that $1+1 = 2$? Is it possible to prove that $1+1 = 2$? Or rather, how would one prove this algebraically or mathematically? Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3) Prove or disprove: For every integer a, if a is not congruent to 0 (mod 3), the a^2 is congruent to 1 (mod 3)  SO this is for abstract algebra and I am really struggling with this. Here are some of the definitions and theorems I think would apply.  -an integer a divides and integer b if there is an integer q such that b=aq -Let a and b be integers, with a>0. Then there exist unique integers q and r such that b= aq+r and 0&lt;=r  The question says hint: use 2 cases but I'm not really sure what that means. I'm guessing it wants me to look at it when a is congruent to 0 and when it's not? so i tried to do that but just ended up stuck. below is as far as i got with that attempt  Proof: Case 1 There should be some information about letting variables exist in certain number sets here  assume a is not congruent to 0 mod 3, then 3 does not divide a-0, therefore a-0 does not equal 3q for some q in the integers  I was trying to get this to wind down to thus 3 divides a^2-1 but even tho it seems true (I couldn't find a counter example) I couldn't figure out how to prove it with what I have.  Next i tried reversing it thinking I could contradict it or something.  I think this would be case 2? assume a is congruent to 0 mod 3, then 3 divides a-0 and a-0=3q for some q in the integers, then 3q=a since 0 is the additive identity, therefore 3 divides a,  and again stuck and my brain hurts a little..  Can anyone help me figure out how to work this. Find $f$ where $f'(x) = f(1+x)$ Let $f \colon \mathbb{R} \rightarrow  \mathbb{R}$ be a smooth function such that $$f'(x) = f(1+x)$$ How can we find the general form of $f$? I thought of some differential equations, but not sure how to use them here. Thanks. Why modules with no variables?