There is a lot of information about the 180/90 rule, but nowhere can I find what happens AFTER the first 180 days calculated from the first entry?  Let's say I have multiple entry visa for a one year period, and I was in Schengen for 30 days within the first 180 days period. After those 180 days (after my first entry), am I allowed to enter at all? Or just 60 remaining days, or maybe even another 90, till the expiration of visa?
I have searched the web a lot and could not find an answer that fits my situation. Here are two links that are quite contradictory:       My situation:  I've visited Portugal in December 2012 for 29 days on a Schengen visa valid from December 1st, 2012 to February 1st, 2013 for research purposes (I am a Ph.D. student). I want to visit Sweden from February 10th, 2013 to May 10th, 2013 (89 days). I have applied for a Schengen visa again (for research). How will the 90/180 rule work in my situation?
How can I override the OnBeforeUnload dialog and replace it with my own? I need to warn users about unsaved changes before they leave a page (a pretty common problem). window.onbeforeunload = handler  This works but it raises a default dialog with an irritating standard message that wraps my own text. I need to either completely replace the standard message, so my text is clear, or (even better) replace the entire dialog with a modal dialog using jQuery. So far I have failed and I haven't found anyone else who seems to have an answer. Is it even possible? Javascript in my page: &lt;script type=&quot;text/javascript&quot;&gt;        window.onbeforeunload = closeIt; &lt;/script&gt;  The closeIt() function: function closeIt() {   if (changes == &quot;true&quot; || files == &quot;true&quot;)   {       return &quot;Here you can append a custom message to the default dialog.&quot;;   } }  Using jQuery and jqModal I have tried this kind of thing (using a custom confirm dialog): $(window).beforeunload(function () {     confirm('new message: ' + this.href + ' !', this.href);     return false; });  which also doesn't work - I cannot seem to bind to the beforeunload event. How to prove that $\frac{(mn)!}{m!(n!)^m}$ is an integer? $\forall m,n\in\mathbb Z$ , $m\ge1$ and $n\ge1$ how to prove that  $$\frac{(mn)!}{m!(n!)^m}$$ is an integer?  Thanks in advance. What's the "official" explanation for Harry's (and everyone else's) absence from muggle school? Automatic field should take the required entry I'm using the word "Zwei-Drittel-Abstimmungsmehrheit" a bunch of times in my document. Often it won't fit into the current line, extending into the right margin.  I figured out that the following package helps :  \usepackage[shortcuts]{extdash}    Then I can write  Zwei\-/-Drittel\-/Abstimmungs\-mehrheit   and the hyphenation is done correctly.  Is there a way that I can set this hyphenation globally for this word? Like i can do it with the command  \hyphenation{...}   Sadly this command doesn't work for words containing dashes. Sorry if this is a stupid question, but I am mainly working with 5V PIC circuits and now want to integrate a component (nRF24l01+) that needs a 3.3V supply.  As I have a box full of ~7V wall-warts, I normally use a 7805 or similar LDO regulator to power the circuit. Now I want to also get 3.3V without using a separate external supply.  I'm looking for guidance on the "right" way to do this. I think the options are:   Use a voltage divider on the output of my 5V regulator to get 3.3V Use a 3.3V LDO regulator fed directly from the 7V wall-wart   Use the output of the 5V regulator as input to a 3.3V regulator   I can see that all of these would work (would they?) and that option 3 seems to waste least power, but I don't know what gotchas might arise by chaining two regulators like this.  What things do I need to consider when making this choice? How do I transcode a Javascript string to ISO-8859-1? Currently, moderators have the ability to reset a user's username and/or profile text, and propagate that to the rest of the network, resetting it everywhere. However, often, the user's stackexchange.com network profile will also need to be reset, and this is currently only possible to do by either the user in question or staff.  Instead of bothering staff every time, moderators should have something available similar to chat, where moderators can change a user's parent site and have access to a "refresh profile" button, which will fetch updated information such as username and avatar from the parent site.  Currently, the only thing that moderators can do on stackexchange.com is to see hidden accounts. It would make sense for moderators to be able to refresh profiles there, like chat, and avoid pinging CMs every time this comes up. Was the Wookiee language fully designed or is it just random emotionally-relevant sounds? We know that some of the other Star Wars languages were fairly well developed by the movie's creators, in terms of vocabulary, grammar, etc.  Was the Wookiee language designed in this level of detail or did they just try to put together sounds that made sense emotionally? I'm trying to find the longest consecutive set of composite numbers Hello and I'm quite new to Math SE.  I am trying to find the largest consecutive sequence of composite numbers. The largest I know is:  $$90, 91, 92, 93, 94, 95, 96$$  I can't make this series any longer because $97$ is prime unfortunately.  I can however, see a certain relation, if suppose we take the numbers like (let $a_1, a_2, a_3,...,a_n$denote digits and not multiplication):  $$a_1a_2a_3...a_n1,\ a_1a_2a_3...a_n2,\ a_1a_2a_3...a_n3,\ a_1a_2a_3...a_n4,\ a_1a_2a_3...a_n5,\ a_1a_2a_3...a_n6,\ a_1a_2a_3...a_n7,\ a_1a_2a_3...a_n8,\ a_1a_2a_3...a_n9,\ a_1a_2a_3...(a_n+1)0$$  The entire list of consecutive natural numbers I showed above can be made composite if:   The number formed by digits $a_1a_2a_3...a_n$ should be a multiple of 3 The numbers $a_1a_2a_3...a_n1$ and $a_1a_2a_3...a_n7$ should be composite numbers   If I didn't clearly convey what I'm trying to say, I mean like, say I want the two numbers (eg: ($121$, $127$) or ($151$, $157$) or ($181$, $187$)) to be both composite.  I'm still quite not equipped with enough knowledge to identify if a random large number is prime or not, so I believe you guys at Math SE can help me out. Is this defined by the language? Is there a defined maximum? Is it different in different browsers? How to export variable for use with sudo? On Slackware, using sbopkg permits one to build a package from source. Repos is not big as Debian, but it's nice.  Some software can use environment variables, for example on the VICE c64 emulator, if the variable FFMPEG is set to yes, it will enable ffmpeg recording the emulator.  I tried to use  $ export FFMPEG=yes; sudo sbopkg -B -i vice   but ffmpeg is disabled.  Instead I had to use  $ su - $ export FFMPEG=yes $ sbopkg -B -i vice   which works.  How to use environment variables with sudo? Let $k$ be a finite field of order $q$ in characteristic $p$, let $n$ be a positive integer not divisible by $p$, and let $K$ be the splitting field of $X^n-1$ over $k$. Prove that $[K:k]$ equals the smallest positive integer $d$ such that $n\mid q^d-1$.  My approach: It's easy to show that if $k$ is a finite field of order $q$ with $\text{char} \ k=p$ then $k=\mathbb{F}_{q}$ with $q=p^m$ with $m\geq 1$. If $K$ is the splitting field of $X^n-1$ over $k$ then $K=\mathbb{F}_{q^r}$ for some suitable $r\geq 1$.  Let $\alpha \in K=\mathbb{F}_{q^r}$ be a root of $X^n-1$ then $\alpha^n-1=0$ and $\alpha\neq 0$.   Thus, $\alpha^n=1$ and $\alpha \in \mathbb{F}^{\times}_{q^r}$ where $\mathbb{F}^{\times}_{q^r}$ is the cyclic group of order $q^r-1$.  But I have some difficulties:  1) From $\alpha^n=1$ it follows that $o(\alpha)\mid n$. How to show that $o(\alpha)=n$? I was trying to show it using that $(n,p)=1$ but I failed.  Remark: Because if we can show that $o(\alpha)=n$ then the desired result follows immediately from cyclicity of multiplicative group of field $\mathbb{F}_{q^r}$.  I have spent one day in order to come up with this approach. So please do not duplicate this question and can anyone show how to answer my question, please.  Detailed explanation would be great! My request is simple: Many times, there will be a question where some people feel like it should be closed. At the same time, I'll feel like it's a perfectly legit question, and it should therefore NOT be closed. Right now, I have to wait till it gets enough close votes (which it always does for some reason, as soon as 1 or 2 people vote to close, e/o else decides to vote as well) and then vote to re-open. How about, as soon as there's one vote to close, there should be an option to counter the close vote, something like "vote not to close" or whatever. This would then bring the "Vote to close" number down by one. Only when the vote to close outnumbers the vote not to close by 5, that's when a question is indeed closed. Any thoughts? I have to give a presentation on the theorem in Real Analysis with a fellow student. While I've looked over the  and verified that, yes, step B does indeed follow logically from step A, etc. and have internalized the proof to the extent that I can replicate it myself on paper, I still feel that I have made little progress as to why this theorem works the way it does, i.e. what is the intuition behind the theorem, such that it should make sense that it follows the way it does. Therefore I ask: what kind of intuition is there about this theorem? It would also be helpful to understand how the theorem can be used effectively in analysis.  I have seen it referred to as a sort of L'Hopital's rule for sequences, which certainly seems to make sense, but I similarly have little intuitive understanding of how that rule works, either.  I am asking this question not only for my personal understanding, but also for the sake of being able to present it in an illuminating manner, such that the rest of the class can also come away with the same sort of intuition of how the theorem works and how it is useful. Any help would be greatly appreciated.  EDIT: I should point out that the formulation of the theorem we are being tasked to prove is the following:  Let $\lbrace a_n \rbrace$, $\lbrace b_n \rbrace$ be sequences, ${b_n}$ strictly increasing and unbounded. Then if $\lim\limits_{n \to \infty} \frac {a_{n+1} - a_n}{b_{n+1} - b_n} = l$ for some $l \in \mathbb R$, then $\lim\limits_{n \to \infty} \frac{a_n}{b_n} = l$ also. What antivirus program can I use on Ubuntu? Are there any antivirus applications that work on Ubuntu 16.04? Thanks! Keyboard key stuck or not being recognized; how to fix This is an attempt to write a canonical QA for this issue, as per the Meta post:   I expect it to be periodically edited with the goal of becoming a comprehensive information resource.  I have a MacBook Pro that has a key(Shift, Return,   Command, P, etc.) that doesn’t respond when pressed or is stuck in the down position.    It's possible that my favorite beverage was spilled (or some other liquid damage).  It's also possible that I have no idea what happened.  It was working yesterday and suddenly today it's no longer working.  Is there any way to bypass or remap the key?  Can I  have the system ignore it completely?  (This question can also apply to external USB keyboards or the Bluetooth keyboards) Reset or remove the BIOS password on my laptop Which is the rarest badge awarded/the least popular one/the one hardest to get? What is the scope of variables in javascript? Do they have the same scope inside as opposed to outside a function? Or does it even matter? Also, where are the variables stored if they are defined globally?