Overfull \hbox is too wide I'm trying to compile my tex file but it keeps giving me this error. Overfull \hbox (11.0894pt too wide)  Someone who can help me out?
What does "overfull hbox" mean? (Why is there a black mark at the end of a line?) I often see output from TeX with the warning overfull hbox, badness 10000. What does this message mean?
Is $\langle1-i\rangle$ a maximal ideal in $\mathbb{Z}[i]$? I'm trying to show that $\langle1-i\rangle$ is a maximal ideal of $\mathbb{Z}[i]$.  I started by assuming there is some ideal $A$ that properly contains $\langle1-i\rangle$, and then I want to show that $1 \in A$, and then I will have that $A= \mathbb{Z}[i] $, so $\langle1-i\rangle$ is maximal.  Is this the right approach?  Thanks  Second Attempt: Because $\forall a+bi \in \mathbb{Z}[i]$, we have $a+bi = (a+b) -b(1-i)$, then we have $a+bi - (a+b) = -b(1-i) \in \langle1-i\rangle$, which implies $a+bi +\langle1-i\rangle = a+b +\langle1-i\rangle$.  So every coset is of the form $c +\langle1-i\rangle$, where $c\in \mathbb{R}$.  Furthermore, $-i(1-i)^2=2 \in \langle1-i\rangle$. Write $c = 2q + r$, where $q,r\in \mathbb{R}$ and $r=0,1$.  Then because $2 \in \langle1-i\rangle$, we have $2q\in \langle1-i\rangle$ and therefore $2q= 2q+r-r = c-r\in \langle1-i\rangle$, so $c+\langle1-i\rangle = r+\langle1-i\rangle$, and every coset is of the form $0 + \langle1-i\rangle$ or $1 +\langle1-i\rangle$. Thus, $1 +\langle1-i\rangle$ is the only nonzero element, and is invertible with itself as its inverse.  Thus, $\mathbb{Z}[i]/\langle1-i\rangle$ is a field with two elements, and by a theorem, $\langle1-i\rangle$ must be maximal.  Is this correct? Would it be possible to create a wand more powerful than the Elder Wand? How do I resolve these unmet dependencies? Vectorize a PNG file in Adobe Illustrator CC 2017 I need to open a white PNG shape in Illustrator. I want to convert it into vector and change the color. In CS6 is very simple to do this. Can you help me to do this in CC? Let $X_1$ and $X_2$ are independent $N(0, \sigma^2)$ random variables. What is the distribution of $X_1^2 + X_2^2$? Let $X_1$ and $X_2$ are independent $N(0, \sigma^2)$ which means (mean = 0, variance = $\sigma^2$) random variables. What is the distribution of $X_1^2 + X_2^2$?  My approach is that  $X_1\sim N(0, \sigma^2)$ and $X_2\sim N(0, \sigma^2)$  Then $X_1^2$ and $X_2^2$ have chi-squared distribution with 1 degree of freedom. (I am not sure the degree of freedom and not sure how to show it as well(please help on this))  Then I found the moment-generating function for $X_1^2$ and $X_2^2$;$$m_{X_1^2} = (1-2t)^{-1/2}$$ and $$m_{X_2^2} = (1-2t)^{-1/2}$$  So the moment generating function for $X_1^2 + X_2^2$ is $$m_{X_1^2}(t) m_{X_2^2}(t) = (1-2t)^{-2/2}$$  So $X_1^2 + X_2^2$ has a chi-squared distribution with 2 degrees of freedom. Is this correct? How can I ensure testNG test method does not abort if any assert fails I know there is a difference between assert and verify in Junit; the assert results in a runtime exception, causing test method execution to abort. To overcome this problem, we can have verify which will make test case fail, but allowing test execution to proceed rather than getting aborted.  I doubt there is any such built in approach in testNG. I do understand that best practices say, there should not be multiple asserts in same test case.  But, in practical world, we do come across scenarios where we need to have multiple checkpoints in one test case and we don't want our test method to abort because of one check point failure (test execution should proceed despite failure).  How can we use a soft assert mechanism, similar to verify, which will not abort test method when there is a checkpoint failure.  Example:  @Test(dataProvider = "getMailUrl") public void testMail(email,subject); Assert.assertFalse(subject.isEmpty);//1st checkpoint Assert.assertNotNull(email); //2nd checkpoint Assert.assertEquals(email, "feedback@yoursite.com"); //3rd checkpoint   Now, I want test execution to proceed, even if the 1st checkpoint (validation of subject being not empty) fails. Definitely we will be not be using assert (hard assert). We will need concept of soft assert similar to verify (facilitated by Junit).   I understand, we have to build a customListener implementing TestNG interfaces or extending existing listeners such as TestListenerAdapter. I am still struggling - how can we do this? Which edit actions can move a post into Community Wiki mode? Surprisingly, I couldn't find a straight answer to this.  It's not entirely clear in the .  There are (at least?) four different types of edit actions:   Body edits Title edits Retags Rollbacks   And a few actions that show up in the history but aren't really "edits":   Close/Reopen Delete/Undelete   The FAQ seems to indicate that only body edits are important as far as "wikification" is concerned, but I'm not sure if that's really correct or if I'm just interpreting the post too literally.  The FAQ also says that rollbacks don't reverse the calculations - fine, but are they considered to be additional edits or are they ignored?  Can anyone tell me which of these actually count toward the wikification of a post, and whether the rules are any different for owner edits vs. multiple editors? We have a webservice that our application uses and the developers require https connections to the webservice.  Since this is an internal webservice would you use a self signed cert? The scroll bar is hidden on MacBook if the user doesn't move the mouse for some time.  This pattern is also used in other devices too, for example Android devices.  The scroll bar does not take much place but it informs a user of where on page he is.  Is it a good approach hiding the scroll bar when the user is presumed viewing the content? File permissions and saving Let's say you open a file on which you have write permission. Meanwhile you change permissions and remove write permission while you still have the file open in some editor.  What will happen if you edit and save it? number length limit in SOQL Where condition When I execute SOQL in Developer Console:  Select Id, Amount From Opportunity Where Amount &gt; 10000000000   An parsing error occurs:  Unknown error parsing query   Is there length limit of number on SOQL Where condition? How do I downgrade Minecraft to play on a server running an older version? How to import a .max model into Blender? MySQL Error 1153 - Got a packet bigger than 'max_allowed_packet' bytes At the end of the scene in the cemetery in GoF, the spirits who emerged from Voldemort's wand tell Harry to go grab the trophy (which, of course, was a portkey that took Harry and Cedric from the maze to the cemetery), and that the trophy portkey would take Harry back to Hogwarts.  Why would the portkey do that?  Are all the portkeys 2-way?  If possible, I would prefer as much of the answer based on canon (or JKR) as feasible Clever bounty reputation hack I say "hack" in the most favorable light. It's a clever idea and theoretically beneficial.  I noticed that an old question of mine suddenly started getting a lot of renewed attention. The question had been answered, with an answer accepted. But another user added a well reasoned and insightful answer to the list. He also opened a +100 bounty on that question.  The resulting increased attention quickly got his answer quite a lot of up-votes. Well more than the 100 points he had spent on the bounty. Therefore, he gets a net rep profit out of the transaction.  So here's the hack:   Find an interesting question Research and provide a very good answer Open up a bounty on that question to attract attention and votes to your new answer Profit!!!   2 and 3 may be out of order--I didn't see the timing of it. But either way, assuming he gets more than 10 votes, he still gets increased rep out of the deal.  I don't think this is necessarily bad for SO - it does generate some useful discussion and insightful answers. Plus you can increase your own rep very rapidly by making your answers highly visible, and therefore frequently voted upon.   However, it does slightly change the meaning and purpose of bounties away from starting a discussion and toward self-promotion. Still, interesting. If diary Tom Riddle had succeeded, would there have been two Voldemorts? Finding an example of a discrete-time strict local martingale. I have a question related to modeling short time-series. It is not a question , but how. What method would you recommend for modeling (very) short time-series (say of length $T \leq 20$)? By "best" I mean here the most robust one, that is the least prone to errors due the fact of limited numbers of observations. With short series single observations could influence the forecast, so the method should provide a cautious estimate of errors and possible variability connected to the forecast. I am generally interested in univariate time-series but it would be also interesting to know about other methods. I wonder how a researcher send an unsolicited email to another one asking for feedback to their work. I guess it will be something like this?  Hello Dr. X To introduce myself, I am Y, in institute Z. I'm sorry if this email is not convenient at this time, but my work about A is highly relevant to your work in B, so I think it will be interesting to you too. If possible, can you take a look at it and tell me what you think? Here is the link:  Thank you for your reading, hope you enjoy it.  I wonder if the summary/abstract should be included in the email too, since the principle for  is to show everything you know about it. Maybe it's not necessary, since the title of the link should prove its interestingness nevertheless? I'd like to have your confirm. I'm also interested in the case where Y has no Z, and the link is just a collection of observations posted in a blog, not a full paper with proper citation and literary review. It is possible that the observations may have been covered in the field, but Y isn't aware of that yet. I also think that if the link is interesting enough, then putting a tracking method in there is fine too? Even if they finds out, they wouldn't feel insulted either, because they find that the link is indeed interesting.  Related: •  •  •