On the left sidebar, the first item of the menu is my profile pic + nickname. It seems to be a fake link. Wouldn't be cool if this link goes to my profile instead of doing nothing?  Or maybe, instead of a "non-link", display a summary of my profile (points, number of badges, profile views, helpful tags, etc..).
Assuming this is on the way, but having not seen it previously reported: I can't view myself from the sidebar, or anyone else by tapping them. View Self From Sidebar:   View Asker/Answerer:   View Commenter:
How to indent subsection in AMS TOC I used AMS LaTeX template with gsm-l package to write my teacher's book.   The table of content that produced has the following form:    in which 1, 2, 3.... are sections and 3.1, 3.2, 4.1, 4.2,.... are the subsection.   I want to indent the subsection with respect to the section, like this (it's ok without dots, though): Hardy's Inequality for Integrals I have a computer with a video card that has no Linux support.  I discovered this issue while trying to use a persistent usb to boot from.   I found that I can boot like that if I change options and edit so as to add nomodeset there (see ).  Also, editing the syslinux.cfg file from my live persistent USB and adding nomodeset in a line there made this setting automatic for booting from the persistent USB.  Can I make a similar edit for proper install from the same live USB?  Is it possible to edit something on the live USB in order to install the SO from it,  -- that is: having automatically the nomodeset setting already there when the installation starts?  My problem is that in order to install I think I already have to have added nomodeset or I'll see nothing on my display. I need a way to be sure that nomodeset it's permanent from the start. Convergence of the series $\sum a_n$ implies the convergence of $\sum \frac{\sqrt a_n}{n}$, if $a_n>0$ I need help to solve following problem from Rudin's Mathematical analysis book:    Convergence of the series $\sum a_n$  implies the convergence of $\sum \dfrac{\sqrt {a_n}}{n}$, if $a_n&gt;0$  I tried to construct a suitable convergence sequence $b_n$ such that $\sum b_n$ converges and $a_n \leq b_n$ but, I am not able to find such sequence $b_n$ .  Thanks for the help and sugestions. Let $R= \mathbb{Q}[x^2 ,x^3 ]$, the set of all polynomials over $\mathbb{Q}$ with no $x$ term. Show that a gcd of $x^5$ and $x^6$ does not exist in $R$.   I am reasoning for the absurd and I am assuming that $gcd (x ^ 5, x ^ 6) = ax ^ 2 + bx ^ 3\in\mathbb{Q}[x^2 ,x^3 ] $, then, for the Bezout identity there exists $p (x) = cx ^ 2 + dx^3$ and  $q(x)= ex ^ 2 + fx ^ 3$ in $\mathbb{Q}[x^2 ,x^3 ]$ such that $x ^ 5p (x) + x ^ 6q (x) = ax ^ 2 + bx ^ 3$, which is absurd since $$9 = deg (x ^ 5p (x) + x ^ 6q (x)) \neq  deg (ax ^ 2 + bx ^ 3) = 3.$$  Is it okay what I did? Thank you very much. While working in a Java app, I recently needed to assemble a comma-delimited list of values to pass to another web service without knowing how many elements there would be in advance. The best I could come up with off the top of my head was something like this:  public String appendWithDelimiter( String original, String addition, String delimiter ) {     if ( original.equals( "" ) ) {         return addition;     } else {         return original + delimiter + addition;     } }  String parameterString = ""; if ( condition ) parameterString = appendWithDelimiter( parameterString, "elementName", "," ); if ( anotherCondition ) parameterString = appendWithDelimiter( parameterString, "anotherElementName", "," );   I realize this isn't particularly efficient, since there are strings being created all over the place, but I was going for clarity more than optimization.  In Ruby, I can do something like this instead, which feels much more elegant:  parameterArray = []; parameterArray &lt;&lt; "elementName" if condition; parameterArray &lt;&lt; "anotherElementName" if anotherCondition; parameterString = parameterArray.join(",");   But since Java lacks a join command, I couldn't figure out anything equivalent.  So, what's the best way to do this in Java? Is there a technical reason to use > (<) instead of != when incrementing by 1 in a 'for' loop? Active Web Site as Gnome Background Is there a way to put an active website, such as Gmail, as your Desktop background in Gnome, running Ubuntu 10.10 64-bit? MS Win calls it "Active Desktop". Now that  is in effect, people who have visited Iraq, Syria, Iran, or Sudan since 2011 are banned from entering the US under the Visa Waiver Program. However it's unclear to me how could the US officials prove one has set foot in those countries, unless:   There's a stamp in one's passport indicating so, which can be side-stepped by getting a fresh passport One mentions the fact on the ESTA application form, which is obviously easy to avoid   Is there any other way the US might be able to identify such individuals?  NB: I'm not eligible for the VWP myself and don't plan to travel to the four countries above, so it's a purely theorethical question I got quite some trouble trying to prove this.  $$\sum_{k=m}^{n}(-1)^k\binom{n}{k}\binom{k}{m}=0, n&gt;m\geq 0$$  I tried using $$\binom{n}{m}\binom{m}{k}=\binom{n}{k}\binom{n-k}{m-k}$$ and then changing the summation boundaries as $k=0, n=n-m$, but that took me nowhere... I would really appreciate help. Thank you. Consider the partial sum of the divergent Harmonic series $H_n = \sum\limits_{k = 1}^{n}\frac{1}{k}$. I recently saw a question which required finding out the asymptotic bounds of $H_n$. Now, I could not find any bound closer than $O(n)$. So I looked up the series and found  Wikipedia article which says that $H_n - \ln n$ approaches a constant (the ). This clearly shows that $H_n = \Theta(\log n)$.  However, considering the question was in an beginners undergraduate algorithms course in CS, I was wondering if there is a simpler proof of this? Is there some clever proof requiring elementary mathematics to show $H_n = \Theta(\log n)$?  PS: This is not homework in the sense that it is not my homework, and the actual question does not ask for a proof, but rather asks a lot of functions to be arranged asymptotically. I wanted to know if there is difference in terms of charging the battery when a MacBook Pro 16" is connected to two monitors via USB-C, both with Power Delivery capability.   In this specific case I am talking about the LG 27UK850-W monitors. The MacBook Pro 16" will be connected via USB-C to both of them and use them as external monitors. Since both can charge it as well, will the MacBook Pro  charge faster while being connected to both or will just one monitor be able to deliver the charge at a time? Let $f$ be an entire function and $L$ a line in $\mathbb{C}$ such that $f(\mathbb{C})\cap L=\emptyset$. Show that $f$ is constant function.  If $f$ is not constant  then $f(\mathbb{C})$ is dense set in $\mathbb{C}$, but how can I use that line does not intersect the image set? How do you use a gray card? There are already   on how to make a gray card, but unfortunately my ignorance goes deeper than that.  How do you use a gray card? round in PHP shows scientific notation instead of full number I'm trying to do an echo of a variable containing 1400000.  so there is written: echo round(1400000); this gives 1,4E+6 instead of the full number. Anybody an idea on how to display it fully? ISP blocking port 25 How to make a disk image and restore from it later? I'm a new Linux user. I've reinstalled my Wubi from scratch at least ten times the last few weeks because while getting the system up and running (drivers, , etc.) I've broken something (X, grub, unknowns) and I can't get it back to work. Especially for a newbie like me, it's easier (and much faster) to just reinstall the whole shebang than try to troubleshoot several layers of failed &quot;fixing&quot; attempts. Coming from Windows, I expect that there is some &quot;disk image&quot; utility that I can run to make a snapshot of my Linux install (and of the boot partition!!) before I meddle with stuff. Then, after I've foobar'ed my machine, I would somehow restore my machine back to that working snapshot. What's the Linux equivalent of Windows disk imagers like  or ?  Note: I found a similar question: Orthogonal complement examples I am looking for an example such that in a pre-Hilbert space $H$ we have for a subspace $U$ that  (i) $\bar{U} \oplus U^\perp \neq H$  (ii) $ \bar{U} \neq U^{\perp \perp}$  Since finite and closed subspaces will probably not do it, I am not good at inventing nice examples. Does anybody here have a few at hand? Overcoming ~5000 File Document Library Limits Microsoft technet states that document libraries have a file limit of 30 million items:    In practice, numerous features seem to break once there are more than 5000 items in a Document library - not just in the initial directory listing - but as a recursive total. For example, you may be able to list folders, but setting permissions or deleting files is met with errors.  Are there any configuration options or optimizations that can be used to relax these limits?  A workaround would be to split folders into separate document libraries, but in our case, with over 5 million files, this would result in a minimum of 1000, 5000 file document libraries and likely many more. At that point we're likely shifting the problem into the library view.    A major showstopper is the effect this has on Sharing - a user trying to share a folder with more than 5000 aggregate items simply fails. I'm investigating the effect (if any) the resource throttling suggestion below has on this. Having problems with hair transparency using cycles. I ported over a model from daz studio (have done this a few times before with no issues).   Using a simple mix shader, transparent top, diffuse bottom, black/white texture in the fac.  Heres the blend  with images packed.