Do I need a DSL splitter if my connection is internet only?
Is a DSL splitter required, if only a Modem is attached to the line?
Close vote review audit flawed - fails without casting vote Having just  from any of the queues, it was reviewing close votes; however, this audit was flawed in that I didn't even cast a close vote.  Often I press the Close button to preview greater detail and sentiment of the closure, spawning the Why should this question be closed dialog box:    Especially for duplicates, where functionality is solely dependent on spawning this dialog.  From Closing > Duplicate, I can search or view selected duplicates:    Although, I realize general closure reasons are summarized on the page:    This question had 6-upvotes, but seemed very localized referencing subjective query is "taking too long" and even had a sqlfiddle link.  Maybe overly broad regarding performance tuning, the OP was posting like a forum with two answer posts to his own question  and  with one of those answers asking follow-up questions.    Wanting to gauge community response, current closure totals struck my curiosity.  So, I pressed the Close button and boom - oh, the humanity!  I failed, and didn't even cast a close vote.    Votes are not cast until a reason for closure is selected and Vote to Close is pressed.  Taking any review very seriously on this site, it only seems fair that my review quality is tested through actionable steps instead of clicking for more detailed information, leveraging the functional design of the close vote user interface.  Sure, it's complex to seed fake vote totals, and then there's controversy of mindless voting in the majority or people who simply cherry pick 4-vote questions.  Still though, it seems unfair I should hesitate to review further information of vote totals and duplicates before skipping due to the implementation of this audit. Basically, I want to turn a continuous "1" into a short "1" pulse then "0". I'm new to logic gates, apologies if it's too obvious. Prove $(1-a)(1-b)(1-c)(1-d)\geq abcd$ if $a^2+b^2+c^2+d^2=1$ Let $a,b,c,d\geq0$, $a^2+b^2+c^2+d^2=1$ Prove $\displaystyle (1-a)(1-b)(1-c)(1-d)\geq abcd$ I mutiplied both with $\displaystyle (1+a)(1+b)(1+c)(1+d)$ to use $1-a^2=b^2+c^2+d^2$ and try using the cauchy-schwarz and holder but it is doesn't work. What happens when I hover over a link in Chrome? "It is not possible to check out a single file. The finest level of checkouts you can do is at the directory level."  How do I get around this issue when using Subversion?  We have this folder in Subversion where we keep all our images. I just want to check out one file (image) from that. This folder is really big and has ton of other stuff which I don't need now. A real $2 \times 2 $ matrix $M$ such that $$M^2 =  \begin{pmatrix} -1&amp;0 \\ 0&amp;-1-\epsilon  \\   \end{pmatrix}$$ (a) exists for all $\epsilon &gt; 0$. (b) does not exist for any $\epsilon &gt; 0$. (c) exists for some $\epsilon &gt; 0$. (d) None of the above is true.  Attempt: I couldn't think of any theory base to prove / disprove the existence of such a matrix. Could someone please give me a hint on how to go about this problem? Thank you very much for your help in this regard. What are the prerequisites for studying mathematical logic? I am looking to study mathematical logic, however, I find that introductory books are very daunting, which kind of disheartens me. You see, slowly but surely, I started to realize that the maths which I have learned did not just pop out of thin air, but is a collection of systems, which must of been developed via some other system, i.e, maths did not develop itself.  So I began to look into the origins of mathematics, and read that it was developed via a type of logic, which exists sort of by 'default', via a set of axioms, and then of course I looked up the definition of axioms.   So given that I'd be studying a type of logic whose origins are self evident axioms, naturally I believed there would be no prerequisites. However, in looking up mathematical logic, I have come across things such as Boolean algebra, sets, first order logic, some other type of logic, called 'traditional logic', as well as references to a sort of calculus, though not in a mathematical sense, I think.  So all in all, I am trying to develop a type of mental spider web, and I am trying to find out the strands which lye at the absolute bounds so that I may learn this mystique logic. Though I have no idea where to start.  Side note: This is the book I have started reading:   Credit goes to Wolfgang Rautenberg. Is phonetic typing for Tamil available in Ubuntu 12.04?  How can I install it? How can I install Whatsapp web app on Ubuntu? I found a similar question , but here I am asking for the WhatsApp desktop webapp so that I can directly access the application without opening a browser. A question I'm struggling with is to prove or disprove that the automorphism group of a finite cyclic group must be cyclic. I think the statement is false but have not been able to come up with a counterexample.  Thank you for any assistance you can provide. I'm looking for a word that can describe a person who does nice things for other people (e.g holding the door open, carrying someone's things) but only for self gain; this person only does nice things to make themselves look good in the eyes of others, but doesn't actually care about the well-being of the people they're helping. I want to achieve the exact same title page layout as the paper shown . For those that do not want to download the paper, the image of the title page is shown below:    The super-scripts indicating the authors doesn't have to be as shown in the example title page (e.g, a, b and c), other symbols are fine.  I am using the authblk package and know the general syntax such as:  \title{title of paper} \author[1]{author 1\thanks{details that goes into the footnote}} \author[1]{author 2\thanks{details that goes into the footnote}} \author[2]{author 3\thanks{details that goes into the footnote}} \affil[1]{university 1} \affil[2]{university 2} \renewcommand\Authands{ and } \maketitle  \begin{abstract} abstract goes here \end{abstract}   But I am not sure how to achieve the example title page shown. Any help would be appreciated! Finding the sum of the series $\frac{1}{1!}+\frac{1+2}{2!}+\frac{1+2+3}{3!}+ \ldots$ Deteremine the sum of the series $$\frac{1}{1!}+\frac{1+2}{2!}+\frac{1+2+3}{3!}+ \ldots$$  So I first write down the $n^{th}$ term $a_n=\frac{\frac{n(n+1)}{2}}{n!}=\frac{n+1}{2(n-1)!}$.  So from there I can write the series as $$1+\frac{3}{2}+\frac{4}{2\times 2!}+\ldots +\frac{n+1}{2(n-1)!}+\ldots $$  I am quite sure I can do some sort of term by term integration or differentiation of some standard power series and crack this. Any leads? What is the isomorphism between the fields $(Z_2[x]^{<3},+_{x^3+x^2+1},\times_{x^3+x^2+1})$ and $(Z_2[x]^{<3},+_{x^3+x+1},\times_{x^3+x+1})$? What are the antonyms of "append" and "prepend"? My current idea is to use the dual graph, and prove that that is a bipartite graph, and so proving the statement. But I can't seem to figure out how even degree for all verticies means that it is bipartite.  Any help is appreciated. Thanks! Any ideas how to display a PDF file in a WPF Windows Application?     I am using the following code to run the browser but the Browser.Navigate method does not do anything!  WebBrowser browser = new WebBrowser(); browser.Navigate("http://www.google.com"); this.AddChild(browser); // this is the System.Windows.Window Remove extra header lines from file, except for the first line I have a file that looks like this toy example.  My actual file has 4 million lines, about 10 of which I need to delete.  ID  Data1  Data2 1    100    100 2    100    200 3    200    100 ID  Data1  Data2 4    100    100 ID  Data1  Data2 5    200    200   I want to delete the lines that look like the header, except for the first line.  Final file:  ID  Data1  Data2 1    100    100 2    100    200 3    200    100 4    100    100 5    200    200   How can I do this? I have the following enumeration:  public enum AuthenticationMethod {     FORMS = 1,     WINDOWSAUTHENTICATION = 2,     SINGLESIGNON = 3 }   The problem however is that I need the word "FORMS" when I ask for AuthenticationMethod.FORMS and not the id 1.  I have found the following solution for this problem ():  First I need to create a custom attribute called "StringValue":  public class StringValue : System.Attribute {     private readonly string _value;      public StringValue(string value)     {         _value = value;     }      public string Value     {         get { return _value; }     }  }   Then I can add this attribute to my enumerator:  public enum AuthenticationMethod {     [StringValue("FORMS")]     FORMS = 1,     [StringValue("WINDOWS")]     WINDOWSAUTHENTICATION = 2,     [StringValue("SSO")]     SINGLESIGNON = 3 }   And of course I need something to retrieve that StringValue:  public static class StringEnum {     public static string GetStringValue(Enum value)     {         string output = null;         Type type = value.GetType();          //Check first in our cached results...          //Look for our 'StringValueAttribute'           //in the field's custom attributes          FieldInfo fi = type.GetField(value.ToString());         StringValue[] attrs =            fi.GetCustomAttributes(typeof(StringValue),                                    false) as StringValue[];         if (attrs.Length &gt; 0)         {             output = attrs[0].Value;         }          return output;     } }   Good now I've got the tools to get a string value for an enumerator. I can then use it like this:  string valueOfAuthenticationMethod = StringEnum.GetStringValue(AuthenticationMethod.FORMS);   Okay now all of these work like a charm but I find it a whole lot of work. I was wondering if there is a better solution for this.  I also tried something with a dictionary and static properties but that wasn't better either. Julian day of the year in Java