Consider this shell redirect: telnet towel.blinkenlights.nl &gt;&gt; starWarz when it ends, the session will break, detach from host or something like that. I want to know how long the connection lasts. How might I determine this?
I'm trying to measure the execution time of a process that I call via the command line (i.e., I want to find out how long it takes to for the process to finish). Is there any command that I can add to the command calling the process that will achieve this?
Compute $\lim_{x\to\infty}x\;\left[\left(1+\frac{1}{x}\right)^x-e\right]$ How can I compute the following limit, and is there a general method to resolve problems of this type?  $$\lim_{x\to\infty}x\left[\left(1+\frac{1}{x}\right)^x-e\right]$$ Duplicates of duplicates should be remapped I noticed today another example of duplicates of duplicates: that  (A) was closed as a duplicate of  (B), but one day later (B) was closed as duplicate of  (C). Sometimes I need to click many times from one question to another until I get to the master question.  I think that it's better if the question (A) is closed as duplicate of (C), and even if (B) has already (helpful) answers, (B) and (C) could be merged.  Is it possible to remap all duplicates to the master question, just like the tag synonyms? I'm testing an application which opens its own ports (acts as a server for these ports, hence listens at that ports) and where the same application connects to ports bound by other applications (acts as client for these ports).  I would like to get an overview as to which ports the application creates and to which applications and ports it connects to.  How can I do this? How to fix "Notification access is not available" on Android Go? What is the difference between IQueryable and IEnumerable? What is the difference between IQueryable&lt;T&gt; and IEnumerable&lt;T&gt;?    See also  that overlaps with this question. Let us say we have the following Makefile  include config.mk  # Generate summary table. results.txt : $(ZIPF_SRC) isles.dat abyss.dat last.dat     $(ZIPF_EXE) *.dat &gt; $@  # Count words. .PHONY : dats dats : isles.dat abyss.dat last.dat  %.dat : books/%.txt $(COUNT_SRC)     $(COUNT_EXE) $&lt; $*.dat  .PHONY : clean clean :     rm -f *.dat     rm -f results.txt   where all the variables are defined in config.mk  LANGUAGE=python COUNT_SRC=countwords.py COUNT_EXE=$(LANGUAGE) $(COUNT_SRC) ZIPF_SRC=testzipf.py ZIPF_EXE=$(LANGUAGE) $(ZIPF_SRC)   Is there any tool available that can expand all the include lines within the makefile so as to produce a bigMakefile? If such a tool does not currently exist, can a python/perl/awk/bash script be cooked up to achieve this goal? How do I achieve this kind of light star effect? I'm kinda new to Blender. Currently playing around with version 2.8 to practice some rendering. Is there a way to achieve this 'light-star' effect for the blooming objects with the emission? If there is an alternative way then it's fine too. See these images below for references. Thanks in advance: Deleting multiple elements from a list Is it possible to delete multiple elements from a list at the same time? If I want to delete elements at index 0 and 2, and try something like del somelist[0], followed by del somelist[2], the second statement will actually delete somelist[3].  I suppose I could always delete the higher numbered elements first but I'm hoping there is a better way. Cannot make a static reference to the non-static method How to allow to run su instantly after I added the user to the appropriate group I have the su executable with the following permissions:  bash-4.2# ls -la /bin/su -rws--s--- 1 root wheel 59930 Sep 14  2012 ./su   When I am logged in as a user, not in the wheel group and try to run su, I get an error, which is correct:  bash-4.2$ su bash: /bin/su: Permission denied   After that I add this user to wheel group from root:  bash-4.2# usermod -a -G wheel user   But for the same terminal session I still can't run su:  bash-4.2$ su bash: /bin/su: Permission denied   For the new sessions I can run su. How to allow to run su instantly after I added the user to the appropriate group? Drawing a large binary matrix as colored grid in TikZ let $x,y,z,w&gt;0$,show that $$(x+y)^3+(y+z)^3+(z+w)^3+(w+x)^3\ge 8(x^2y+y^2z+z^2w+w^2x)$$  it seem use AM-GM inequality to solve it,But I can't it,Thanks Find all solutions of the equation $n^m=x^2+py^2$ which satisfy the following properties Prove or disprove that,     There always exists a solution of the equation, $$n^m=x^2+py^2$$ with odd $x$ and $y$ and for all $m\geq k$ for some positive integral $k$. Here $p$ is an odd prime and $n\in 2\mathbb{N}$. Is $k$ dependent on $n$? If so then find a way to calculate the value of $k$.   This is basically one of my conjecture which I am trying to prove for quite sometime. Unfortunately, I have progressed very little in this problem. So far I have been only able to prove that for all $m\geq3$ , $n=2$ and $p=7$ there is always a solution of the equation meeting the constraints.   Any idea how to tackle the problem?    Update  After D. Burde's answer of the original problem (see below) I am now interested in finding all $(n,m,p)$ triplets such that the equation holds. Any ideas regarding this problem? Man creates miniature population on different time-scale; uses them to invent the 'absolute protection' dome Nginx Subdirectory returning 404 I currently have a bunch of working static files at the domain name khairulslt.me (from NameCheap). Recently, I've tried setting up a subdirectory (khairulslt.me/RGBGame) as seen in the code below; However, I keep getting 404 errors. What am i missing out?  server {    server_name khairulslt.me www.khairulslt.me;    autoindex off;   location / {     root /var/www/khairulslt.me;     index circles.html;   }   listen 443 ssl; # managed by Certbot ssl_certificate /etc/letsencrypt/live/khairulslt.me/fullchain.pem; # managed by Certbot ssl_certificate_key /etc/letsencrypt/live/khairulslt.me/privkey.pem; # managed by Certbot include /etc/letsencrypt/options-ssl-nginx.conf; # managed by Certbot ssl_dhparam /etc/letsencrypt/ssl-dhparams.pem; # managed by Certbot  location /RGBGame {     root /var/www/khairulslt.me/RGBGame;     index colorGame.html;     try_files $uri $uri/ /var/www/RGBGame/colorGame.html?q=$uri&amp;$args;     autoindex off;   }  location /robots.txt { return 200 "User-agent: *\nDisallow: /\n";    }  }   server { if ($host = www.khairulslt.me) {     return 301 https://$host$request_uri;   } # managed by Certbot   if ($host = khairulslt.me) {     return 301 https://$host$request_uri;   } # managed by Certbot   listen 80; server_name khairulslt.me www.khairulslt.me; return 404; # managed by Certbot }   I've tried all the different settings like (alias vs root), try_files, autoindex(on, off). My main website www.khairulslt.me works fine and is serving the html/css/js files in /var/www/khairulslt.me perfectly fine. I'm just not sure why I can't replicate the settings for my other app (html/css/js files in folder /RGBGame). Could it be that I've missed out something that isn't related to the nginx config? Student missing exam for “medical reasons” Why did Obi-Wan allow Leia to get adopted by such a high profile figure? I know that Leia is a princess because she was adopted by the Queen of Alderaan, but why would Obi-Wan allow this? Wasn't the original plan of Obi-Wan and Yoda to hide the Skywalkers from Palpatine? Luke was placed into a very low-profile position, being the child of two farmers on a backwater planet. However, Leia occupies a very important political position.  Is there any reason why Obi-Wan would do this if he was trying to hide her? Why do some Unicode text messages crash the iPhone OS? Showing that $Q_n=D_n+D_{n-1}$ Let $T_n$ be the set of permutations of $\{1,2,\ldots,n\}$ which do not have $i$ immediately followed by $i+1$ for $1\le i\le n-1$; in other words, let \begin{align} T_n=\{\sigma \in S_n: \sigma(i)+1\ne\sigma(i+1) \text{ for all } 1\le i\le n-1\} . \end{align} Let $Q_n$ be the number of elements of $T_n$.    Let $D_n$ be the number of  of $\{1,2,\ldots,n\}$.  It is not hard to show algebraically that $Q_n=D_n+D_{n-1}$, but I am having difficulty coming up with a combinatorial argument to show why this is true.  (I believe there are $D_{n-1}$ elements of $T_n$ that leave $n$ fixed, and $D_n$ elements of $T_n$ that move $n$, but I don't know how to justify this combinatorially.) I lost the source code from one project I did on the company I'm working for and haven't been able to find a Visual Basic 6 decompiler; does that even exists?  I only have the EXE that I've rescued from a user's machine.