I am working in edit mode in Blender 2.8.  There is a volume through which I constructed 2 planes. Now I want to remove the excess parts. To do so, I think I need to split the faces where they intersect.  See the image: I want to remove all parts marked with a red cross.  To do this, I think I just need to figure out how to create the edges with the green dotted lines, but I can't figure out how to do this.  Maybe another way to explain this: if you look at both the horizontal and vertical line in the front, these do not intersect. Although they are in the same plane, there is no vertex where they cross and I can't find any button to perform this action.      Solutions I tried:  Rip apart the faces. In the screenshot I'm trying to adjust one of the faces, but this doesn't really merge the top edge with the horizontal face, which is what I'm looking for. Or maybe I'm not using the tool correctly.
I have a box that I have extruded to the shape I want. Then I placed a cylinder so that it intersects the box. After that I deleted the bottom faces of both the cylinder and box.  Now what I want to do is delete the portion of the cylinder that is inside the box and join the nodes so that it is one object. I have already joined the meshes so I can select points/edges/faces from either shape. It seems like the easiest way would be to just put nodes where the edges of the cylinder and box intersect and then delete the parts I don't care about. I can't find a good way to do that though.  What's the best way to accomplish what I'm trying to do?
I've start a new job today and I am trying to set up my machine to run through their Windows server.  I've managed to get a internet connection through the server now but now I can't run apt-get update as I get a "403 Forbidden" error.  This is for every repo under my source list, apart from translations(?).  I do have a proxy in apt.conf, if I don't have it I get a 407 Permission Denied error.  Here's my apt.conf file (I have omitted my username and password)  Acquire::http::proxy "http://username:password@192.168.0.2:8080/";   Here's my sources.list  #deb cdrom:[Ubuntu 12.04.2 LTS _Precise Pangolin_ - Release amd64 (20130213)]/ dists/precise/main/binary-i386/  #deb cdrom:[Ubuntu 12.04.2 LTS _Precise Pangolin_ - Release amd64 (20130213)]/ dists/precise/restricted/binary-i386/ #deb cdrom:[Ubuntu 12.04.2 LTS _Precise Pangolin_ - Release amd64 (20130213)]/ precise main restricted  # See http://help.ubuntu.com/community/UpgradeNotes for how to upgrade to # newer versions of the distribution. deb http://gb.archive.ubuntu.com/ubuntu/ precise main restricted deb-src http://gb.archive.ubuntu.com/ubuntu/ precise main restricted  ## Major bug fix updates produced after the final release of the ## distribution. deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates main restricted deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-updates main restricted  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu ## team. Also, please note that software in universe WILL NOT receive any ## review or updates from the Ubuntu security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise universe deb-src http://gb.archive.ubuntu.com/ubuntu/ precise universe deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates universe deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-updates universe  ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu  ## team, and may not be under a free licence. Please satisfy yourself as to  ## your rights to use the software. Also, please note that software in  ## multiverse WILL NOT receive any review or updates from the Ubuntu ## security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise multiverse deb-src http://gb.archive.ubuntu.com/ubuntu/ precise multiverse deb http://gb.archive.ubuntu.com/ubuntu/ precise-updates multiverse deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-updates multiverse  ## N.B. software from this repository may not have been tested as ## extensively as that contained in the main release, although it includes ## newer versions of some applications which may provide useful features. ## Also, please note that software in backports WILL NOT receive any review ## or updates from the Ubuntu security team. deb http://gb.archive.ubuntu.com/ubuntu/ precise-backports main restricted universe multiverse deb-src http://gb.archive.ubuntu.com/ubuntu/ precise-backports main restricted universe multiverse  deb http://security.ubuntu.com/ubuntu precise-security main restricted deb-src http://security.ubuntu.com/ubuntu precise-security main restricted deb http://security.ubuntu.com/ubuntu precise-security universe deb-src http://security.ubuntu.com/ubuntu precise-security universe deb http://security.ubuntu.com/ubuntu precise-security multiverse deb-src http://security.ubuntu.com/ubuntu precise-security multiverse  ## Uncomment the following two lines to add software from Canonical's ## 'partner' repository. ## This software is not part of Ubuntu, but is offered by Canonical and the ## respective vendors as a service to Ubuntu users. # deb http://archive.canonical.com/ubuntu precise partner # deb-src http://archive.canonical.com/ubuntu precise partner  ## This software is not part of Ubuntu, but is offered by third-party ## developers who want to ship their latest software. deb http://extras.ubuntu.com/ubuntu precise main deb-src http://extras.ubuntu.com/ubuntu precise main   I can sort-of fix this by changing all the http in sources.list to ftp but I still have issues with ppas Erdős-Straus conjecture The  (ESC), states that for every natural number $n \geq 2$, there exists a set of natural numbers $a, b, c$ , such that the following equation is satisfied:  $$\frac{4}{n}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\tag{1}$$  The basic approach to solving this problem outlined by Mordell [Ref1] is described below  By defining $t$ and $m$ as positive integers greater than zero and $q$ a positive integer greater than one we can observe that  a) There is always a solution for even $n$, since if $n=2^qt$ we have the trivial solution $$\frac{4}{4t}=\frac{1}{t}$$  In the remaining case $n=2(2t+1)$, a solution in the form of two Egyptian fractions can always be found  e.g. $$\frac{4}{2(2t+1)}=\frac{2}{2t+1}=\frac{1}{t+1}+\frac{1}{(t+1)(2t+1)}$$  b) If $(1)$ is a solution for some particular prime $n$ then all composite numbers $mn$ divisible by $n$ are also solutions, thus  $$\frac{4}{mn}=\frac{1}{ma}+\frac{1}{mb}+\frac{1}{mc}$$  will also be a solution. This means that we can simplify the analysis to the cases where $n$ is a prime greater than 2.  Using Mordell's approach we have just shown that we only need to consider the cases where $n$ is prime and where $n \equiv 1 \pmod{2} \;\;[meaning \;\;n=2t+1]$  The argument continues...  Mordell goes on to show in turn that the search can be reduced further to the cases when $$n \equiv 1 \pmod{4} \;\;[meaning \;numbers \;\;n=4t+1]$$ $$n \equiv 1 \pmod{8} \;\;[meaning \;numbers \;\;n=8t+1]$$ $$n \equiv 1 \pmod{3} \;\;[meaning \;numbers \;\;n=3t+1]$$ $$n \equiv 1,2,4 \pmod{7} \;\;[meaning \;numbers \;\;n=7t+1,n=7t+2 \;or\;n=7t+4 ]$$ $$n \equiv 1,4 \pmod{5}  \;\;[meaning \;numbers \;\; n=5t+1 \;or\;n=5t+4]$$  Assembling these results together, Mordell showed that the conjecture can be proved in this context except for the cases when $$n \equiv 1,11^2,13^2,17^2,19^2,23^2 \pmod{840}$$  Mordell stated that since the first prime meeting this condition is 1009, this is proof that the conjecture holds for $n&lt;1009$.  This basic approach can be pursued further. Other workers have shown that the conjecture holds for much higher values of $n$ using similar methods as can be seen on the above Wikipedia page.   Note that other intermediate results can be constructed from the above congruence's, e.g. $n \equiv 1 \pmod{24}$.  The question is:  Are there any other elementary approaches to solving this problem than the one outlined by Mordell (and described above)?  [Ref1] Louis J. Mordell (1969) Diophantine Equations, Academic Press, London, pp. 287-290. Is there a way for me to download the full list of tags (and synonyms) used on Stack Overflow? My intent is to import these tags into an SQLite database as part of a process to convert all of my delicious bookmarks and tags to the ones used here on Stack Overflow. Why do people sometimes use the past perfect form of a verb when the past would suffice? (e.g. "you had mentioned") I noticed that my American friends tend to use the past perfect form when they use the verb mention in its past form, almost despite of the context of the sentence. I hear them say  "you had mentioned" a lot more often even in situations where the use of simple past would have been perfectly fine. Have you noticed it too and is it one of those unwritten rules, or is there a more formal explanation to it?  It seems like there was more verbs like that, but I am having a hard time remembering it now. If I do, I will edit the post and likely change the title to accommodate other verbs. How do I perform a redirect to a custom URL after login? I am trying to redirect users to a custom URL after they logged in, but my code doesn't work.  How do I redirect users after they logged in? I have 16GB RAM. Do I need 32GB swap? I read many places that the rule of thumb for swap space is to double the amount of physical RAM. However, 32 GB does seem a LOT. Do I need that much? Do I need it at all with this high amount of physical RAM? Notation for intervals I have frequently encountered both $\langle a,b \rangle$ and $[a,b]$ as notation for closed . I have mostly encountered $(a,b)$ for open intervals, but I have also seen $]a,b[$. I recall someone calling the notation with $[a,b]$ and $]a,b[$ as French notation.   What are the origins of the two notations?  Is the name French notation correct? Are they used frequently in France? Or were they perhaps prevalent in French mathematical community at some point? (In this  Bourbaki is mentioned in connection with the notation $]a,b[$.)      Since several answerers have already mentioned that they have never seen $\langle a,b \rangle$ to be used for closed intervals, I have tried to look for some occurrences for this. The best I can come up with is the article on , where these notations are called Czech notation and French notation. Using $(a,b)$ and $[a,b]$ is called English notation in that article. (I am from Central Europe, too, so it is perhaps not that surprising that I have seen this notation in lectures.) I also tried to google for  or . Surprisingly, this lead me to a  where this notation is used for open interval. Power Off button is gone on Ubuntu 20.04 LTS I recently installed Ubuntu 20.04 LTS on my laptop and I noticed that I no longer have the Power Off button but rather a menu that I need to click on and then I need to click on Power Off... and then Power Off. Is there a way to get the button back? Do file-extensions have any purpose (for the operating system)? Linux determines the type of a file via a code in the file-header. It doesn't depend on file-extensions for to know which software is to use for opening the file.  That's what I remember from my education. Please correct me in case I'm wrong!  Working a bit with Ubuntu systems recently: I see a lot of files on the systems which have extensions like .sh, .txt, .o, .c  Now I'm wondering: Are these extensions are meant only for humans? So that one should get an idea what kind of file it is?  Or does they have some purpose for the operating-system too? Replaced wrong car in garage in GTA Online how to sort by the day of the week? I have two files.  file1:  Dave 734.838.9800   Bob 313.123.4567   Carol 248.344.5576   Mary 313.449.1390   Ted 248.496.2204   Alice 616.556.4458      file2:  Bob Tuesday   Carol Monday   Ted Sunday    Alice Wednesday   Dave Thursday     Mary Saturday     I merged the two files.  file3 should look like this:  Name      On-Call     Phone   Carol     MONDAY      248.344.5576   Bob       TUESDAY     313.123.4567   Alice     WEDNESDAY   616.556.4458   Dave      THURSDAY    734.838.9800   Nobody    FRIDAY      634.296.3356   Mary      SATURDAY    313.449.1390   Ted       SUNDAY      248.496.2204     But I cannot get the weekdays to be in order. How do I go about doing that? What is the purpose of Microsoft.SharePoint.Runtime.dll in CSOM? I know we need to use Microsoft.SharePoint.Client and Microsoft.SharePoint.Client.Runtime dll's reference in .NET managed CSOM application development. But can someone help me understand why we have to use Microsoft.SharePoint.Client.Runtime and whats it's purpose, in detail. or point me to a reference please. Thank you in advance I know this proof is somewhat similar, or related to the Baire's Category Theorem but I can't seem to figure out how to do it.  The Baire Category theorem asserts that if X is a complete metric space or a locally compact Hausdorff space (my case), then the complement of a countable union of nowhere dense sets is always nonempty.  How can I use this on the proof? Is it possible to use a MacBook Pro as a second monitor for my iMac? Both of them have a Thunderbolt port.  If not, is there any other way? I am using Ubuntu 11.10 and my screensaver keeps coming on while I'm watching a movie.  I don't remember this happening in 11.04 and can't remember how to stop it? What is the command to remove all files but not directories? Let's say I have a directory tree like this:  FOLDER:     file1     file2     file3     Subfolder1:         file1         file2     Subfolder2:         file1         file2   If I used rm -r FOLDER/*, everything in FOLDER would be deleted including sub-directories. How can I delete all files in FOLDER and in its sub-directories without deleting actual directories? I have a text box that will have a currency string in it that I then need to convert that string to a double to perform some operations on it.   "$1,100.00" → 1100.00  This needs to occur all client side. I have no choice but to leave the currency string as a currency string as input but need to cast/convert it to a double to allow some mathematical operations. What exactly is nullptr? Is storing passwords hashed with the email more secure than without? What's that ship in the opening credits of 'Star Trek: Enterprise'?