Constructive questions closed as not constructive
why are the best questions the ones which have been closed?
tl;dr : For SEO, should I redirect from one to the other or list both on the DNS records?    It seems that most experts think that both www and non-www should exist. (Please correct me if I'm wrong.) And Google Webmasters Tools lets you choose which is the main one.  But: will a redirect give all SEO weight to one of them instead of splitting it? (There are other search engines after all, so setting the main one in Google Webmasters Tools might not be enough.) Will having both on the DNS records give them more importance? No difference? I've been interested in non-standard analysis recently. I was reading up on it and noticed the following interesting comment on the , right after giving an example of a nonstandard differentiation:     The use of the standard part in the definition of the derivative is a rigorous alternative to the traditional practice of neglecting the square of an infinitesimal quantity... the typical method from Newton through the 19th century would have been simply to discard the $dx^2$ term.   I've never heard anything like this before, and really find it fascinating that Newton's method was to define the relation $dx^2 = 0$. If we actually formalize the above structure by taking $\mathbb{R}$ and adjoining an element $dx^2 = 0$ to it, we get the "dual numbers," isomorphic to the quotient ring $\mathbb{R}[x]/x^2$. I'd seen some things about how this algebra plays into automated differentiation algorithms for some computer software systems, but I've never heard anything about Newton directly working in this algebra. So I have a few questions:   Does anyone have more historical information on the way that Newton performed differentiation, and its relation to the dual numbers? Does anyone know how effectively real analysis can be formalized with the dual numbers? Does the resulting system play nice enough to develop all of the important modern results? If we start with $\mathbb{C}[x]/x^2$ instead, can we likewise develop complex analysis?   Since this idea is so simple, I'm very curious how powerful it is. I'm also curious if it has any major drawbacks too, since I'm not sure why anyone would mess with the foundational baggage involved in defining the hyperreals if this simple 2-dimensional real algebra could really do the trick. Why is FIFA against adding instant replay to the game? Is there any evidence or reason why FIFA is so against adding instant replay to soccer? I find myself seeing many unlucky or just plain wrong decisions made by refs that could be corrected with instant replay. WiFi not working Kubuntu 20.04 - Intel 8265 Network Interface Where is the ideal place to ask a MATLAB question? I created a interior scene and  i don't know how to bake a texture using cycles bake. We all know that $\sqrt[3]{3}\not\in \mathbb{Q}({\sqrt[3]{2}})$ intuitively. We even know that $\sqrt[3]{p}\not\in \mathbb{Q}(\sqrt[3]{q})$ for two distinct primes $p, q$. However, I don't know how to prove these things rigorously. In case of $\sqrt{p}\not\in \mathbb{Q}(\sqrt{q})$, we can just set assume $\sqrt{p}=a+b\sqrt{q}$ for some $a, b\in\mathbb{Q}$ and deduce a contradiction. However, in cubic case, expansion of $(a+b\sqrt[3]{2}+c\sqrt[3]{4})^{3}$ is very complicated and even I expand this I couldn't get any contradiction by this.  To be specific, it gives us 3 diophantine equations  $$a^{3}+2b^{3}+4c^{3}+12abc=3$$ $$a^{2}b+2b^{2}c+2c^{2}a=0$$ $$ab^{2}+2bc^{2}+ca^{2}=0$$  and I don't know how to check solvability of this kind of diophantine equations (over $\mathbb{Q}$). Even if there exists a way to check solvability, I cannot convince that it can be used to prove $\sqrt[3]{p}\not\in \mathbb{Q}(\sqrt[3]{q})$.   So I tried to use Galois theory, but actually I don't know where to go. I assumed $\mathbb{Q}(\sqrt[3]{3})=\mathbb{Q}(\sqrt[3]{2})$ and take a Galois closure, i.e. $K=\mathbb{Q}(\sqrt[3]{3}, w)=\mathbb{Q}(\sqrt[3]{2}, w)$ where $w^{3}=1$ then tried to use field norm maps. We can check that $\beta=\sqrt[3]{3}\cdot\sigma(\sqrt[3]{3})\cdot\sigma^{2}(\sqrt[3]{3})\in \mathbb{Q}$ when $\sigma\in Gal(K/\mathbb{Q}), \sigma(\sqrt[3]{2})=\sqrt[3]{2}, \sigma(w)=w^{2}$. But I cannot get any information from this.   Edit : It would be great if there is a simple algorithm to check whether $\alpha\in K$ or not for a given algebraic number $\alpha$ and a number field $K$. On all of the other SOFU sites a downvote means The question is unclear or not useful.  However, here on meta, a downvote has become a sign of I don't agree with the question, suggestion, feature request, bug, etc. being described in the question.   What does a downvote on Meta really mean? What other reasons do people downvote on Meta? Why is it okay for meta to redefine the meaning of the downvote?  The tooltips and instructions are all the same here on meta.   Note: I'm not saying I disagree with the practice, just curious. What is a primary decomposition of the ideal $I = \langle xy, x - yz \rangle$? Make Blender usable on high resolution screen What are the rules for China's visa-free transit programs? Easy way to write contents of a Java InputStream to an OutputStream I was surprised to find today that I couldn't track down any simple way to write the contents of an InputStream to an OutputStream in Java. Obviously, the byte buffer code isn't difficult to write, but I suspect I'm just missing something which would make my life easier (and the code clearer).  So, given an InputStream in and an OutputStream out, is there a simpler way to write the following?  byte[] buffer = new byte[1024]; int len = in.read(buffer); while (len != -1) {     out.write(buffer, 0, len);     len = in.read(buffer); } Why does my shell script choke on whitespace or other special characters? Or, an introductory guide to robust filename handling and other string passing in shell scripts.  I wrote a shell script which works well most of the time. But it chokes on some inputs (e.g. on some file names).  I encountered a problem such as the following:   I have a file name containing a space hello world, and it was treated as two separate files hello and world. I have an input line with two consecutive spaces and they shrank to one in the input. Leading and trailing whitespace disappears from input lines. Sometimes, when the input contains one of the characters \[*?, they are replaced by some text which is is actually the name of files. There is an apostrophe ' (or a double quote ") in the input and things got weird after that point. There is a backslash in the input (or: I am using Cygwin and some of my file names have Windows-style \ separators).   What is going on and how do I fix it? How do I turn on SharePoint App store in SharePoint 2013 I am getting this message when I want to add a app:     Sorry, apps are turned off. If you know who runs the server, tell them   to enable apps. Lost/Deleted dpkg (package manager for Debian). How do I get it back? OS: Ubuntu 12.04  Accidentally deleted dpkg. Now, packages can't be installed. So, needs an dpkg installer which installs packages. How can I get Firefox to open torrent files with Transmission? Every time I download a torrent file (.torrent), Firefox thinks I should open it with a text editor. How can I get it to open with Transmission? In Edit -> Preferences -> Applications, there's no setting for torrent files, and no apparent way to add a new filetype. Splicing a Javascript array from within the callback passed to forEach Fastest way to determine if an integer's square root is an integer I'm looking for the fastest way to determine if a long value is a perfect square (i.e. its square root is another integer):    I've done it the easy way, by using the built-in  function, but I'm wondering if there is a way to do it faster by restricting yourself to integer-only domain. Maintaining a lookup table is impractical (since there are about 231.5 integers whose square is less than 263).   Here is the very simple and straightforward way I'm doing it now:  public final static boolean isPerfectSquare(long n) {   if (n &lt; 0)     return false;    long tst = (long)(Math.sqrt(n) + 0.5);   return tst*tst == n; }   Note: I'm using this function in many  problems.  So no one else will ever have to maintain this code.  And this kind of micro-optimization could actually make a difference, since part of the challenge is to do every algorithm in less than a minute, and this function will need to be called millions of times in some problems.    I've tried the different solutions to the problem:   After exhaustive testing, I found that adding 0.5 to the result of Math.sqrt() is not necessary, at least not on my machine. The  was faster, but it gave incorrect results for n >= 410881.  However, as suggested by , we can use the FISR hack for n &lt; 410881. Newton's method was a good bit slower than Math.sqrt().  This is probably because Math.sqrt() uses something similar to Newton's Method, but implemented in the hardware so it's much faster than in Java.  Also, Newton's Method still required use of doubles. A modified Newton's method, which used a few tricks so that only integer math was involved, required some hacks to avoid overflow (I want this function to work with all positive 64-bit signed integers), and it was still slower than Math.sqrt(). Binary chop was even slower.  This makes sense because the binary chop will on average require 16 passes to find the square root of a 64-bit number. According to John's tests, using or statements is faster in C++ than using a switch, but in Java and C# there appears to be no difference between or and switch. I also tried making a lookup table (as a private static array of 64 boolean values).  Then instead of either switch or or statement, I would just say if(lookup[(int)(n&amp;0x3F)]) { test } else return false;.  To my surprise, this was (just slightly) slower. This is because . Embedding a link (or other html) in a JSF message If I run  export TEST=foo echo $TEST   It outputs foo.  If I run  TEST=foo echo $TEST   It does not. How can I get this functionality without using export or a script?