One thing that bugs me when using the mobile site is you can't see the views of a question anywhere (even though you can rank questions by views on your profile!). Can this be added somewhere?
I'm using an iPhone, but I would imagine it's the same for other mobile devices as well.  If you browse to any stack exchange site, you get a very well made mobile site.  The only gripe that I have is that I can't find any way to view the number of visitors to my questions?  Am I missing something or could this possibly be integrated into the mobile renderer?
How many permutations of $\{1, \ldots, n\}$ exist such that none of them contain $(i, i+1)$ (as a sequence) for $i \in {1,...,(n-1)}$? Teleporting a player from the overworld to the end Is there any way to teleport a player from the overworld to the end?   Or a way of teleporting a player to a random enderman in the end? I tried this:  find . -type f -size 128 -exec mv {} new_dir/  \;   Which didn't work, and it didn't give me an error. Here is an example of what the file looks like, when using stat -x  $ stat -x ./testfile | grep Size    Size: 128          FileType: Regular File Prediction based on bayesian model I have created a bayesian model that estimates 6 parameters using rjags from R. Now i want to do some predictions based on new data in R. Can anyone help me with an example.  model {    B.m[1] &lt;- Kb # mean B[1]    B[1] ~ dnorm( B.m[1], tau_B)    for(t in 2 : 10) { # Process model       B.m[t]&lt;- max( B[t-1] + rB[t-1](1 -B[t-1]/K) - C[t-1] , 0.0)       B[t] ~ dnorm(B.m[t], tau_B) } # Observation mode       for (t in 1: 10) {          LogC_mean[t] &lt;- log( max(qsegB[t]Eff[t], 0.000001))          C[t] ~ dlnorm(LogC_mean[t], tau_c) } # Prior          b~dbeta(1, 1)          cv &lt;- 1          K.mean &lt;- 500000          K.v &lt;- pow(cvK.mean, 2)          K.tau &lt;- 1/K.v          K ~ dnorm(K.mean, K.tau)          r ~ dlnorm(0.0, 1.4)          qseg ~ dlnorm(-15.4, 1.44)          tau_c ~ dgamma(0.001,0.001)          tau_B ~ dgamma(0.01,0.01)        }     } How can I monitor all and any Internet traffic from my home PC? I would like to monitor all and any Internet traffic from my home PC to see what programs installed on my home machine are accessing the Internet.  I thought I could use  for this, but I noticed Firefox traffic doesn't show up by default; you need .  What options do I have to monitor all traffic? Conformal Maps onto the Unit Disc in $\mathbb{C}$ If you multiclass a Warlock and a Sorcerer, then you have a character with both the Spellcasting and Pact Magic features.  PHB Page 101, Sorcerer, Spellcasting, Spell Slots:     You regain all expended spell slots when you finish a long rest.   PHB Page 107, Warlock, Pact Magic, Spell Slots:     You regain all expended spell slots when you finish a short or long rest.   PHB Page 165, Customization Options, Multiclassing, Class Features:     Pact Magic. If you have both the Spellcasting class feature and the Pact Magic class feature from the warlock class, you can use the spell slots you gain from the Pact Magic feature to cast spells you know or have prepared from classes with the Spellcasting class feature, and you can use the spell slots you gain from the Spellcasting class feature to cast warlock spells you know.   Do the spell slots keep their previous method of recovery (sorcerer slots long rest, warlock slots any rest), or do they all act consistently as I am led to believe from the language of the multiclass section? Do they all recover only from long rests as per the sorcerer feature, or can they all be recovered with a short rest because the warlock feature says so? Inequality with complex numbers Consider the following problem.  Fix $n \in \mathbb N$. Prove that for every set of complex numbers $\{z_i\}_{1\le i \le n}$, there is a subset $J\subset \{1,\dots , n\}$ such that   $$\left|\sum_{j\in J} z_j\right|\ge \frac{1}{4\sqrt 2} \sum_{k=1}^n |z_k|.$$  I believe I proven have a stronger statement. Is this proof correct, and if so, what is the optimal constant?  My proof. Consider all the $z_i$ with positive real part. Call the real part of the sum of these numbers $X^+$. In a similar way, form $X^-$, $Y^+$, and $Y^-$. Without loss of generality, let $X^+$ have the greatest magnitude of these.  Note that because $|\operatorname{Re}(z)|+|\operatorname{Im}(z)|\ge |z|$, we have  $$ \left(\sum_{k=1}^n  |\operatorname{Re}(z_k)|+|\operatorname{Im}(z_k)| \right) \ge \sum_{k=1}^n |z_k|.$$  But note that $\sum \limits_{k=1}^n  |\operatorname{Re}(z_k)|+|\operatorname{Im}(z_k)| = X^+ + |X^-|+ Y^+ +|Y^-|$, so we have  $$ 4X^+ \ge \sum_{k=1}^n |z_k|.$$ By choosing $J$ to be the set of complex number with positive real part, this proves a stronger statement, because the factor of $1/\sqrt 2$ isn't needed. Converting mobi files to pdf files I have a Hanlin V3+ e-book, unfortunately it crashes too often when reading mobi files, so I want to convert them first into pdf, and then read pdf on V3+. Is there any tool for converting mobi files to pdf files? Thanks. Why is compactness so important? I've read many times that 'compactness' is such an extremely important and useful concept, though it's still not very apparent why. The only theorems I've seen concerning it are the Heine-Borel theorem, and a proof continuous functions on R from closed subintervals of R are bounded. It seems like such a strange thing to define; why would the fact every open cover admits a finite refinement be so useful? Especially as stating "for every" open cover makes compactness a concept that must be very difficult thing to prove in general - what makes it worth the effort?  If it helps answering, I am about to enter my third year of my undergraduate degree, and came to wonder this upon preliminary reading of introductory topology, where I first found the definition of compactness. How to let `dpkg -i` install dependencies for me? Say, I have foo-1.2.3.deb which depends on perl and python, however, running command:  dpkg -i ./foo-1.2.3.deb   won't install these dependencies. So I must apt-get install perl python by hand.  How to make dpkg -i install these dependencies for me automatically? How to clear Chocolatey cache in the free version? Installation-file-cleaning is currently only available in  () and .  The package installation files can easily take gigabytes of storage space and to my knowledge they only increase in size as the user updates packages and installs new software, with only your hard drive capacity as the upper limit.   I don't know if Chocolatey stores cache in one central location — something is saved to ~\AppData\Local\Temp but the majority is located in the lib* folders in ~\ProgramData\chocolatey. Also the log files in the logs folder total to over 100 MB on my system. Is there any way to fully clear Chocolatey cache without manually deleting directories? What is the definition of "creature" and is it used consistently? SMTP 25 closed even though I allow everything in firewall (Debian server running sendmail) I am running sendmail + dovecot in my Debian server. I have enabled the firewall rules to allow everything:   iptables -P INPUT ACCEPT   iptables -P OUTPUT ACCEPT   iptables -P FORWARD ACCEPT   iptables -F   iptables -X  However after a quick check at yougetsignal.com, my port 25 is still being blocked. But 143, 80 are okay. Let $E_n$ be $$E_n:=\{f\in C[0,1]\mid \text{exist } x_f\in[0,1] \text{ such that } |f(x)-f(x_f)|\leq n|x-x_f|,\, \forall x\in[0,1]\}.$$  How show that $E_n$ is nowhere dense, that is, $\mathrm{int}\  \overline{E_n} = \emptyset$?  Can someone help me? Can't use method return value in write context Amazon RDS I/O requests - 1 query = 1 billable I/O? I have an InnoDB database that I'd like to migrate onto Amazon RDS.  My current implementation, hosted on my own server, shows roughly 8M queries per month.   say that  I/O Rate    $0.10 per 1 million requests  Does 1 I/O = 1 query?  ie, will I be billed $80/mo for this amount of usage + the RDS fees? Prove by induction that $n! > n^2$ How does one prove by induction that  $n! &gt; n^2$  for $n \geq 4$ Execute function when post is published I try to use this function i have created when a post is published for the first time.  function a_new_post($post){   $post_id = $post-&gt;ID;    if ( !get_post_meta( $post_id, 'firstpublish', $single = true ) ) {       // ...run code once       update_post_meta( $post_id, 'firstpublish', true );   } } add_action( 'draft_to_published', 'a_new_post' );   I can't see anything wrong with it, but when i try to create some sample posts i check the database and the field "firstpublished" has not been created.  Does anyone see anything wrong? Is it ethical to omit the PhD credential from my resume? I am applying for a Statistical Programmer position at a commercial research organization (CRO), and I am wondering if it is unethical to omit my PhD in Statistics from my resume?  All of my degrees (Bachelor's, Master's, PhD) are in Statistics, and I am just wondering if it would be ethical to just list my Bachelor's and Master's degree on my resume, and indicate my experience as a RA while I was a PhD student as my "work experience"? (Since this Statistical Programmer position only requires Master's degree plus some years of experience)  I am asking this question because I do not want to do anything unethical/cause me troubles later on.