.NET Exception Page Not Human Readable
ASP.NET MVC: Weird characters in error page
What part of speech is handsome in the sentence:     The bridegroom looked so handsome. I applied a survey consisting of 12 questions to 120 people and each questions include 4 nominal categories; I want to make comparison of people's answers according to their socio-demographic characteristics such as their educational level or socioeconomic status. All of my comparison criteria consist of nominal categories and number of categories change between 3 to 6. I cannot drop or combine comparisons; categories in other words number of categories are fixed.    My question is when I compare the frequency distribution of people's answers based on their education levels (for example) through chi-squared test, I got a warning that says (for instance) 7 cells have less than count five; minimum expected count is; 43.  I got this warning for almost my all questions - demographic characteristics comparisons.    Shall I underestimate this warning and use my test results or is there a different test I should use? If I should use a different test, which one? Where has the trailing newline char gone from my command substitution? The following code best describes the situation.  Why is the last line not outputting the trailing newline char?  Each line's output is shown in the comment.  I'm using GNU bash, version 4.1.5          echo -n $'a\nb\n'                  | xxd -p  # 610a620a              x=$'a\nb\n'   ; echo -n "$x" | xxd -p  # 610a620a      echo -ne "a\nb\n"                  | xxd -p  # 610a620a x="$(echo -ne "a\nb\n")" ; echo -n "$x" | xxd -p  # 610a62 Simple combination/probability question based on string-length and possible-characters Assuming "complete randomness" and given a string with a length of 20 characters where each character may be one of 62 possible characters:    What are the total number of combinations possible? (Guessing 20 to the power of 62.)  Also, if new strings are randomly selected one after another and added to a list of strings selected so far, how many strings must be selected before the chance of selecting a string that has already been selected is below 1-in-100000 ($10^{-5}$)?   Note: 62 comes from: numeric digits (0-9), uppercase letters (A-Z), and lowercase letters (a-z). Find the last $2$ digits of $$\large7^{7^{7^{10217}}}$$   So far I have: $17\cdot 601=10217$ and $7=7 \pmod{10}$. Any help greatly appreciated. What do I need for extreme macro photography? I am wanting to venture into some extreme macro photography, specifically insects, such as . After doing some research I have believe that my 1::25 macro lens will be sufficient if I am to use some extension tubes (which I have bought).  I would like to shoot the in the wild, is this possible/likely? Or is this always a catch, then release style of shooting?  Regarding the link I've posted, would this be possible with a 1:25 macro and extension tubes? I have a set of three (21mm, 31mm and 13mm). How would you go about shoot a blue bottle for example? Surely they are going to fly away? Should I use a tripod or will that cause more of a hindrance than a help? Are there any techniques/tricks I could use to get a sharp focus on my subject? Show that if $ab$ has finite order $n$, then $ba$ also has order $n$. - Fraleigh p. 47 6.46. Proving the AM-GM inequality for 2 numbers $\sqrt{xy}\le\frac{x+y}2$ I am having trouble with this problem from my latest homework.  Prove the arithmetic-geometric mean inequality. That is, for two positive real numbers $x,y$, we have $$ \sqrt{xy}≤ \frac{x+y}{2} .$$ Furthermore, equality occurs if and only if $x = y$.  Any and all help would be appreciated. Adding two numbers concatenates them instead of calculating the sum Could someone please help me with this proof?     Suppose that $a, b \in N$, and $d = \gcd(a, b)$. Since $d$ divides $a$, we have $a = de$ for some integer $e,$ and similarly $b = df$ for some integer $f$. Prove that $\gcd(e, f) = 1$.   I understand why it works. Since d is all the common factors of $a$ and $b, e$ and $f$ had no common factors, therefore the $\gcd(e,f) = 1$. But how do I prove this?  Thanks in advance. Why GCP Kubernetes Node host location for europe-north1 seems to be in US? Submit Buttons on the Left or the Right? We have been puzzling over where to put the submit button, on the left or the right. In researching, we noticed that many sites put buttons on the bottom right in dialogue boxes, and on the bottom left in forms.  It makes sense: in a dialogue box it seems to denote finality, being in the endpoint of the window for left–right readers; in a form, the bottom right could be in a different position relative to the rest of the form if the window is resized.  It seems to be a convention, but I don't see anyone talking about this specific phenomenon in the following questions, nor the articles referenced therein:        So, is this level of button position optimization worth it if it creates an inconsistency in button placement? Is this a good way to go? Show that $xy=0$ is a variety but not a manifold Access: Making a Pivot Table with Multiple, Same Values as Columns I have a question.  I have been given this proof: "For any $n$ in the integers where $n&gt;2$, show there are at least $2$ elements in $U(n)$ that satisfy $x^2=1$."  I have gone through and actually proved this, (that the numbers are $1$ and $n-1$) but i didn't' know how to prove that $n-1$ is in fact in the set $U(n)$. Is it because two consecutive numbers are always relatively prime? How can I hide the jqgrid completely when no data returned? Correct way of declaring pointer variables in C/C++ I am trying to solve the following two problems:  1) Prove that the functions $\cos(z)$, $\sin(z)$ are surjective over the complex numbers.  2) Find all $z \in \mathbb C$: $cos(z) \in \mathbb R$ and find all $z \in \mathbb C$: $\sin(z) \in \mathbb R$.  For 1),I've tried to prove it for the function $\cos(z)$ (I suppose the other one is analogue)  so I've used the fact that $\cos(z)=\dfrac{e^{iz}+e^{-iz}}{2}$.  Let $w \in \mathbb C$, I want to show there exists $z \in \mathbb C : f(z)=w$, i.e., $\dfrac{e^{iz}+e^{-iz}}{2}=w$, multiplying by $2$ and then by $e^{iz}$ yields $e^{2iz}+1=2we^{iz}$ iff $e^{2iz}-2we^{iz}+1=0$.   I don't know if this approach is the correct one but here I've replaced $e^{iz}$ by $x$, so the solutions of the equation would be the roots of the polynomial $p(x)=x^2-2wx+1$, by the quadratic formula, I get that $x \in \{\dfrac{2w+w_0}{2},\dfrac{2w-w_0}{2}\}$, where $w_0^2=4w^2-4$.  Then, $e^{iz} \in \{\dfrac{2w+w_0}{2},\dfrac{2w-w_0}{2}\}$. At this point I got lost, I would like to explicitly show that $z$ exists and I can't see existence directly from the fact that $e^{iz}=\dfrac{2w+w_0}{2}$ or $e^{iz}=\dfrac{2w-w_0}{2}$.  First I thought of taking logarithm of both sides of the equation ir order to solve for $z$, but this is not a legitimate operation unless $e^{iz} \in \mathbb R$.   I couldn't go any farther.  For point 2) I have no idea what to do, should I use the identity $\cos(z)=\dfrac{e^{iz}+e^{-iz}}{2}$?  I would appreciate some help with the two points (specially with point 2), at least in 1) I could do something).   Btw, Happy new year! A friend sent a long a file (a .rar) he wanted me to check out for him before he installed it.  I downloaded it and unrared it with no problems, but it was full of .exe's instead of the intended contents (fonts) so I advised him to delete it immediately and not use.  I then proceeded to do the same, but the folder simply will not delete. Oddly the files went fine, and I never ran anything, but this is what I'm seeing:   Could not find this item  This is no longer located in C:\Users\This_User\Desktop. verify the item's location and try again.   I've tried the following things with no help:   Using "Unlocker" to Unlock and delete Using move on reboot and rebooting Using PendMoves (from sysinternals) and rebooting Elevating a cmd line, doing a dir /x to get the short name of the folder, and then del 'shortna~1' Moving the folder to a new folder and then trying to delete the parent folder   I'm on Windows 7 RTM, very fresh install. Any thoughts?  Update: Just to confirm, I've run Hijack this and half a dozen other malware detectors, and everything came back clean (no extra processes, no other obvious badness). Rebooting in safe mode didn't help either. I just can't seem to figure this one out.  I want to use the command line to connect to a MySQL database residing on another server.  I went ahead and created the username and password for the user.  I have also granted all privileges on that user for that database.  When using the command: mysql -h &lt;hostname&gt; -u &lt;username&gt; -p, I get the following error:  ERROR 1045 (28000): Access denied for user '&lt;username&gt;'@'&lt;local_machine_hostname&gt;' (using password: YES)   The problem is that it keeps appending the current machine's hostname into the username.  Obviously, that user@&lt;local_machine_hostname&gt; is not correct.  It doesn't matter what I type.  For instance, if I type:  mysql -h &lt;hostname&gt; -u '&lt;username&gt;'@'&lt;hostname&gt;' -p   It does the same, only in the error output, it says:  Access denied for user '&lt;username&gt;@&lt;hostname&gt;'@'&lt;local_machine_hostname&gt;'   Is there a setting in a configuration file which is allowing this to happen?  It's really quite annoying.  I need to set up a tikiwiki server, and it cannot connect because during the step where you set up mysql, it keeps appending the local machine's hostname to the mysql login name.