I'm new to Ubuntu and planning to install it on my Dell Inspiron 910, because in Windows XP some random updates ate all my 8GB storage (SSD).  Even after stripping down XP to the bone, I'm unable to install any of the updates due to no storage space available. Therefore, I've decided to install Ubuntu instead.  After doing research, I came across various versions of Ubuntu.   First it was 32bit / 64bit. And then, I found Lubuntu, Xubuntu, etc. I have tried Lubuntu from a live disk which did not help me to connect with WiFi (known problem I assume). After some reading I realized, there were different specifications of the Ubuntu versions, especially about disk space that each version requires. In my case, it is pretty important. So, given the fact I only have 8GB SSD.  Which one will be most suitable for me?
For a given hardware configuration, how do I find out if Ubuntu will run on it? What considerations should I take into account when choosing an Ubuntu version and  such as:    with a lighter desktop than the usual Gnome and Unity  with the even lighter LXDE desktop   Obviously Ubuntu does not run on some processor architectures. So how do I go about choosing the right version and derivate. How can I find out the minmal system requirements?
subideals of an ideal If $R$ is a ring, J is an ideal in $R$, and $I$ is an ideal of $J$ (with $J$ considered as a ring), does it follow that $I$ is an ideal of $R$?  That is, is $I$ necessarily closed under multiplication by elements of $R$?  Surely $I$ is closed under multiplication by elements of $J$ (since $I$ is an ideal of $J$).  The "obvious" approach to proof fails so quickly that it must be false, that "an ideal of an ideal is not necessarily an ideal of the big ring".  Please provide a counterexample.  (Or a proof?) Fingerprint GUI not installing in Ubuntu 20.04 I'm trying to install fingerprint-gui on my Lenovo Ideapad 520 having Ubuntu 20.04 on which fingerprint isn't working for now. I tried going directly to Settings → Users → Automatic login and enabled the fingerprint login, but the error is:  Could not access any fingerprint readers Please contact your system administrator for help!  I also tried to install Fingerprint GUI: sudo apt-add-repository ppa:fingerprint/fingerprint-gui &amp;&amp; sudo apt-get update  sudo apt-get install libbsapi policykit-1-fingerprint-gui fingerprint-gui  but encountered this error: E: Package 'policykit-1-fingerprint-gui' has no installation candidate E: Package 'fingerprint-gui' has no installation candidate  What could be the problem here? I see ads to other SE sites regularly on the sidebar of SO. Are these questions chosen by hand, or algorithmically? The reason I ask is that there was an ad pointing to  on Seasoned Advice. I'm all for a good laugh I suppose, but is this the kind of question that should be highlighted?  It's obviously a thriving community, but if this were my first exposure to that community, and I saw that the highest-rated answer -- from the user with the highest reputation -- was (and I paraphrase only lightly):  &quot;Why yes, there is tool that can cut cherry tomatoes in half.  It's fantastic for the job.  It's called a freakin' KNIFE!&quot;  would I ever want to visit again, let alone ask a question over there? First impressions count for a lot, and that one missed the mark IMHO. If the selection method is algorithmic, I suppose there's no reliable way to detect sarcasm in a highly-rated answer, but if it's manual, weeeellllllllll ... :) Can someone explain Cayley's Theorem step by step? This is from Fraleigh's First Course in Abstract Algebra (page 82, Theorem 8.16) and I keep having hard time understanding its proof. I understand only until they mention the map $\lambda_x (g) = xg$. Can someone explain this proof step by step? Thank you so much! Here is the proof:  Let $G$ be a group. We show that $G$ is isomorphic to a subgroup of $S_G$. Define a one-to-one function $\phi: G \to S_G$ such that $\phi(xy)=\phi(x) \phi(y)$ for all $x,y \in G$. For $x \in G$, let $\lambda_x: G \to G$ be defined by $\lambda_x (g) = xg$ for all $g \in G$. The equation $\lambda_x (x^{-1} c) = x(x^{-1} c) = c$ for all $c \in G$ shows that $\lambda_x$ maps $G$ onto $G$. If $\lambda_x (a) = \lambda_x (b)$, then $xa=xb$ so $a=b$ by cancellation. Thus $\lambda_x$ is also one to one, and is a permutation of $G$. We now define $\phi: G \to S_G$ by defining $\phi(x) = \lambda_x$ for all $x \in G$. To show that $\phi$ is one to one, suppose that $\phi(x) = \phi(y)$. Then $\lambda_x = \lambda_y$ as functions mapping $G$ into $G$. In particular $\lambda_x (e) = \lambda_y (e)$, so $xe=ye$ and $x=y$. Thus $\phi$ is one to one. It only remains to show that $\phi(xy) = \phi(x) \phi(y)$, that is, that $\phi_{xy} = \lambda_x \lambda_y$. Now for any $g \in G$, we have $\lambda_{xy} (g) = (xy)g$. Permutation multiplication is function composition, so $(\lambda_x \lambda_y)(g) = \lambda_x (\lambda_y (g)) = \lambda_x (yg) = x(yg)$. Thus by associativity, $\lambda_{xy} = \lambda_x \lambda_y$. My Wi-Fi connection seems to be very weak and the range is very low. It drops by two bars if I just move to the next room and by two if just step outside.  The speed is also not fast as compared to what I get from the router on my desktop .  My laptop is a HP laptop with RTL8723de module. Can anyone help me in bumping up my Wi-Fi speed?  Result of lspci -nnk | grep 0280 -A3:  03:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. Device [10ec:d723] Subsystem: Hewlett-Packard Company Device [103c:8319] Kernel driver in use: rtl8723de Kernel modules: rtl8723de How to run a script without closing the terminal? I have a script in file bla.sh and it is executable. When I click on it, the script is executed and the window is closed. I'd like the window to stay open.  Something like command cmd /k** command in Windows.  P.S. I don't want to use pause, but I want to able to write more commands after the script was executed. How to tell which row number is clicked in a table? How do I breed Pokemon for their Hidden Abilities? I want to legitimately breed a competitive team, but I don't know how to breed for hidden abilities unless I just breed two Pokemon who have their normal ability(s) together until I breed one with a hidden ability. Does someone know a useful trick or item I could use? What voltage is a 3-LED light from a LED-TV? I have some "NDV rev1.1 4248 back lights" from a television.   There is a print that sais "94V" on the strip, and on the wire supplying the strips it said "96V".   Every strip has 9x buttons which have 3 LED's in them. So i devided 94 by 9 and figured that every button should have 10.4V roughly, which makes sense, because a white LED is normally 3.5 volts.  I have a 12v Lithium battery which measured 11.1V so i tested one of the LED's with it and it lasted less than one second.   Are the LED's are rated for 10.4V roughly and not more? Problem with IMPORTRANGE function in Google Sheets I’m trying to get IMPORTRANGE to work for me with no success. I made two simple spreadsheets:  and . In the destination sheet I’m using the import range function:  =importrange(“1-5F1_zz0ZpGj7SfeQhewsCe0CsrA0eyPbjfmUrLBsyk”,”Sheet1!a1:a1”)   I tried already:   Replacing the , with ; Referencing just the key as well as the full URL in the first argument Switching from “ to ‘ With the sheet name and without it   Not sure what else to do.  Any ideas? Broken APT on WSL 18.04 We walk or ride on our vehicles to our destinations daily. Does our movement have any effect on the rotation of the earth according to Newton's law? What will be the effect if we move all the peoples along with their vehicles at their maximum velocity in one line in one direction along the equator? How much effect will it make? Set limit to one author when using "et al." in biblatex In the header of my document I set the maximal author names to 2:  \usepackage[style=authoryear-icomp, maxbibnames=9, maxcitenames=2, backend=biber]{biblatex}   Now, when I cite texts with two authors, LaTeX gives me the following:     (Author_A/ Author_B 2012: 232)   When I have three authors or more, LaTeX makes it:     (Author_A/ Author_B et al. 2012: 232)   But I want LaTeX to just name the first author if there are more than two authors ... like this:     (Author_A et al. 2012: 232)   Any tips on how to achieve this ? I would like to ask if MS Access database supports working in networks &amp; multi-user access? Does the scientific community consider the Loschmidt paradox resolved? If so what is the resolution? When/Why Did Love Escape Voldemort? We know that Voldemort does not love. He does not understand it, nor (generally) the magic that it possesses. He knows  of the sort.  [...] &quot;you possess in such quantities and which Voldemort has not at all.&quot; [...] &quot;because he could not bear to reside in a body so full of the force he detests. In the end, it mattered not that you could not close your mind. It was your heart that saved you.&quot; (Harry Potter and the Order of the Phoenix, page 1075)  The above confirms it (although I believe there is a better quote), though  reinforces it. The fact that he hugs so awkwardly shows that he does not really know how, due to his lack of love. I realize that Voldemort's appearance started to change after he started to create Horcruxes, but surely he had an ounce of love when he was a child? The hugging scene perhaps shows that he never once loved his whole life (possibly due to the love potion with his parents?). If so, when did Voldemort begin to have no love at all, and why? Turning a cipher into a hashing function This is theoretical question. I'd like to know if it's possible (and what are eventually the consequences), not that I'm going to do it in one of my projects. ;)  The first hashing functions created were based on a symmetric cipher (just like the first Unix crypt was based on DES). The idea was simple. Use the password as key to encode a constant.  I'd like to know if it's still possible to convert any modern symmetric cipher into a hashing function (and second question: into a cryptographic hashing function). Is it possible (easier) to guess the key, when you have an encoded and decoded messages? How can I iterate over an enum? Are tile bonuses counted twice if 2 new words are formed? An example:    O  O?   There is a triple letter tile to the right of the bottom O, indicated with a ?.  If I place an X on it, making the words OX (vertical) and OX (horizontal), do I score 50 points (scoring the tile twice) or 34 (scoring it once)? Variable name as a string in Javascript