Cannot ssh on boot until I login (Ubuntu 16.04)
SSH remote user need to be logged in?
How would Voldemort restore himself from a horcrux? If Voldemort's body dies, what process would he use to restore himself from a horcrux? His plans seem sloppy for the pains he had taken. For example, why create horcruxes from pieces of jewellery when they dont have the agency to seek out a new body by themselves?  He needed Quirrel, a person with unlikely ambitions to seek him out to gain an useful body. When that body was gone, he needed Barty Crouch, someone with questionable agency (he could be imprisoned) to transport Harry and draw his blood.  Nagini and the diary seems the only horcruxes with agency, the others are mostly inert.  What plans were ever taken to restore Voldemort from his horcruxes? Making Change for a Dollar (and other number partitioning problems) I was trying to solve a problem similar to the "how many ways are there to make change for a dollar" problem.  I ran across a  that said I could use a generating function similar to the one quoted below:     The answer to our problem (293) is the   coefficient of $x^{100}$ in the reciprocal   of the following:      $(1-x)(1-x^5)(1-x^{10})(1-x^{25})(1-x^{50})(1-x^{100})$   But I must be missing something, as I can't figure out how they get from that to $293$. Any help on this would be appreciated. E.g.  I know that I can browse the chat when I'm not logged on. But what if I am logged on and want to spare the inconvenience of logging off/multiple browsers? I am trying to put two subscripts at the left and right of a character. For example, something like:  _{t} p_{x}  where p is in the middle. How do you do this? Peppers evolved chemicals like capsaicin to discourage animals from eating them, and that chemical itself can cause internal damage if consumed in large quantities, though this is usually only a concern for the hottest of peppers (which people do eat).   Still, why is it that humans seem to be the only animal that often "like" spicy food? When trying to restore a backup to a SQL Server Express 2008 database I got the following error:  Restore failed for Server '...\SQLEXPRESS'.  (Microsoft.SqlServer.SmoExtended) System.Data.SqlClient.SqlError: The database was backed up on a server running version 10.50.1600.  That version is incompatible with this server, which is running version 10.00.2531.  Either restore the database on a server that supports the backup, or use a backup  that is compatible with this server. (Microsoft.SqlServer.Smo)   Is there a way to get a backup which is compatible with the older (in my case 10.00.2531) version from the newer (in my case 10.50.1600) version of SQL Server Express? What are valid values for the id attribute in HTML? When creating the id attributes for HTML elements, what rules are there for the value? Bash is not finding a program even though it's on my path I have a program on my path.  The program runs when executed with a full path specified.  But the program cannot be found when I run it with just its name.    Essentially, I want to understand how the below output is possible, and how to fix it so that my program can actually be found without a full path specified:  root:/usr/local/bin# ./siege **************************************************** siege: could not open /usr/local/bin/etc/siegerc run 'siege.config' to generate a new .siegerc file **************************************************** root:/usr/local/bin# echo $PATH /usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games root:/usr/local/bin# siege bash: /usr/bin/siege: No such file or directory root:/usr/local/bin# wtf!?!?   I'm on Ubuntu 12.04 using bash.  Also please note the warning output from siege is not relevant for the purposes of this question, as I am only interested in whether or not the program can be found and invoked. One of whom destroys the Earth, perhaps accidentally, while fighting another... the plot also involves a human colony ship or planet that loses contact with the Earth; I think a small boy is also involved with the plot, although it's been 20-30 years since I read this story.  Any help would be appreciated!  It's driving my brother and me a bit batty.  Here's the batty brother's take: the main being has created others who are now at war, exploding stars. To escape, the main being accelerates the star of the human colony as a decoy. However, most of the story centers on some guy who winds up living forever, as they keep sticking him in cryogenic sleep and reawakening him. If memory serves me right, they abandon the colony planet for a while and move to asteroids as the star is weakening because it is using it's energy to accelerate. When it decelerates, it is the only star left in the universe. The one "being" was almost reduced to living off the energy of a black hole when it appears, and he sees it and sets off to go there, with a cryptic ending that the humans very well might fight him off. Deferring updates in Windows 10 In Windows 10 version 1607, it was still possible to defer updates by a few months via the Local Group Policy Editor, but now there's a subfolder containing two entries where it's only possible to defer them by 30-60 days with a maximum of 365 days (timer has to be set anew every time).  Am I seeing this correct or am I missing something?  And what's the difference between feature and quality updates? Quadratic Formula in Complex Variables Let $a$, $b$, and $c$ be complex numbers with $a\neq0$. Show that the solutions of $az^2+bz+c=0$ are $z_1,z_2=\frac{-b\pm\sqrt{b^2-4ac}}{2a}$, just as they are in the case when $a$, $b$, and $c$ are real numbers. How do I concatenate const/literal strings in C? For primes $p≡3\pmod 4$, prove that $[(p−1)/2]!≡±1\pmod p$. I know to use Wilson's Theorem and that each element in the second half is congruent to the negative of the first half, but I'm not sure how to construct a proof for it. Etymology of Tor and Ext Functors The names of the derived functors $\operatorname{Tor}$ and $\operatorname{Ext}$ seem quite cryptic to me. Does anyone know what these abbreviations stand for? I would be glad if someone could tell me where these names come from. Resistor in series needed with LED string? How is listed DPS calculated when dual-wielding weapons? I was trying out the dual-wielding in Diablo 3, when I noticed really strange. When I equipped my off-hand, which has 0.5 less damage than my main-hand. My overall damage actually went down. So my question is, how does the dual-wielding mechanic work for calculating damage? It seems rather odd that my overall damage should be more with one weapon than with two. How to fix "The system is running in low-graphics mode" error? Note: This is an attempt to create a canonical question that covers all instances of &quot;low-graphics mode&quot; error that occurs to a user, including but not limited to installation of wrong drivers, incorrect or invalid lightdm greeters, low disk space, incorrect installation of graphics card like ATI and Nvidia, incorrect configuration of xorg.conf file while setting up multiple monitors among others. If you are experiencing the &quot;low-graphics mode&quot; error when trying to login but none of the following answers work for you, please do ask a new question and then update the answers of this canonical question as and when your new question gets answered.   When I try to boot into my computer, I am getting this error:  The system is running in low-graphics mode Your screen, graphics cards, and input device settings could not be detected correctly. You will need to configure these yourself.   How do I fix the failsafe X mode and login into my computer?  Answer index: I am trying to make a snowball that triggers a command when it hits a player in 1.15, but I don't know how to do that. When I do execute at @e[type=snowball] run gamemode spectator @a[distance=..2] it only runs the command if it goes right next to them. How about a difficulty rating for questions? It might be useful to add a drop down field "Difficulty" for questions. With a very limited set of options, say:   Beginner Advanced Expert   This way, users could easily judge if they can answer a specific question (depending on their experience in the topic) and how much time it will probably take.  Beginners usually know they are new so they can easily select Beginner. Those with some experience just select Advanced and those working on a topic for years may chose Expert. I think it's not very difficult to judge halfway correctly.  And the difficulty rating does not have to be very precise anyway, it's more a rough estimate by the asking person.  As an addition, rep gained on this topic can be multiplied with a difficulty factor. This would solve the problem of lots of rep for often-viewed and easy to answer questions and few rep for less-viewed, difficult questions.  Update  Thank you so far for the answers. I clearly underestimated the fact that some users are going to always chose Expert difficulty.  Maybe readers voting on the difficulty would be a workaround. Of course, we cannot use the rep factor then, for the same reason.  This kind of voting would obviously introduce a whole new set of issues, since we could vote on both content and difficulty (I'm almost positive this kind of proposal existed before?). Proof that the real numbers are countable: Help with why this is wrong I was just thinking about this recently, and I thought of a possible bijection between the natural numbers and the real numbers.  First, take the numbers between zero and one, exclusive.  The following sequence of real numbers is suggested so that we have bijection.    0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 0.01, 0.02, ... , 0.09, 0.10, 0.11, ... , 0.99, 0.001, 0.002, ... , 0.999, 0.0001, etc.  Obviously, this includes repeats, but this set is countable.  Therefore, the set of all numbers between zero and one is a subset of the above countable set, and is thus countable.  Then we simply extend this to all real numbers and all the whole numbers themselves, and since the real numbers, as demonstrated above, between any two whole numbers is countable, the real numbers are the union of countably many countable sets, and thus the real numbers are countable.    Please help me with this.  I understand the diagonalization argument by Cantor, but I am curious specifically about this proof which I thought of and its strengths and flaws.  Thanks.