I just try to install nvidia-410 but after I added the ppa with  sudo add-apt-repository ppa:graphics-drivers/ppa and then apt-update it just doesn't find the driver. I tried to remove the files from the sources.list.d/ directory and add them into the base sources.list but that doesn't work, too.   Any ideas?
I have a GTX 660M and Ubuntu 18.04 64-bit.  According to , the latest graphics driver for this card is version 410.66.  The  says  Current long-lived branch release: `nvidia-410` (410.66)   I have nouveau drivers installed at the moment according to lsmod and, apt-get purge 'nvidia*' does nothing.  I have done add-apt-repository ppa:graphics-drivers and apt-get update and a reboot.  Running ubuntu-drivers devices gives this output  == /sys/devices/pci0000:00/0000:00:01.0/0000:01:00.0 == modalias : pci:v000010DEd00000FD4sv00001028sd00000551bc03sc00i00 vendor   : NVIDIA Corporation model    : GK107M [GeForce GTX 660M] driver   : nvidia-304 - third-party free driver   : nvidia-driver-390 - third-party free driver   : nvidia-340 - distro non-free driver   : nvidia-driver-396 - third-party free driver   : nvidia-driver-410 - third-party free recommended driver   : xserver-xorg-video-nouveau - distro free builtin   Note this line:  driver   : nvidia-driver-410 - third-party free recommended   It looks like everything is ready to go to install driver version 410, but autocompleting apt-get install nvidia- indicates the highest available version is nvidia-390, and trying apt-get install nvidia-410 directly fails.  Why does apt not list the version 410 that the PPA and ubuntu-drivers both say is there?  And if I can't apt-get install nvidia-410, how can I install this version?
Is there a way to conveniently define a C-like structure in Python? I'm tired of writing stuff like:  class MyStruct():     def __init__(self, field1, field2, field3):         self.field1 = field1         self.field2 = field2         self.field3 = field3 Efficient Way to store images in android How to Disavow Bad Backlinks Automatically? Parallel.ForEach Slower than ForEach Explain why $E(X) = \int_0^\infty (1-F_X (t)) \, dt$ for every nonnegative random variable $X$ $(document) vs. $("document") I have a very simple question. When I do this:  \catcode`\@=0 \catcode`\\=11 @mycommand{a} @catcode`@\=0 \catcode`\@=11   It works perfectly and calls \mycommand correctly. However, when I try to define \mycommand with similar trickery:  \newcommand\mycommand[1]{   \catcode`\@=0   \catcode`\\=11   @textbf{Hello #1}   @catcode`@\=0   \catcode`\@=11 }   compilation stalls and gives me the * prompt. If I give it Ctrl+D, it terminates without producing any output. Indeed, it seems that changing the catcodes inside a command has no effect whatsoever, because the following works perfectly (whereas, from my understanding, it shouldn't):  \newcommand\mycommand[1]{   \catcode`\@=0   \catcode`\\=11   \textbf{Hello #1} }   Can anybody please explain to me what's happening? Why are the solutions of polynomial equations so unconstrained over the quaternions? An $n$th-degree polynomial has at most $n$ distinct zeroes in the complex numbers.  But it may have an uncountable set of zeroes in the quaternions.  For example, $x^2+1$ has two zeroes in $\mathbb C$, but in $\mathbb H$, ${\bf i}\cos x + {\bf j}\sin x$ is a distinct zero of this polynomial for every $x$ in $[0, 2\pi)$, and obviously there are many other zeroes.  What is it about $\mathbb H$ that makes its behavior in this regard to be so different from the behavior of $\mathbb R$ and $\mathbb C$?  Is it simply because $\mathbb H$ is four-dimensional rather than two-dimensional? Are there any theorems that say when a ring will behave like $\mathbb H$ and when it will behave like $\mathbb C$?   Do all polynomials behave like this in $\mathbb H$? Or is this one unusual? Can anyone offer any help with this..? I read it at school around 1976 but cannot remember the title nor the author. Thank you in advance!  A lone astronaut called - I think- Steve is stranded on a distant planet when his ship runs low on fuel.   His only companion is - again I think - a parrot. The fuel his ship uses is a filament or wire which is kept on a spool.   On exploring the locale he has landed in he discovers a huge building half-buried in a mountainside. He enters the building and discovers it is a museum filled with thousands of glass cases containing preserved specimens of various life forms as well as machines.   There is a robot curator that does repairs and, as the astronaut finds out, prepares cases for new exhibits.   On analysing the wire in one of the machines he discovers that is suitable as fuel for his ship so he winds a length of it onto his ships spool and leaves the planet just ahead of the robot collecting him and his parrot as museum exhibits... Cartoon about a group of teenagers whose souls travel to multiple worlds with monsters I remember very little but enough... I know that there were 3 worlds, a real one, a mid-world kind of with a teleporter, and the world with all the creatures. The first episode was in the desert and there was a good monster that saved the main guys from a bad one. Before he saved them he said every end is a beginning and every beginning is an end.   Please help me; I've tried everything. I saw it on , I think it was not Japanese. I live in Croatia, so I saw it there. It was aimed at kids, but not younger kids. The main characters were human, around 15 years old. The teleporter was in the middle of a big structure. It was a 6 piece tp, so every circle was one, and it was shaped like a star. There were robots working there; they carried food and other things.  I remember that all the creatures thought that the humans are evil, all but the one, the "lord" of all of them. And yes, the main character got to the world by some sort of a device that he found and it belonged to another kid who lost it and they were able to transform in the creatures from the world by it. When they are in the "other world", their body stays in the real world and acts normally but their soul gets transported to the mid-world The set that only contains itself Use of .apply() with 'new' operator. Is this possible? How is The Wall bypassed? In the first series of the TV show several things apparently bypass  to reach Winterfell:   The Night's Watch member  captured near Winterfell and executed by Ned. The Direwolf &amp; her pups found immediately after the execution  and the other Wildlings travelling with her   If The Wall is approximately the same along its length it would presumably be impassible. Is the only option for them to go around the western end (since it stops at the Shadow Tower)? Is this clarified in the book? Are other methods mentioned in subsequent books? In my textbook, a relationship is plotted between the resistance of the material and the temperature, and the temperature coefficient is defined as the slope of that graph divided by an arbitrary resistance $R_1$ on the graph. Does that mean that the coefficient varies depending on the temperature I choose to divide the slope by?  If so, how does it stand as a valid reference to the material’s resistance growth rate with temperature?  If not, then where did I go wrong with this train of thought? existence of sequence of polynomial Is there a sequence of polynomials $P_n$ such that   $\displaystyle\lim_{n \to \infty} P_n(z) = \begin{cases} 1, &amp; \text{Im } z &gt; 0\\ 0, &amp; z \text{ is real,} \\ -1, &amp; \text{Im } z &lt; 0 \end{cases}$  I have no clue where to start from. Please provide some hints. Thanks in advance. Why don't languages raise errors on integer overflow by default? In several modern programming languages (including C++, Java, and C#), the language allows  to occur at runtime without raising any kind of error condition.  For example, consider this (contrived) C# method, which does not account for the possibility of overflow/underflow.  (For brevity, the method also doesn't handle the case where the specified list is a null reference.)    //Returns the sum of the values in the specified list. private static int sumList(List&lt;int&gt; list) {     int sum = 0;     foreach (int listItem in list)     {         sum += listItem;     }     return sum; }   If this method is called as follows:  List&lt;int&gt; list = new List&lt;int&gt;(); list.Add(2000000000); list.Add(2000000000); int sum = sumList(list);   An overflow will occur in the sumList() method (because the int type in C# is a 32-bit signed integer, and the sum of the values in the list exceeds the value of the maximum 32-bit signed integer). The sum variable will have a value of -294967296 (not a value of 4000000000); this most likely is not what the (hypothetical) developer of the sumList method intended.  Obviously, there are various techniques that can be used by developers to avoid the possibility of integer overflow, such as using a type like Java's , or the  keyword and  compiler switch in C#.  However, the question that I'm interested in is why these languages were designed to by default allow integer overflows to happen in the first place, instead of, for example, raising an exception when an operation is performed at runtime that would result in an overflow.  It seems like such behavior would help avoid bugs in cases where a developer neglects to account for the possibility of overflow when writing code that performs an arithmetic operation that could result in overflow.  (These languages could have included something like an "unchecked" keyword that could designate a block where integer overflow is permitted to occur without an exception being raised, in those cases where that behavior is explicitly intended by the developer; C# actually .)  Does the answer simply boil down to performance -- the language designers didn't want their respective languages to default to having "slow" arithmetic integer operations where the runtime would need to do extra work to check whether an overflow occurred, on every applicable arithmetic operation -- and this performance consideration outweighed the value of avoiding "silent" failures in the case that an inadvertent overflow occurs?  Are there other reasons for this language design decision as well, other than performance considerations? Bachelor thesis or Bachelor's thesis LaTeX conditional expression I would like to be able to set a flag at the beginning of the main flag (say output) that tells if I want to produce a paper document or an electronic document.   Then I should check this flag to define or not empty pages, hypperref, oneside or twosides, etc.  How could I do that ? Cannot set LC_CTYPE to default locale: No such file or directory Precedence of user and group owner in file permissions