How can i set Service mssql-server to start on boot       root@ubuntu-s-1vcpu-2gb-lon1-01:/etc/init.d# update-rc.d  mssql-server enable update-rc.d: error: cannot find a LSB script for mssql-server root@ubuntu-s-1vcpu-2gb-lon1-01:/etc/init.d# update-rc.d system.ctl mssql-server enable usage: update-rc.d [-n] [-f] &lt;basename&gt; remove        update-rc.d [-n] &lt;basename&gt; disable|enable [S|2|3|4|5]                 -n: not really                 -f: force  The disable|enable API is not stable and might change in the future. root@ubuntu-s-1vcpu-2gb-lon1-01:/etc/init.d# update-rc.d system.ctl mssql-server -f usage: update-rc.d [-n] [-f] &lt;basename&gt; remove        update-rc.d [-n] &lt;basename&gt; disable|enable [S|2|3|4|5]                 -n: not really                 -f: force
how to auto start or enable service on next boot up or start up? in ubuntu 16.04 lts how to start or enable service on the next boot up or start up? in ubuntu 16.04 lts  without doing it manually enable or start services again everytime i start up or boot up the ubuntu 16.04 lts  thank you
Suppose $G$ is a finite group and I know for every $k \leq |G|$ that exactly $n_k$ elements in $G$ have order $k$. Do I know what the group is? Is there a counterexample where two groups $G$ and $H$ have the same number of elements for each order, but $G$ is not isomorphic to $H$? I suspect that there is, but I haven't thought of one. Why are some galaxies flat? What is the explanation for the flatness of some galaxies?   (If it's due to their rotation then why they are rotating, why some other galaxies are not flat etc., I would like to hear a nice and complete answer :) ) Why does the C++ map type argument require an empty constructor when using []? Yesterday, I have received two : Revival, and Self-Learner. However I was only notified of the Revival badge, because apparently the Self-Learner badge is not considered "".  What badges have their notification suppressed if the user has a 200-rep account somewhere on the Stack Exchange network, i.e. they won't trigger a new item in our achievements dialog? Why do most 2D platformers start off in the left and progress in the right direction? In almost all 2D platformers I've played, your avatar always starts off on the left side of the world, and continues on to the right. Is there something designers gain by doing this? Split string containing command-line parameters into string[] in C# I have a single string that contains the command-line parameters to be passed to another executable and I need to extract the string[] containing the individual parameters in the same way that C# would if the commands had been specified on the command-line. The string[] will be used when executing another assemblies entry-point via reflection.  Is there a standard function for this? Or is there a preferred method (regex?) for splitting the parameters correctly? It must handle '"' delimited strings that may contain spaces correctly, so I can't just split on ' '.  Example string:  string parameterString = @"/src:""C:\tmp\Some Folder\Sub Folder"" /users:""abcdefg@hijkl.com"" tasks:""SomeTask,Some Other Task"" -someParam foo";   Example result:  string[] parameterArray = new string[] {    @"/src:C:\tmp\Some Folder\Sub Folder",   @"/users:abcdefg@hijkl.com",   @"tasks:SomeTask,Some Other Task",   @"-someParam",   @"foo" };   I do not need a command-line parsing library, just a way to get the String[] that should be generated.  Update: I had to change the expected result to match what is actually generated by C# (removed the extra "'s in the split strings) If I have example.com, and blog.example.com, do search engines see those as one site or two? Will using subdomains hurt SEO? I have some technical reasons why I can't use example.com/blog. Is there a difference in ++i and i++ in a for loop? Is it simply a syntax thing? This thing came up in a combinatorics course I am taking.  Choose a fixed set of primes $p_1,p_2,\dots,p_k$ and let $A_n$ be number of integers in $\{1,2,\dots,n\}$ which are not divisible by any of the $p_i$'s. $A_n$ is given by $ n - \sum_{1\leq i_1 \leq k} \lfloor \frac{n}{p_{i_1}} \rfloor + \sum_{1\leq i_1 &lt; i_2 &lt; k} \lfloor \frac{n}{p_{i_1}p_{i_2}}\rfloor - \dots $. Now, if $n$ is divisible by each of the $p_i$'s then we have the simpler expression : $A_n = n \prod_{i=1}^{k}(1-\frac{1}{p_i})$(added later : note I am not assuming $n = \prod_{i=1}^{k}p_i$ here, this holds true whenever $n = c \prod_{i=1}^{k} p_i $ for some integer c, since each $\lfloor \frac{n}{p_{i_1} \dots p_{i_j}} \rfloor = \frac{n}{p_{i_1} \dots p_{i_j}}\ )$.  Another student pointed out that even if $n$ does not have $\prod_{i=1}^{k} p_i$ as a factor, the approximation $B_n = n \prod_{i=1}^{k}(1-\frac{1}{p_i})$ to $A_n$ is quite close in some specific cases. It is easy to see that $\lim_{n\to\infty}\frac{A_n - B_n}{n}=0$ as $\lim_{n\to\infty}\frac{1}{n}\lfloor \frac{n}{p_{i_1}p_{i_2}\dots p_{i_j}} \rfloor \to \frac{1}{p_{i_1}p_{i_2} \dots p_{i_j}},$ however that is not strong enough to imply that $A_n - B_n$ will be always close. Is there any way to analyze how well this approximation will perform in general? I am interested in the worst case for small to moderately sized $n$.  Just to give a feel of how close $A_n$ and $B_n$ can get, assuming the set of primes is $\{2,3,7\}$ we have (assuming my program is correct):  n     A(n)     B(n) 17    5    4.86   27    8    7.71   37    11      10.57   107   31      30.57   1111  318     317.43   3001  858     857.43   4007  1145    1144.86   5000  1429    1428.57 . To be specific, I have an event table that logs when a user joins or leaves a team.  It looks something like the following:  ------------------------------------- | user | event  | team | timestamp | ------------------------------------- | A    | joined | 1    | 2016-1-1  | | B    | joined | 1    | 2016-1-1  | | C    | left   | 1    | 2016-1-1  | | C    | joined | 2    | 2016-1-1  | | A    | left   | 1    | 2016-1-2  | | A    | joined | 2    | 2016-1-2  | | B    | left   | 1    | 2016-1-3  | | A    | left   | 2    | 2016-1-3  | -------------------------------------   I need to restructure this in a view to look something like the following  -------------------------------------- | user | team | joined    | left     | -------------------------------------- | A    | 1    | 2016-1-1  | 2016-1-2 | | A    | 2    | 2016-1-2  | 2016-1-3 | | B    | 1    | 2016-1-1  | 2016-1-3 | | C    | 1    | null      | 2016-1-1 | | C    | 2    | 2016-1-1  | null     | --------------------------------------   How can I achieve this?  For more detail, I'm attempting to do this in Amazon Redshift (PostgreSQL) We are having issues with our exchange 2013 server. The server is running Windows Server 2008 R2 Standard.  The issue we're having is that our Exchange server isn't receiving internet emails. It can currently send mail out to internet addresses, and send and receive internal emails from the current email server. I have checked the settings of the receive connectors and everything seems correct. We have tried everything that we can think of.   We can send and receive email locally, and send out to a gmail account. However, we don't get the reply email from the gmail account to the inbox.    Thanks in advance!! Image is of the DNS settings on the exchange server. I'm sure this is a newbie question, but I can't figure this out. I have tried to follow the advice here:  and here:   But I can not seem to be able to generate any font change. I either get no change or error messages.  Here is the output of one failed attempt to change the font to Times using this command:  \rmfamily \renewcommand{\rmdefault}{ptm}     Apparently I either don't have a correct package installed or...  The output says " Metric (TFM) file not found." but I am not sure where to go from there. I always thought water sources were called taps in kitchens, bathrooms etc, but a Google search only returned outdoor taps.  So my question is, what are indoor taps really called? Like this one: A novel where a woman from "future" of 1999 speaks leet-speak Estimating the intersection of two lines I have two datasets, A and B, of weighted (x,y) pairs. I computed the best fit lines, L_A and L_B, respectively, of these datasets, and then computed the intersection of these two lines, (x*,y*).  Now, A and B are drawn from random distributions (of the form y=mx+b+e, where e is a normally distributed error term). I'd like to compute a confidence interval around x*. How can I do this?  A naive approach I tried involved computing confidence intervals for the slope/intercept estimates of L_A and L_B, generating approximate distributions for those 4 parameters, and repeatedly randomly sampling from these distributions. But a given line's slope and intercept estimates are not independent of each other, and I wasn't sure how to salvage this approach to account for that. Accumulation Points for $S = \{(-1)^n + \frac1n \mid n \in \mathbb{N}\}$ I was recently asked to find the accumulation points of the set $$S = \{(-1)^n + \frac{1}{n} \mid n \in \mathbb{N}\}$$  I answered that the accumulation points are $\{-1,1\}$, because despite the fact that $\frac{1}{n}$ diverges, we can still use $\frac{1}{n}$ to find an element arbitrarily close to either $1$ or $-1$, i.e. to show that there is an element in an arbitrarily small neighborhood of $1$ or $-1$. (No proof was required for this question --- this is my intuition.)  Am I right at all? How to find windows 10 activation Key Where can it be find?  At activation panel i can only find option to change the activation key. The current key is not presented on this screen. How to validate an email address in JavaScript Is there a regular expression to validate an email address in JavaScript? What is the use of percent signs (%) at the end of lines? (Why is my macro creating extra space?) I see that the code in many packages and examples contains percent signs % at the end of (many) lines. What are they used for? Do they affect the parsing of those lines? How to install updates via command line? When I log into my web server via SSH I see the information:  88 packages can be updated. 80 updates are security updates   I tried apt-get update then apt-get upgrade but each time I log in I still see the message about updates. How do I install them?