Scifi &amp; Fantasy:SE Seems to be suffering from much the same CSS issues raised in early June; faulty formatting, messed up user profiles, weird colour schemes:      At the time, this was attributed to a need to...     graft[ed] the new image uploader styles to the old base styles.   It's reported that this is happening on Mi Yodeya and Seasoned Advice as well.  Is this new CSS error part of an ongoing update or a genuine glitch?
On the old style user pages such as mathoverflow I noticed that the long comment on the right is floating lower today than it did previously (as recently as yesterday). I don't know if we care, but I noticed it.
Running ERDAS Imagine and ArcGIS Desktop on same machine? I keep on seeing a fair number of questions (such as ) which get marked as answered within 5-10 minutes of being posted. Sometimes the questions like this are insanely popular and actually see some proper discussion, however often I see questions have few views and only 1 answer. The trouble with these questions is that very few people have scrutinised the answer for correctness, or possibly a better solution. I always make a point of not accepting my answers until a day or so has passed — would it not be a good idea to put a short (1 hour or so) time limit on accepting answers on new questions with few views or votes, or perhaps just an additional confirmation dialog, something along the lines of:  Your question is new and not many people have had a chance to look at it yet.  Are you sure you don't want to wait to see if anyone else has a better suggestion? How can I have a pointer to the next struct in the definition of this struct:  typedef struct A {   int a;   int b;   A*  next; } A;   this is how I first wrote it but it does not work. Opportunity attack when moving in and out of range of a creature in the same move? Let's say I'm 10ft away from an enemy. In my turn, I choose to move 5ft to get close enough to attack, I do attack, then I use my remaining movement to move out of range of the enemy. Does this still allow them an opportunity attack? I read this book once when I was in middle school. A girl solves a murder or a mystery on a spaceship. It was a thin paperback books.   All I can remember is that there was an alien, and there was a movie star or actress or famous makeup artist on the ship traveling with another woman. By the end of the book the murderer was the woman the actress was traveling with who forced her to use her makeup skills to disguise her, and she was really some kind of alien. Iterate a list as pair (current, next) in Python Show that $X^2$ and $X^3$ are irreducible but not prime in $K[X^2,X^3]$.   My reasoning is as follows:  Since the only ways $X^2$ and $X^3$ can be factored in $K[X^2,X^3]$ are $X^2 = X^2 * 1$ and $X^3=X^3*1$ it follows that $X^2$ and $X^3$ are irreducible.  To show that they are not prime in $K[X^2,X^3]$ I argue that $X^2\mid X^3*X^3$ but $X^2\nmid X^3$ and $X^3\mid X^4*X^2$ but $X^3\nmid X^4$ or $X^3\nmid X^2$.  Is that correct? How do I install Python 3.6 using apt-get? Show that $\sqrt{n^2+1}-n$ converges to 0 I want to use the definition of the limit to show that $\sqrt{n^2+1}-n$ converges to 0.  The definition is as follows: if $\sqrt{n^2+1}-n$ converges to 0, then $\forall \epsilon&gt;0$, there exists an $N&gt;0$ such that $n\ge N \implies \mid\sqrt{n^2+1}-n\mid&lt;\epsilon$.  Now I want to start backwords in order to figure out how to pick N. I know:   $\mid\sqrt{n^2+1}-n\mid=\sqrt{n^2+1}-n$   since $n$ is a natural number and $\sqrt{n^2+1}&gt;n$. So I need to pick an N such that $\sqrt{n^2+1}-n&lt;\epsilon$. I tried multiplying $\sqrt{n^2+1}-n$ by $\frac{\sqrt{n^2+1}+n}{\sqrt{n^2+1}+n}$ but that didn't really seem to help.   Do you have any ideas on how to find this N?  Thanks Hump, Rump, Lump, Bump I’m referring to the similar definitions of these four nouns – something raised and rounded.  Why do these four rhyming words have similar meanings?  I have not found very specific sources for these words on the  and . Hump is “probably from Dutch homp.” Rump is “from a Scandinavian source,” “from Old Norse rumpr” ultimately from Proto-Germanic “rumpo.” Lump is “perhaps from a Scandinavian source” and finally, Bump is “perhaps from Scandinavian,” “probably of North Germanic origin.”   Could these words come from the same root? Other than the fact that they all might come from northern Europe, the only hint I have in this direction is the following from , tracing the origin of Hump through Dutch, Middle Low German, Old Saxon and Proto-Germanic, to Proto-Indo-European *kumb-, *kumbʰ- (“curved”). Could this PIE root, which is not given in these online sources for any of the other three words, be a common root to all four words? I find myself looking at other –ump words and “seeing” a curved or rounded line: jump (a curved trajectory), grump (a downturned mouth), pump (the action of the pump handle), clump (a rounded clod of earth, not sharp), etc. Am I just seeing this because the words sound similar, or is there something more to my tendency? For example, the  suggests the origin of jump is "perhaps onomatopoeic (cf. bump)" although this view is not echoed on Wiktionary. Is it possible that these words do all share a common root and are simply onomatopoeic variations of each other? Are there other pairs or groups of words like these in English? (Wham! Bam! Ka-blam!) Does     this phenomenon have a name? When do "per day" spell-like abilities recover in 3rd edition? Is there a name for function with the exponential property $f(x+y)=f(x) \cdot f(y)$? I was wondering if there is a name for a function that satisfies the conditions  $f:\mathbb{R} \to \mathbb{R}$ and $f(x+y)=f(x) \cdot f(y)$?  Thanks and regards! can't read from SQlite database Every time I try to create a table using MySQL Workbench 6.3 CE it adds "broken" comments at the end of the script.  Example:  I am trying to create a table called "user". This is what the table should look like:   However when I click the apply button, the script generates incorrectly:  CREATE TABLE `user` (   `userid` INT NOT NULL AUTO_INCREMENT COMMENT '',   `record_status` INT NOT NULL DEFAULT 1 COMMENT '',   `createdby` VARCHAR(75) NOT NULL COMMENT '',   `createddate` DATETIME NOT NULL COMMENT '',   `updatedby` VARCHAR(75) NULL COMMENT '',   `updateddate` DATETIME NULL COMMENT '',   `username` INT NOT NULL COMMENT '',   `password` VARCHAR(75) NULL COMMENT '',   `firstname` VARCHAR(75) NULL COMMENT '',   `lastname` VARCHAR(75) NULL COMMENT '',   `email` VARCHAR(75) NULL COMMENT '',   `facebook_userid` VARCHAR(75) NULL COMMENT '',   `email_verified` VARCHAR(75) NULL COMMENT '',   PRIMARY KEY (`userid`, `username`)  COMMENT '');   The comment in this line should not be there, so the code should be:   PRIMARY KEY (`userid`, `username`));   and the code executes when I paste it into an editor and remove this comment. However I create massive databases daily. (Each with +- 15 tables). I can't keep doing this for each table as it is time consuming.  How can I disable this feature that adds the comments to the script? I don't need them in my databases What is the real answer to the Birthday question? "How large must a class be to make the probability of finding two people with the same birthday at least 50%?"  I have 360 friends on facebook, and, as expected, the distribution of their birthdays is not uniform at all.  I have one day with that has 9 friends with the same birthday. (9 months after big holidays and valentines day seem to be big ones, lol..)  So, given that some days are more likely for a birthday, I'm assuming the number of 23 is an upperbound.  Has there been a better estimate to this problem? Could humans choose to establish fibre digesting colonies in our guts? How do remove "Ignoring file in directory /etc/apt/sources.list.d/ as it has an invalid filename extension? You are a pie maker and you are holding a fair to display your pies. You have 1000 pies. You have 10 workers to help you. The fair is in two hours. Unfortunately you discover that a rival pie maker has poisoned one of your pies with a form of norovirus that makes people violently ill one and a half hours after even consuming a tiny bit of it. You know if any single person who visits your fair gets ill, your business will collapse but you need all the non poisoned pies for the fair. You can take small samples from the pies without spoiling them and your workers are prepared to do anything to help you. How do you find the poisoned pie? Find the derived subgroup of $A_4$.   Since it is $A_4$, for a permutation $\sigma$ to be in $A_4$, $\sigma$ must have a cycle structure of $2$ cycles. Therefore, $\sigma=(ab)(cd)$.  The commutator of such elements, would be obviously another permutation of $2$-cycle (of length $2$).  Does it mean that $A'_4=A_4$? How to find max of amount of opportunity related to account? I have a below requirement : I need to find maximum amount on related opportunities and to display on account. Ex: suppose I have account A1 and A1 have 5 opportunities with amount o1=>100 o2=>500 o3=>300 o4=>1000 o5=>50 on my account i should have max_opportunity_amount =1000.  I have written below trigger ,but  I am not sure what to do further  trigger maxOppAmountonAcc on Opportunity(after insert){      map&lt;id,Opportunity&gt; oppMap = new map&lt;id,Opportunity&gt; ();     set&lt;Id&gt; oppId = new set&lt;Id&gt;();     for(Opportunity o : Trigger.new)     {         oppMap.put(o.accountId,o);         oppId.add(o.id);     }       List&lt;Account&gt; accList = new List&lt;Account&gt;();      for(Account a : [Select id ,MaxOppAmount__c,(select id,max(amount)  from opportunities) from Account where id in : oppMap.keyset()])     {      }  }