I have Ubuntu 18.04 and python 3.7. uname -a Linux username-laptop 4.15.0-109-generic #110-Ubuntu SMP Tue Jun 23 02:39:32 UTC 2020 x86_64 x86_64 x86_64 GNU/Linux  When I run sudo apt-get update I get this error : E: The repository 'http://dl.bintray.com/aluxian/deb stable Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details. E: The repository 'https://dl.bintray.com/aluxian/deb dev Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See apt-secure(8) manpage for repository creation and user configuration details.  I tried  solution but I am also unable to open Software and updates.
When updating, I get the following error message:   W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file.   Here, I find another statement on this error:   This recommends removing certain PPAs; and, I'm not sure if I should do that since it might mean not getting the updates that I need.    Is this what I should do?
How do you correctly say large numbers deals with various ways of rewarding the finding of duplicates, a tough and increasingly necessary janitorial task.  Here's a concrete suggestion:   Reward the finder of a duplicate with +10 points if the question gets closed as a dupe. If multiple duplicates are found, reward all finders whose suggestion was voted for at least once by another user. (The limitation is to avoid gaming by making frivolous suggestions when it's obvious that a question is going to get closed as a duplicate.) Reward each following closevoter who picks one of the previously suggested dupes with +2 points if the question gets closed. Punish everyone involved (dupe-finders and dupe-voters) with -5 points, and revoke all rep gained from the dupe-voting, if a question closed as duplicate gets reopened.   A punishment for mis-voting is going to be controversial but in my eyes, it is absolutely essential. Finding a good dupe is a work of love: You need to make sure you understand the OP's question, and you need to scan every potential duplicate for whether it really contains an answer that will help the OP. Everyone dupe-votes carelessly from time to time, so the threat of punishment needs to be present to keep everyone on their toes, just as the threat of downvoting does when you post an answer.  If you think +10 is too high a reward: Consider that finding a duplicate can often be more work than writing an answer, and a correct answer usually nets you at least 10 points, if not much more.   If you think -5 is too much of a punishment: -2 might work as well, although I really think there should be a harsh punishment on an unfair dupe-closing. Over the years I've written some libraries. These libraries sometimes depend on each other.  As a result, the "tex" directory is structured as follows:  tex ├── library |   ├── library1.sty |   ├── library2.sty |   └── library3.sty ├── project1 |   ├── master.tex |   ├── chapter1.tex |   └── chapter2.tex ├── project2 |   └── article.tex └── project3     └── paper.tex   The libraries depend on each other. As a result, in every library that depends on another library, this is part of the header:  %library2.sty \ProvidesPackage{library2} \RequirePackage{../library/library1}   In other words, the library is imported from the "root of every project". This is not a good design choice. What if someone copies the libraries in the folder of the root of a project, or what if the folder "library" is renamed...  It is however reasonable the "active directory" still remains in the project root.  What can be done to resolve such library dependencies? According to the documentation, the  method uses a round-to-even algorithm which is not common for most applications. So I always end up writing a custom function to do the more natural round-half-up algorithm:  public static decimal RoundHalfUp(this decimal d, int decimals) {     if (decimals &lt; 0)     {         throw new ArgumentException("The decimals must be non-negative",              "decimals");     }      decimal multiplier = (decimal)Math.Pow(10, decimals);     decimal number = d * multiplier;      if (decimal.Truncate(number) &lt; number)     {         number += 0.5m;     }     return decimal.Round(number) / multiplier; }   Does anybody know the reason behind this framework design decision?  Is there any built-in implementation of the round-half-up algorithm into the framework? Or maybe some unmanaged Windows API?  It could be misleading for beginners that simply write decimal.Round(2.5m, 0) expecting 3 as a result but getting 2 instead. LED accent light that slowly dims when removed from power source We've all played with different transformers and power supplies that have an LED indicator that dims before going out entirely when the power supply is unplugged.  I'm working on designing an accent light which would involve a translucent crystal light source (probably made of resin or glass if I can find a cheap supplier) containing LEDs and certain electronics, and a base which would supply electrical current. For gamers, it might appear somewhat like a Welkynd Stone. My question is what is the simplest way to cause the LEDs to dim slowly (say over 2-10 seconds) when the crystal is removed from the base? Similar to the unplugged transformer, but with an intentional and controlled dimming.  I just purchased some LEDs and plan to build a test system over the next month or two. These LEDs are in a 5 meter strip divided into 3 LED series run in parallel and rated at 12v. I do not know the amp rating of the LEDs, but I'm guessing in the 20ma range (what I've read is average for bright white). I will probably use 4 series totaling 12 LEDs in the test build.   If I have the transformer from AC power built into the base, I was guessing I could use a number of capacitors in parallel with a resistor to store electricity and slowly discharge it into the LEDs. But I'm a self-taught enthusiast so I honestly don't know if this would actually work. Nor do I know the number and ratings of capacitors and resitor that I would need.  If I have the transformer built into the crystal, the transformer and rectifier would retain a small amount of electricity, but I don't think it would be nearly enough to provide the effect I'm looking for, so something else would have to be added to make it last for several seconds.  A nicad battery with control electronics is literally my last resort for achieving this effect, and I'll probably give up on the idea before I go programming my own circuit board.  That's my main question. If anyone wants to toss in some thoughts on how to connect the crystal to the base, I'm open to suggestions. My original plan was to simply have a direct copper to copper connection with the base. But I've recently been considering an EM charging system (akin to a powermat or  my dad has). The concern with the wireless is providing consistent power to the LEDs, though it is safer. I've also learned quite a bit already about constructing the power supply from perusing this SE site, but if anyone has any suggestions for that, too, I'm all ears. For the test build I'll probably hook it up to a computer power supply, or a laptop power supply if I can find a 12v one at Goodwill or the local electronics parts store.  If I get the test model to work, I plan on building possibly a dozen of these for accent lighting around my home. Is there a built-in function to print all the current properties and values of an object? Why is $(2, 1+\sqrt{-5})$ not principal? Why is $(2, 1+\sqrt{-5})$ not principal in $\mathbb{Z}[\sqrt{-5}]$?   Say $(2,1+\sqrt{-5})=(\alpha)$, then since $2\in(2,1+\sqrt{-5})$ we have $2\in (\alpha)$, so $\alpha\mid2$ in $\mathbb Z[\sqrt{-5}]$. Writing $2=\alpha\beta$ in $\mathbb Z[\sqrt{-5}]$ and taking norms, $4=N(\alpha)N(\beta)$ in $\mathbb Z$, so $N(\alpha)\mid4$ in $\mathbb Z$. Similarly, since $\sqrt{-5}\in(\alpha)$ we get $N(\alpha)\mid5$, thus $N(\alpha)$ is a common divisor of $4$ and $5$, therefore $N(\alpha)=(1)$, so $\alpha$ is a unit. But that means $1\in (2,1+\sqrt{-5})=(\alpha)$, so it must be the whole ring, but it cannot to reach a contradiction, so how can I find an element, which is not in $(2, 1+\sqrt{-5})$.  Or is there a simpler method ? (Maybe not UFD would imply not PID) Question, is it ok for one of the pages levels to 404? (SEO-wise)  Let's say I have a sitemap like this:  example.com --/services   --/foo   --/bar --/sectors   --/my-sector   --/another-sector   --/the-sector   --/stuff --/about-example --/contact --/etc --/etc   This makes a lot of structural sense. However, from a design point of view, I think having a page to show all the sectors (example.com/sectors) is pointless since all of the sector pages can be accessed from the home page, main navigation, and in each sector page.  Would there be any SEO consequences if the /sectors page were to 404?  Note: in the sitemap 'example.com/sectors' would not be included. For most OpenID options, it doesn't much matter if you pick the "Sign up" versus the "Log in" tab on the sign in page.  Whether you have an account on the site or not, it just does the right thing. Not so if you are using the Stack Exchange OpenID service:    (Bonus bug: the reCAPTCHA box is a bit too wide for the expanded "Sign up using Stack Exchange" container.)  Since we already have collected an email and password (well, two copies of the password), could we not check to see if they match and automagically log the user into their SE OpenID?  If not, the error needs to be reworded somehow to explain that while the email might have been used to create a Stack Exchange OpenID, that doesn't mean they can't log in with that OpenID to create an account.  Counterintuitively, they need to use the  even if they've never had an account there before.  The  link adds to the confusion since it sends an email that leads off with:     Someone requested an account recovery on The Workplace Stack Exchange for jericson@stackexchange.com, but we don't have an account on this site that matches this email address.   (For people with accounts on other sites and/or Stack Exchange OpenIDs, this paragraph is followed by other instructions that would probably work if followed. By that time I imagine many users are at wit's end.)  To simplify: If a user already has a Stack Exchange OpenID (likely because they have an account on another site) they should be able to use the  to sign up for an account or there should be clear instructions on what to do next if they fail. How to evaluate this trigonometric limit? I have been struggling to solve this limit.  What is the limit as $x$ approaches $45^0$ of $$\frac{\sqrt{2}\cos x-1}{\cot x-1}?$$   I know how to use L'Hospital's rule to calculate this limit and got the answer as $0.5$. But, how do I calculate the limit by manipulating the function? Please provide only some hints to proceed. Why can't the Polynomial Ring be a Field? I'm currently studying Polynomial Rings, but I can't figure out why they are Rings, not Fields. In the definition of a Field, a Set builds a Commutative Group with Addition and Multiplication. This implies an inverse multiple for every Element in the Set.   The book doesn't elaborate on this, however. I don't understand why a Polynomial Ring couldn't have an inverse multiplicative for every element (at least in the Whole numbers, and it's already given that it has a neutral element). Could somebody please explain why this can't be so? Finding multivariable limits for the function $\frac{3x^2y}{x^2+y^2}$ if there is two modules A and B and both have same user_login hook. so when i log in. out of A_user_login() and B_user_login() function which one called first.and how drupal decide execution order of these two function Gnome keyring daemon not starting up properly As a non-native speaker of English, it can often be hard to spot some of the errors that a native speaker would find. For a long time, I've been thinking about getting a native speaker to help me with proof-reading my texts (articles, theses, application, etc), but I don't quite know where to look. What are some good ways to get proofreading for your texts?  For example, are there any websites on the Internet where one can exchange proofreading services between different languages? (Say, if you help me proofread my text in language x, I'll help you with yours in language y.) Number of finite simple groups of given order is at most $2$ - is a classification-free proof possible? I have to format my entire disk and reinstall Ubuntu.  I have installed a lot of software on my current system. And I will have to reinstall all those updates, drivers and applications too.  Is there any way I can make an .iso image of my installed Ubuntu along with all the software, preferences, drivers etc in it ?  Is there any way I can back up my whole OS along with all its software, drives, updates and all ? Word for two collections that do not have any elements in common I'm looking for a word for when you have a collection A and a collection B and they have no overlap.  In mathematical terms: the relation between two sets where the intersection is empty. Like in this Venn diagram:    The word that keeps popping up in my mind is disparate sets, but I don't feel that completely covers the meaning when I look at the definition, because that doesn't seem to preclude overlapping sets that are different:     disparate   1. distinct in kind; essentially different; dissimilar:   disparate ideas. Lost space after removing bootcamp So I removed bootcamp and now there is a partition called "free space" that I can't remove.  Here is my output from diskutil list:    Here is the screenshot from disk utility showing the partitions:    And here is the error I get when I try to remove "free space":    Heres the output when I run   sudo diskutil apfs resizeContainer disk0s2 0 Due to this question and answer , I assume 1k = 1000, 2k= 2000...  I don't believe it. Or maybe I am wrong. Please check the below images.        You will see 2kviews. But when you navigate to it, the actual view count is 15xx.         What is going on? Is it a bug?