What is the endpoint $P(x,y)$ of a line segment , if I know its starting point: $C(x(1), y(1))$, the gradient $G$, and its length $L$?
In a Cartesian system, I've got the slope, start point and distance of a line segment.  What's the formula to find the endpoint?
I have some section where user can upload CV and profile images,  I'm using the native attachment functions,  $attachment_cv_id = media_handle_upload( 'candidate_cv', 0 ); if ( ! is_wp_error( $attachment_cv_id ) ) {     // We link this file to the post      // add_post_meta( $result , 'wpcf-cv-file', wp_get_attachment_url($attachment_cv_id)); } else {     $submit_candidate_errors[] = lang("Hubo error subiendo la CV"); }   Is there any way I can hide this files from the media section in the wp-admin? ( perhaps changing its folder )  Thanks  -EDIT-  i'm trying like Dave suggested, adding a meta: 'rrhh-file'  $attachment_id = media_handle_upload( 'apply_file', 0 );  if ( ! is_wp_error( $attachment_id ) ) {     // The image was uploaded successfully!     add_post_meta($attachment_id, 'rrhh-file', true); }   And even that it has the attribute:  var_dump(get_post_meta(1200)); // last id I uploaded die();   Prints out:  array(4) {   ["_wp_attached_file"]=&gt;   array(1) {     [0]=&gt;     string(20) "2017/06/image001.jpg"   }   ["_wp_attachment_metadata"]=&gt;   array(1) {     [0]=&gt;     string(666) "a:5:{s:5:"width";i:523;s:6:"height";i:122;s:4:"file";s:20:"2017/06/image001.jpg";s:5:"sizes";a:2:{s:9:"thumbnail";a:4:{s:4:"file";s:20:"image001-150x122.jpg";s:5:"width";i:150;s:6:"height";i:122;s:9:"mime-type";s:10:"image/jpeg";}s:6:"medium";a:4:{s:4:"file";s:19:"image001-300x70.jpg";s:5:"width";i:300;s:6:"height";i:70;s:9:"mime-type";s:10:"image/jpeg";}}s:10:"image_meta";a:12:{s:8:"aperture";s:1:"0";s:6:"credit";s:0:"";s:6:"camera";s:0:"";s:7:"caption";s:0:"";s:17:"created_timestamp";s:1:"0";s:9:"copyright";s:0:"";s:12:"focal_length";s:1:"0";s:3:"iso";s:1:"0";s:13:"shutter_speed";s:1:"0";s:5:"title";s:0:"";s:11:"orientation";s:1:"1";s:8:"keywords";a:0:{}}}"   }   ["rrhh-file"]=&gt; // &lt;-- here   array(1) {     [0]=&gt;     string(1) "1"   }   ["_edit_lock"]=&gt;   array(1) {     [0]=&gt;     string(12) "1498731595:1"   } }   With this action this attachment still shows up in the media library  add_action( 'pre_get_posts', 'wpse_hide_cv_media_list_view' ); function wpse_hide_cv_media_list_view( $query ) {     // Bail if this is not the admin area.     if ( ! is_admin() ) {         return;     }      // Bail if this is not the main query.     if ( ! $query-&gt;is_main_query() ) {         return;     }      // Only proceed if this the attachment upload screen.     $screen = get_current_screen();     if ( ! $screen || 'upload' !== $screen-&gt;id || 'attachment' !== $screen-&gt;post_type ) {         return;     }      // Modify the query.     $query-&gt;set( 'meta_query', [         [             'key'     =&gt; 'rrhh-file',             'compare' =&gt; 'NOT EXISTS',         ]     ]);      return; }   Any idea what i'm missing? When I execute a program without specifying the full path to the executable, and Bash must search the directories in $PATH to find the binary, it seems that Bash remembers the path in some sort of cache. For example, I installed a build of Subversion from source to /usr/local, then typed svnsync help at the Bash prompt. Bash located the binary /usr/local/bin/svnsync for "svnsync" and executed it. Then when I deleted the installation of Subversion in /usr/local and re-ran svnsync help, Bash responds:  bash: /usr/local/bin/svnsync: No such file or directory   But, when I start a new instance of Bash, it finds and executes /usr/bin/svnsync.  How do I clear the cache of paths to executables? How can I fade tabs in & out with the Twitter Bootstrap framework? Monday morning mistake: sudo rm -rf --no-preserve-root / Please note: The answers and comments to this  question contains content from another, similar question that has received a lot of attention from outside media but turned out to be hoax question in some kind of viral marketing scheme. As we don't allow ServerFault to be abused in such a way, the original question has been deleted and the answers merged with this question.      Here's a an entertaining tragedy. This morning I was doing a bit of maintenance on my production server, when I mistakenly executed the following command:  sudo rm -rf --no-preserve-root /mnt/hetznerbackup /  I didn't spot the last space before / and a few seconds later, when warnings was flooding my command line, I realised that I had just hit the self-destruct button. Here's a bit of what burned into my eyes:  rm: cannot remove `/mnt/hetznerbackup': Is a directory rm: cannot remove `/sys/fs/ecryptfs/version': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/inode_readahead_blks': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/mb_max_to_scan': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/delayed_allocation_blocks': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/max_writeback_mb_bump': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/mb_stream_req': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/mb_min_to_scan': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/mb_stats': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/trigger_fs_error': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/session_write_kbytes': Operation not permitted rm: cannot remove `/sys/fs/ext4/md2/lifetime_write_kbytes': Operation not permitted # and so on..   I stopped the task and was relieved when I discovered that the production service was still running. Sadly, the server no longer accept my public key or password for any user via SSH.  How would you move forward from here? I'll swim an ocean of barbed wire to get that SSH-access back.  The server is running Ubuntu-12.04 and hosted at Hetzner. Studying from Roman's Advanced Linear Algebra, I want to prove that $$U^* \otimes V^* \cong (U \otimes V)^* \cong \hom(U,V;\mathbb{F})$$ The author proves that $U^* \otimes V^* \cong (U \otimes V)^*$ by showing that there is an unique linear transformation   $$\theta:U^* \otimes V^* \to (U \otimes V)^*$$  defined by $\theta(f \otimes g)=f \odot g$ where $(f \odot g)(u \otimes v)=f(u)g(v)$  I want to prove that $U^* \otimes V^* \cong \hom(U,V;\mathbb{F})$. I tried to use the universal property by fixing $f \in U^*, g\in V^*$ and defining $S: U^*\times V^* \to \hom(U,V;\mathbb{F})$ as $S(f,g)=F_{f,g}$, where $F_{f,g}(u,v)=f(u)g(v)$, but I got stuck. Increase progress bar each second -- error Can Quantum Entanglement and Quantum Superposition be considered the same phenomenon? Quantum entanglement is known to be the exchange of quantum information between two particles at a distance, while quantum superposition is known to be the uncertainty of a particle (or particles) being in several states at once (which could also involve the exchange of quantum information for a particle that is known to be in several locations simultaneously).  I was wondering if all of this was nothing more but the exchange of quantum information between different masses, and if this could clear up all the confusion in terms of how quantum systems connect in this field of science.  A clear explanation for how both of these quantum phenomena work, and if they really are connected (the exchange of quantum information?) would be much appreciated. MySQL Error 1093 - Can't specify target table for update in FROM clause I have a table story_category in my database with corrupt entries. The next query returns the corrupt entries:  SELECT *  FROM  story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category INNER JOIN         story_category ON category_id=category.id);   I tried to delete them executing:  DELETE FROM story_category  WHERE category_id NOT IN (     SELECT DISTINCT category.id      FROM category        INNER JOIN story_category ON category_id=category.id);   But I get the next error:      #1093 - You can't specify target table 'story_category' for update in FROM clause    How can I overcome this? Moving linux install to a new computer I know that it can, in some circumstances, be difficult to move a Windows installation from one computer to another (physically move the hard drive), but how does that work on linux? Aren't most of the driver modules loaded at bootup? So theoretically would it be that much of a hassle?  Obviously xorg configs would change and proprietary ATI drivers and such would have to be recompiled (maybe?). Is there more to it than I'm thinking of?  Assume the 2 computers are from the same era, ie both i7s but slightly different hardware.  Update: Thanks for the answers. This is mostly for my own curiosity. I have my linux system up and running at work, but eventually I'd like to move to a computer that I can get dual video cards into so I can run more than 2 monitors. But not any time soon just wondering if anyone has ever tried embedding and actually integrating any js engine into the .net environment. I could find and actually use (after a LOT of pain and effort, since it's pretty outdated and not quite finished) spidermonkey-dotnet project. Anyone with experience in this area? Engines like SquirrelFish, V8..   Not that I'm not satisfied with Mozilla's Spidermonkey (using it for Rails-like miniframework for custom components inside the core ASP.NET application), but I'd still love to explore a bit further with the options. The command-line solutions are not what I'd need, I cannot rely on anything else than CLR, I need to call methods from/to JavaScript/C# objects.  // c# class public class A {     public string Hello(string msg)     {         return msg + " whatewer";     } }  // js snippet var a = new A(); console.log(a.Hello('Call me')); // i have a console.log implemented, don't worry, it's not a client-side code :)   Just to clarify - I'm not trying to actually program the application itself in server-side javascript. It's used solely for writing custom user subapplications (can be seen as some sort of DSL). It's much easier (and safer) to allow normal people programming in js than C#. Ramanujan log-trigonometric integrals I discovered the following conjectured identity numerically while studying a family of related integrals.  Let's set $$ R^{+}:=  \frac{2}{\pi}\int_{0}^{\pi/2}\sqrt[\normalsize{8}]{x^2 + \ln^2\!\cos x} \sqrt{ \frac{1}{2}+\frac{1}{2}\sqrt{ \frac{1}{2}+ \frac{1}{2}  \sqrt{ \frac{\ln^{2}\!\cos x}{ x^2 + \ln^2\! \cos x}}}}\,\mathrm{d}x, \tag1 $$ $$ R^{-}:=  \frac{2}{\pi}\int_{0}^{\pi/2}\frac{1}{\sqrt[\normalsize{8}]{x^2 + \ln^2\!\cos x}} \sqrt{ \frac{1}{2}+\frac{1}{2}\sqrt{ \frac{1}{2}+ \frac{1}{2} \sqrt{ \frac{\ln^{2}\!\cos x}{ x^2 + \ln^2\! \cos x}}}}\,\mathrm{d}x. \tag2 $$ We may numerically observe with at least 500 digits of precision that $$  \begin{align} &amp; R^{+}R^{-} \stackrel{?}{=}1 \tag 3 \\\\ &amp; R^{+} \stackrel{?}{=} \sqrt[\normalsize{4}]{\ln 2} \tag4 \\\\ &amp; R^{-} \stackrel{?}{=}\frac{1}{\sqrt[\normalsize{4}]{\ln 2}}. \tag5 \end{align} $$  How can we prove it?  A version of this has been sent to Eric Weisstein, these integrals are on Mathworld as . I used MiKTeX 2.9 on windows. I have downloaded a package I want to install from the internet (manually, not through MiKTeX). The archive (*.lmza) containing the package was saved to a directory on my C:\ drive. Through MikTeX -> Maintenance -> Settings -> Packages -> Change... I can select the directory in which I have saved the archive containing the package. However, if I choose Packages shall be installed from a directory and choose the location of the package, I get this error message: C:\my\package\is\here does not seem to be a local package repository. What does it take for a directory/folder to become a local package repository? How do you get git to always pull from a specific branch? Why do statisticians discourage us from referring to results as "highly significant" when the $p$-value is well below the conventional $\alpha$-level of $0.05$?  Is it really wrong to trust a result that has 99.9% chance of not being a Type I error ($p=0.001$) more than a result that only gives you that chance at 99% ($p=0.01$)? Let $S = \{1,2,\dots,n\}$. Then $i \in S$ is said to be a fixed point of a permutation $p$ or $S$ if $p(i) = i$. Let $P_n(k) $ be the number of permutations of $S$ which have $k$ fixed point. Prove that $\sum_{k=0}^nk\cdot P_{n}(k) = n!$. I am an international student in the US (important as my stay in US is tied to my student visa, issued to attend my current university).  I joined as a grad student in the MS CS program in one of the okayish public universities (ranked ~50 on QS/US news). I joined in Fall '18 and am still in my first semester. I took all the so-called "difficult" courses, but I find them very trivial (considering my undergrad was from a very good university). I am very disappointed with the curriculum and feel the coursework is not at all rigorous for a grad-school.  I might sound super arrogant, but I feel out-of-place when I talk to other students and hear them cringe about how hard the courses are, or how they don't have enough time to finish assignments within the deadlines as I find all of the coursework very trivial and feel that the assignments are a joke.   Fortunately, I am working with one of the best profs the university has to offer on a very impactful project and the research is going great. But that's the only plus point I see from sticking around.  My aim from grad school is to get research experience and join one of the Big 4s or upcoming CS unicorn startups. I cannot see myself joining one of the Big-Ns after graduating since the students from this school rarely bag a Google/Fb/unicorn startup job.  Since December is the Fall'19 admissions deadline, I am thinking about reapplying to those top 10 CS schools which I couldn't get into last year (probably because of my poor undergrad GPA).   On the other hand, since every CS company just asks leetcode-style questions in interviews, I can just be super good at it and try to nail whatever interview I get without wasting another year and then doing the same.  I'm not really interested in any kind of credit transfer either since I would like to start fresh in a more rigorous curriculum.  I'm not sure if switching schools would be a wise decision and could really use some advice from the community here.  PS :  Probably related -   Posting with a dummy account for anonymity. How can I uninstall software? returning a local variable from function in C Proof by Induction: For any integer $n > 0$, $3|(5^{2n} − 1)$. Is there any difference in proving "for any integer $n &gt; 0$, $3|(5^{2n}-1)$" and proving "for any integer $n \ge 0$, $3|(5^{2n} -1)$"? Or are they the same? See screenshot:    Curiously, there are older badge achievement messages further down the list which display properly.