I am considering purchasing Star Wars Battlefront (the new one from DICE), and saw that it had a split-screen mode. Is this only available when doing the "Missions" or can you play in split-screen in the multiplayer modes too?
How many players can play split-screen, and what game modes are (or aren't) available?   How many players can play local co-op? How many players can play local multiplayer? How many players can play online multiplayer from a single console?
Where does the extra kinetic energy of the rocket come from? Does there exist an $a_0$ such that the sequence $a_{n+1} = 2a_n + 1$ is prime for all $n \ge 0$? Request of a domain with no virtualhost in apache ends to default virtualhost If I ask Apache for domain.com that has no Virtual Host setup in Apache configuration, Apache will show the default Virtual Host. How can I prevent this from happening or simply drop the connection? How can I get a views exposed filter to persist across multiple views? I have 2 separate views that return a set of results for each of my content types. The fields are different, but the filters are exactly the same - Sort by Location / Distance. This Distance / Proximity filter is exposed, and it is set to 'remember' the last entry. I followed the tutorial here  to be able to filter results by distance. It works great.  In views, to remember the last entry, Views uses sessions. But, each view has its own individual $_SESSION variable. That means what I set for one view does not carry over to the next, and even each view can have different values, which is not what I want. Here is a dump of the session after they have been set:  [views] =&gt; Array     (         [search_pages] =&gt; Array             (                 [default] =&gt; Array                     (                     )              )          [baby_clothes_pages] =&gt; Array             (                 [default] =&gt; Array                     (                         [distance] =&gt; Array                             (                                 [postal_code] =&gt; 11211                                 [search_distance] =&gt; 100                                 [search_units] =&gt; mile                             )                      )              )          [baby_gear_pages] =&gt; Array             (                 [default] =&gt; Array                     (                         [distance] =&gt; Array                             (                                 [postal_code] =&gt; 22343                                 [search_distance] =&gt; 100                                 [search_units] =&gt; mile                             )                      )              )      )   What I would like to do is create a small module or snippet of code that will simply allow someone to type in their 5 digit zip code and then it update all the values across all my pages with this filter. If it is changed on any page, then it changes it for the rest of the pages as well. It also needs to work so that it affects the results on the next page load so that it correctly shows them filtered.  Here is a snippet of code I was experimenting with to try to set this value, but it's the wrong direction.   $all_views = views_get_all_views();            // get an array of all views in use on the site  foreach ($all_views['category_pages']-&gt;display as $key =&gt; $value) {  //check to see if the structure exists I am looking to modify if(array_key_exists('postal_code', $all_views['category_pages']-&gt;display[$key]-&gt;display_options['filters']['distance']['value'])) {  //if so, set its value $all_views['category_pages']-&gt;display[$key]-&gt;display_options['filters']['distance']['value']['postal_code'] = '28152';  //try setting the session instead $_SESSION['views']['category_pages'][$key]['distance']['postal_code'] = '28152';     }   What's the correct direction? How do I get this value changed? Could it be done in the template.php file with preprocess function? Should I do it in a module, and if so, what do I need to alter?  Very lost at this point. Thanks for the direction! Embedding $S_n$ into $A_{n+2}$ I am trying to prove that for all $n$, $S_n$ is isomorphic to a subgroup of $A_{n+2}$.  Say $S_n$ acts on $\{\alpha_1,...,\alpha_n\}$ and $A_{n+2}$ acts on $\{\alpha_1,...,\alpha_n,\alpha_{n+1},\alpha_{n+2}\}$.  Let $\sigma \in S_n$ and let $\phi: S_n \to A_{n+2}$ be given by $\phi(\sigma)=\sigma$ if $\sigma$ is an even permutation, and $\phi(\sigma)=\sigma(\alpha_{n+1}\alpha_{n+2})$ if $\sigma$ is an odd permutation.  This way $\phi(\sigma) \in A_{n+2}$.  Now, let $\sigma, \rho \in S_n$.  Then $\phi(\sigma \rho)=\sigma \rho (\alpha_{n+1}\alpha_{n+2})$.  Also, $\phi(\sigma)\phi(\rho)=\sigma(\alpha_{n+1}\alpha_{n+2})\rho(\alpha_{n+1}\alpha_{n+2})=\sigma\rho$.  So, $\phi(\sigma \rho)$ does not seem to equal $\phi(\sigma)\phi(\rho)$.  But the idea is that we want $\phi(S_n) \cong S_n$, and $(\alpha_{n+1}\alpha_{n+2})$ does not permute any members of $\{\alpha_1,...,\alpha_n\}$, so $\phi(\sigma \rho)$ and $\phi(\sigma)\phi(\rho)$ are equal as permutations on this (sub)set.  This feels a little subtle to me and I'm not sure if my idea is valid or not.  If it is not, can this proof still be saved?  I appreciate any thoughts on this.  Thanks. I am using Ubuntu 17.10 on my desktop PC, I've been monitoring network traffic with Etherape. I noticed HTTP requests from my PC(casa hostname) to googleusercontent.com (104.198.143.177). So I used lsof and ss to 'identify' process behind these requests.    Using lsof -i:   NetworkMa  778            root   20u  IPv4 546772      0t0  TCP casa:53671-&gt;177.143.198.104.bc.googleusercontent.com:http (SYN_SENT) NetworkMa  778            root   20u  IPv4 546772      0t0  TCP casa:53671-&gt;177.143.198.104.bc.googleusercontent.com:http (ESTABLISHED)   Using ss -rep dst 104.198.143.177:    tcp    SYN-SENT   0      1      casa%enp4s0:53671    177.143.198.104.bc.googleusercontent.com:http  users:(("NetworkManager",pid=778,fd=20)) timer:(on,964ms,0) ino:546772 sk:6df &lt;-&gt; tcp    ESTAB      0      87     casa%enp4s0:53671    177.143.198.104.bc.googleusercontent.com:http  users:(("NetworkManager",pid=778,fd=20)) timer:(on,300ms,0) ino:546772 sk:6df &lt;-&gt;   It seems NetworkManager (pid 778) is sending requests to googleusercontent, and it happens every 5 minutes exactly.   I have to say, no applications were launched at the moment, no background process, no network activities,no online account and it was a 'Ubuntu fresh install'. So why NM would sent requests to googleusercontent? Why do we need to set swap space as twice big as our physical memory? When we want to setup a linux system, there is a common a suggestion to set the swap space  twice as big as your physical memory. I want to know why do we need this, and how it is this suggestion come to be? Calculate $$\int_C \frac{2xy^2dx-2yx^2dy}{x^2+y^2},$$ where $C$ is the ellipse $3x^2 +5y^2 = 1$ taken in the positive direction.   I tried to calculate the integral using green theorm.  now i need to build enclosier that doesn't enclose $(0,0)$ i am having hard time guessing what to build.  a circle and ellipse might be perfect but then the domain is not easy to write. can i have hint please ? C++ STL Vector Iterator accessing members of an Object I think I've declared a Vector with an object correctly.  But, I don't know how to access it's members when looping with Iterator.  In my code, the line --->>  cout &lt;&lt; " " &lt;&lt; *Iter;  How do I print the contents of the members?  Like *Iter.m_PackLine ???  Not sure if I used the correct terminology, but appreciate the help!  Thanks  class CFileInfo {   public:       std::string m_PackLine;       std::string m_FileDateTime;       int m_NumDownloads; };  void main() {   CFileInfo packInfo;    vector&lt;CFileInfo, CFileInfo&amp;&gt; unsortedFiles;   vector&lt;CFileInfo, CFileInfo&amp;&gt;::iterator Iter;    packInfo.m_PackLine = "Sample Line 1";   packInfo.m_FileDateTime = "06/22/2008 04:34";   packInfo.m_NumDownloads = 0;   unsortedFiles.push_back(packInfo);    packInfo.m_PackLine = "Sample Line 2";   packInfo.m_FileDateTime = "12/05/2007 14:54";   packInfo.m_NumDownloads = 1;   unsortedFiles.push_back(packInfo);   for (Iter = unsortedFiles.begin(); Iter != unsortedFiles.end(); Iter++ )  {     cout &lt;&lt; " " &lt;&lt; *Iter; // !!! THIS IS WHERE I GET STUMPED     // How do I output values of the object members?   } }  // end main Notify-send ignores timeout? Maybe I'm doing something wrong, but shouldn't the commands (run separately) notify-send -t 1 &quot;test&quot; notify-send -t 1000 &quot;test&quot; notify-send -t 10000 &quot;test&quot;  have different timeouts? The first being nearly instantaneous, the second taking 1 sec and the third 10 seconds? In all cases it seems to take about six seconds for me. Is there a way around this behaviour? As the developers label this as a &quot;feature&quot; instead of a bug, I would like some alternatives. Take a look on a website with specified viewport size, that is bigger than physical size? What are the most downvoted questions and answers on Stack Overflow, Server Fault, Meta, and Super User history to date?  Similarly, what are the most upvoted questions and answers on SO, SF, Meta, and SU to date? Attribution alignment and order should be consistent with the website Is there a ".bashrc" equivalent file read by all shells? Is ~/.bashrc  the only place to specify user specific environment variables, aliases, modifications to PATH variable, etc?  I ask because it seems that ~/.bashrc seems to be bash-only, but other shells exist too… Proper capitalization of commonly used acronyms and initialisms I'm looking to build a guitar pedal switcher based on a Raspberry Pi or Arduino (have not yet decided, but I have an unused Raspberry around and I lean towards that). Anyway, digital logic.  Now, I need to switch audio signal obviously and I need to do it quietly (both physical silence and electrical silence). Please note that the signal is line level throughout most of the build, except for the input which is much lower. I will probably have 2 or 3 loops before the preamp so those may not encounter line level signal.  From what I read and know, so far, mechanical relays are not really an option due to the clicking noise they make. I also read something about FETs, but that's a bit out of my league and I would appreciate any info on these.  PS: I will probably use different power rails for the digital and analog paths.  PS2: The whole thing will be mounted in a 1U rack enclosure, so please tell me if I should take into consideration any thermal issues. CSS3's border-radius property and border-collapse:collapse don't mix. How can I use border-radius to create a collapsed table with rounded corners? If $f:U\to V$ is holomorphic and $f'(z)\neq 0$ for all $z\in U$, then$f$ is locally bijective. I am trying to solve the following problem:     Let $f:U\to V$ be a holomorphic function such that $f'(z)\neq 0$ for all $z\in U$. Show that for all $z_0\in U$, there exists a disc $D_\varepsilon(z_0)\subseteq U$ such that $f:D_\varepsilon(z_0)\to f(D_\varepsilon(z_0))$ is bijective.   Atempt:  I am trying to use Rouche's Theorem, but I am stuck on a particular step. Let $z_0\in U$. Since $f'(z_0)\neq 0$, there is a disc $D_r(z_0)\subseteq U$ such that $$f(z)=f(z_0)+(z-z_0)h(z),\quad\forall z\in D_r(z_0)$$ where $h$ is holomorphic on $D_r(z_0)$ and $h(z)\neq 0$ for all $z\in D_r(z_0)$.   Let $0&lt;\varepsilon&lt;r$ to be defined later and fix $w\in D_\varepsilon(z_0)$. To show that $f$ is injective in $D_\varepsilon(z_0)$ is to show that the function $f(z)-f(w)$ has exactly one zero in $D_\varepsilon(z_0)$. But $$F(z):=(z-z_0)h(z)$$ has exactly one zero in $D_\varepsilon(z_0)$, so we might want to apply Rouche's Theorem with $F$ and $$G(z):=f(z)-f(w)-(z-z_0)h(z)=f(z_0)-f(w)=-(w-z_0)h(w)$$ to conclude that $F$ and $F+G$ have the same number of zeros and hence $f$ is injective. But that means that we need to find $0&lt;\varepsilon&lt;r$ such that $|G(z)|&lt;|F(z)|$ on $\partial D_\varepsilon(z_0)$. That is, $$|w-z_0||h(w)|&lt;|z-z_0||h(z)|$$ for all $w\in D_\varepsilon(z_0)$ and $z\in\partial D_\varepsilon(z_0)$.  Can we find such $\varepsilon&gt;0$?  It seems intuitive since if we expand $h$ in a power series at $z_0$, $h(z)=\sum_{n=0}^\infty a_n(z-z_0)^n$, then $$|w-z_0||h(w)| = |w-z_0|\sum_{n=0}^\infty a_n|w-z_0|^n &lt; |z-z_0|\sum_{n=0}^\infty a_n|z-z_0|^n.$$ for $w\in D_\varepsilon(z_0)$ and $z\in\partial D_\varepsilon(z_0)$. But this is of course not a proof. How is The Wall bypassed? Using induction, how can I show the following identity about the fibonacci numbers? I'm having trouble with simplification when doing the induction step.  Identity: $$f_n^2 + f_{n+1}^2 = f_{2n+1}$$  I get to:  $$f_{n+1}^2 + f_{n+2}^2$$  Should I replace $f_{n+2}$ using the recursion? When I do that, I end up with the product of terms, and that just doesn't seem right. Any guidance on how to get manipulate during the induction step?  Thanks!