First of all, I have gone through . But I am not satisfied, and I do agree with "Reviewing is important to keep the quality of questions and answers high".   My question is, why that notification is there even after I ran out of the daily limit. I mean can't they disable that if user has reached the limit?  What is the point of having such a notification on the top-bar if we have nothing to do? Is there any option to disable that?
Now that I've reached 2k on Stack Overflow, I get access to the "Suggested Edits" review queue.  Although I only have 20 edits per day, the "suggested edit awaiting" icon in the top bar is always there and it bothers me a lot!  My suggestion is to apply one of three solutions:   Remove the suggested edits icon when we reach the maximum (50) edits Remove the Highlight (orange) on the suggested edits Remove the suggested edits part when we click on it   What do you think?
$\frac{1}{A_1A_2}=\frac{1}{A_1A_3}+\frac{1}{A_1A_4}$.Then find the value of $n$ If $A_1A_2A_3.....A_n$ be a regular polygon and $\frac{1}{A_1A_2}=\frac{1}{A_1A_3}+\frac{1}{A_1A_4}$.Then find the value of $n$(number of vertices in the regular polygon).  I know that sides of a regular polygon are equal but i could not relate$A_1A_3$ and $A_1A_4$ with the side length.Can someone assist me in solving this problem? I'm looking for the fastest way to determine if a long value is a perfect square (i.e. its square root is another integer):    I've done it the easy way, by using the built-in  function, but I'm wondering if there is a way to do it faster by restricting yourself to integer-only domain. Maintaining a lookup table is impractical (since there are about 231.5 integers whose square is less than 263).   Here is the very simple and straightforward way I'm doing it now:  public final static boolean isPerfectSquare(long n) {   if (n &lt; 0)     return false;    long tst = (long)(Math.sqrt(n) + 0.5);   return tst*tst == n; }   Note: I'm using this function in many  problems.  So no one else will ever have to maintain this code.  And this kind of micro-optimization could actually make a difference, since part of the challenge is to do every algorithm in less than a minute, and this function will need to be called millions of times in some problems.    I've tried the different solutions to the problem:   After exhaustive testing, I found that adding 0.5 to the result of Math.sqrt() is not necessary, at least not on my machine. The  was faster, but it gave incorrect results for n >= 410881.  However, as suggested by , we can use the FISR hack for n &lt; 410881. Newton's method was a good bit slower than Math.sqrt().  This is probably because Math.sqrt() uses something similar to Newton's Method, but implemented in the hardware so it's much faster than in Java.  Also, Newton's Method still required use of doubles. A modified Newton's method, which used a few tricks so that only integer math was involved, required some hacks to avoid overflow (I want this function to work with all positive 64-bit signed integers), and it was still slower than Math.sqrt(). Binary chop was even slower.  This makes sense because the binary chop will on average require 16 passes to find the square root of a 64-bit number. According to John's tests, using or statements is faster in C++ than using a switch, but in Java and C# there appears to be no difference between or and switch. I also tried making a lookup table (as a private static array of 64 boolean values).  Then instead of either switch or or statement, I would just say if(lookup[(int)(n&amp;0x3F)]) { test } else return false;.  To my surprise, this was (just slightly) slower. This is because . How to do "Files to store without compression" in 7-zip? Is there any way to selectively prevent certain file types from compression in 7-zip, like in WinRAR?  I'm trying to compress a huge folder (many gigabytes), and I don't want the already-compressed files (e.g. ZIP files) to be re-compressed -- they should be stored without compression. Why is it that scanf() needs the l in "%lf" when reading a double, when printf() can use "%f" regardless of whether its argument is a double or a float?  Example code:  double d; scanf("%lf", &amp;d); printf("%f", d); My laptop running Windows 7 Ultimate (non OEM) died on me today and it has tonnes of stuff on it - my projects, Visual Studio and office installations, etc. etc.  I am getting a new laptop from somewhere and was wondering if I could just unplug the hard disk from my original (dead) machine and plug it into the new one.  I remember trying this once with Windows Xp (on a desktop) and the OS crashed on boot and I had to reinstall everything again.  I have read about  but by the looks of it, it can be used only when the host computer is alive and kicking -- which mine isn't.  My old laptop was a Compaq Pressario v3000 (3 years old) on an AMD and the new one is going to be a new dual core Intel HP laptop.  Any ideas?  Thanks! Assume the dice are numbered from $1$ to $k$. My hunch is that this will form a normal distribution with a median at $n\cdot\frac{k}{2}$. However, I have no idea as to    turn this fact into an answer (I have a minimal knowledge of stats, but I know that I am missing the standard distribution) and this is probably the wrong approach   How can I approach and solve this problem? (Aside, this is not for a class, stats or other, so any and all approaches welcome).  *Edit: * I want to find the number of ways that the sum of the numbers that are rolled has a particular value, if $n$ dice are rolled, and each has $k$ sides, numbered $1$ to $k$. How do electromagnetic waves travel in a vacuum? This is perhaps a total newbie question, and I will try to formulate it the best I can, so here it goes. How does an electromagnetic wave travel through for example, the vacuum of space?   I usually see that waves are explained using analogies with water, pieces of rope, the strings of a guitar, etc, but it seems to me that all those waves need a medium to propagate. In fact, from my point of view, in those examples the wave as a "thing" does not exist, it's just the medium that moves (involuntary reference to The Matrix, sorry).   But in space there is no medium, so how does a wave travel? Are there free particles of some sort in this "vacuum" or something? I believe , so supposedly there isn't a medium for the wave to travel through.   Moreover, I've seen other answers that describe light as a perturbation of the electromagnetic field, but isn't the existence of the field, potential until disturbed? How can it travel through something it does not exist until it's disturbed by the traveling light in the first place? (this last sentence is probably a big misconception by me). Why haven't I received the "Curious" badge? As you can see in the picture, I have 13 out of 5. But it's been like this for about two months! What's the reason for that? Travelling on Business visa to UK for tourism purposes I already have a 6 month valid UK business visa received prior to April 24 2015. I was supposed to travel to the UK in April, but my trip was cancelled on medical grounds.  I am now planning to visit the UK in July for tourism. Would it be fine for me to do so? Will I be allowed to enter the UK? Should I carry the original invite letter and medical certificate to prove why I didn't go the first time? Construction of Dirichlet distribution with Gamma distribution Let $X_1,\dots,X_{k+1}$ be mutually independent random variables, each having a gamma distribution with parameters $\alpha_i,i=1,2,\dots,k+1$ show that $Y_i=\frac{X_i}{X_1+\cdots+X_{k+1}},i=1,\dots,k$, have a joint ditribution as $\text{Dirichlet}(\alpha_1,\alpha_2,\dots,\alpha_k;\alpha_{k+1})$   Joint pdf of $(X_1,\dots,X_{k+1})=\frac{e^{-\sum_{i=1}^{k+1}x_i}x_1^{\alpha_1-1}\dots x_{k+1}^{\alpha_{k+1}-1}}{\Gamma(\alpha_1)\Gamma(\alpha_2)\dots \Gamma(\alpha_{k+1})}$.Then to find joint pdf of $(Y_1,\dots,Y_{k+1})$ I can not find jacobian i.e.$J(\frac{x_1,\dots,x_{k+1}}{y_1,\dots,y_{k+1}})$ set of almost complex structures on $\mathbb R^4$ as two disjoint spheres The set of almost complex structures on $\mathbb R^{2n}$ is given by $$ M_n = \frac{GL(2n,\mathbb R)}{GL(n,\mathbb C)} = \mathcal C_+ \sqcup \mathcal C_-,$$ taking into account that $\det = \pm 1$ gives two disjoint sets.  How do we show that $M_2=S^2 \sqcup S^2$? Moreover, I'm a bit confused by dimensions: how does $\dim_{\mathbb R}M_2=8$ relates with the latter decomposition?  This is exercise 1.2.1 from the book Complex geometry by Huybrechts. Allow sound file uploads in questions and answers? Should Stack Exchange introduce the ability to upload embedded sounds (maybe via HTML5/Flash, whichever the user has) as part of questions and answers to Stack Exchange?  It could require a certain amount of rep to stop new users from doing it frivolously.  My rationale behind this is the new language &amp; usage sites.  I often find myself thinking that it might be helpful, when discussing a regional dialect or something, for the person answering to just pronounce what they're trying to describe in words. I have a question that is highly similar to this one:  However, I'm not sure how to do this when fractional powers are involved. I understand that the answer involving the binomial theorem shows this for fractions too, but I'm not sure how to go through the mechanics of it all. For example, when trying to differentiate $\sqrt{ax+b}$, I get to   $$ \lim_{h \rightarrow 0}  \frac{\sqrt{a(x+h)+b} - \sqrt{ax+b}}{h} $$  then can't get the $h$ to cancel out. I think this involves algebraic manipulation of some sort, but can't figure it out.  Thanks What is the antiderivative of $x^{x^{x^{x...}}}$? What is $\int{x^{x^{x^{x^{\dots }}}}dx}$? I managed to get it down to a complicated series after using $u$-substitution, but I want to see other methods of approach, or if my answer was right.   First I let $$u=x^{x^{x^{x^{\dots }}}}$$, and $du$ would be, in terms of $u$, $$du=  \frac{u}{\frac{1-ln(u)}{u}e^{ln(u)/u}}$$ This makes the integral of $$\int{x^{x^{x^{x^{\dots }}}}dx}=\int \frac{1 - ln(u)}{u}{e^{ln(u)/u} }du$$ Now making $w = ln(u), dw$ becomes $1/u$ and the integral becomes $$\int e^{w/e^{w}}(1-w)dw$$ From there, I distributed and made $2$ integrals of series, using the Taylor polynomial for $e^x$. From there, I integrated and back substituted. I was only trying to find the indefinite integral.   I'm still a junior in high school, so let me know if the answer is beyond my scope of understanding. Can I have a unique UV map for each frame? regexp in ksh for extensions tgz, tar.tgz I'm trying to get a regexp (in ksh) to identify files with only the following extensions: tgz, tar.gz, TGZ and TAR.GZ. I tried several but can't get them to work. I'm using this regexp to select only files files with those extensions to do some work with them:  if [ -f $myregexp ]; then    .....  fi I have a table with a varchar(max) column that stores text ~4-10KB in size. Data is just being added - never modified, it is a log. My problem is that a table grows too large in size - I would like to keep about 1000000 rows in this table.   I am limited to SQL Server Express and hit the limit on database size. Compression is not available in SQL Server Express and I afraid that Filestream may not be appropriate and the number of files would be too big.   What is the best solution in this case? Why do fonts look messed up in Adobe Acrobat? Question of remainder on dividing by 7 Question :  What is the remainder when   $$ 10^{10} + 10^{10^2} +10^{10^3} + \ldots + 10^{10^{100}} $$  is divided by $7$? Intuitive Bernoulli numbers