Addressing several doctors in a salutation
Salutation for two doctors (not married)
How do I time a method's execution in Java? How do I get a method's execution time?   Is there a Timer utility class for things like timing how long a task takes, etc?     Most of the searches on Google return results for timers that schedule threads and tasks, which is not what I want. Annuity notation in LaTeX Self adjoint operators and trace class property This is a variation of the  questioned some time ago.  For a complex Hilbert space $H$ let $T: H \rightarrow H$ be a bounded operator. We call that $T$ is a trace-class operator if the following sum  $$\sum_{i}{\langle |T|e_{i}, e_{i} \rangle} &lt; \infty$$  converges, where $|T| = (T T^{*})^{\frac{1}{2}}$ is the absolute value of the operator.  Assume that  $$\sum_{i}{\langle Te_{i}, e_{i} \rangle}$$  converges for any basis in the space $H$. How to prove that if the aformentioned property holds then the operator is a trace class operator?  The progress on the problem is the following: Given an arbitrary bounded operator $T: H \rightarrow H$, one can use the following decomposition $$T = \big( \frac{T + T^{*}}{2} \big) ^{*} + i \big( \frac{T^{*} - T}{2i} \big) ^{*}$$  The latter line gives the decomposition $$T = A + i B$$ where $A, B$ are normal operators.  For the normal operators we can apply the spectral theorem that proposes that $T$ is unitary equivalent to  $$(UT U^{-1})(f(x)) = g(x) f(x)$$  where  $$U: H \rightarrow L^{2}(X, \mu)$$ $$g \in L^{\infty}(X, \mu)$$  Though this decomposition classify the operator in a broad sence, i see no direct way to conclude the statement. Are the any hints that may extend the previous argument? If not, are there any ways to conclude the statement? Disable automatic activation of Gnome Shell activities on mouse over What is a 'Closure'? I asked a question about Currying and closures were mentioned. What is a closure? How does it relate to currying? List all the directories under the current one How can I install Ubuntu without removing Windows? How could a statement be true without proof? Show that if $f(z)$ is an entire function such that it takes real values on the lines $Im(z)=0$ and $Im(z)=a$ (for some $a \in \mathbb{R}_{\neq 0})$, then $f$ is periodic with period $2 i a$.    So here is my thought process: First of all by reflection principle $f(\bar{z})=\overline{f(z)}$ so if our function $f$ is given in the strip $0 \leq Im(z) \leq a$, then its values on $-a \leq Im(z) \leq a$ follow by reflection principle. Then by imposing $f(z)=f(z+2 ia)$ we can intuitively see that this will define an entire function by looking at how the strips $na \leq Im(z) \leq 2na$ seamlessly stack on top of each other. Is this logical? And how would one prove this analytically? Err http://archive.canonical.com natty InRelease     Err http://security.ubuntu.com oneiric-security InRelease                Err http://extras.ubuntu.com natty InRelease                             Err http://security.ubuntu.com oneiric-security Release.gpg   Temporary failure resolving ‘security.ubuntu.com’ Err http://archive.canonical.com natty Release.gpg   Temporary failure resolving ‘archive.canonical.com’ Err http://extras.ubuntu.com natty Release.gpg   Temporary failure resolving ‘extras.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric InRelease Err http://gb.archive.ubuntu.com oneiric-updates InRelease Err http://gb.archive.ubuntu.com natty-backports InRelease Err http://gb.archive.ubuntu.com oneiric Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com oneiric-updates Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’ Err http://gb.archive.ubuntu.com natty-backports Release.gpg   Temporary failure resolving ‘gb.archive.ubuntu.com’  Reading package lists... Done W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/InRelease       W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/InRelease   W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/InRelease   W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/InRelease   W: Failed to fetch http://archive.canonical.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘archive.canonical.com’ W: Failed to fetch http://security.ubuntu.com/ubuntu/dists/oneiric-security/Release.gpg  Temporary failure resolving ‘security.ubuntu.com’ W: Failed to fetch http://extras.ubuntu.com/ubuntu/dists/natty/Release.gpg  Temporary failure resolving ‘extras.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/oneiric-updates/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Failed to fetch http://gb.archive.ubuntu.com/ubuntu/dists/natty-backports/Release.gpg  Temporary failure resolving ‘gb.archive.ubuntu.com’ W: Some index files failed to download. They have been ignored, or old ones used instead.   This is what I'm seeing when I try to run sudo apt-get update. I did an update on my instance yesterday and am now experiencing this. Settings disappeared in Ubuntu 19.10 I usually go to the right top corner and at the drop down menu I select the tool icon to go to the settings.  However, 19.10 does not have a tool icon.  How can I go to settings now? I'm running a few VMs, and suddenly I noticed my CPU fan was spinning louder than usual. I tracked it down to Windows 8 doing some "automatic maintenance":      How can I turn this completely off? I found a way to set the time, but not a way to turn it off completely. Prove: $$x^\alpha-\alpha x \le 1- \alpha  \\ \forall x\ge 0 \ ,  \ 0&lt;\alpha &lt;1$$   It does resamble Lagrange's MVT, in order to get to the RHS, say $\alpha\in[0,1]\Rightarrow \frac{1-\alpha-0^\alpha-\alpha 0}{1-0}=1-\alpha$.  But I'm not sure what to do about the LHS. I always get a negative value in the LHS and we know that the RHS will always be postive but that doesn't really help with proving it...  Edit: maybe define a function: $g(x) = x^\alpha-\alpha x - 1+ \alpha$ Derive it: $g'(x) = \alpha x^{\alpha-1}-\alpha $ but then I get to $x^{\alpha-1}=0$    Also, I had two questions when trying to figure this out:   Can we use deriviation of both sides of an inequality to prove it ? Can we use limit of both sides of an inequaltiy to prove it ?   Thanks. I just wrote a question before this one and had trouble uploading a screenshot. The drop your image dialog throws no warning or error, but after uploading it won't show.  I also noticed that other questions won't load their images. Could this be some issue with imgur or similar?  Example:     When opening the image in a separate tab, Chrome gives a "too many redirects" error:    This might be linked to Should academic papers necessarily carry a sober tone? I was reading  titled "Optimal Symmetric Rendezvous Search on Three Locations." While talking about the history of search problems, the author mentions the following anecdote in passing.     In 2007 a letter writer to the Guardian newspaper queried, “I lost my wife in the crowd at Glastonbury (a music festival). What is the best strategy for finding her?” A reader replied, “Start talking to an attractive woman. Your wife   will reappear almost immediately.”   While I found it quite amusing to read this, I do not often come across papers with such witticisms. Is there an unwritten rule about the tone of sobriety that is considered appropriate in academic papers? Are jokes or anecdotes fine as long as they do not appear forced? Python Argument Binders How can I bind arguments to a Python method to store a nullary functor for later invocation?  Similar to C++'s boost::bind.  For example:  def add(x, y):     return x + y  add_5 = magic_function(add, 5) assert add_5(3) == 8 How to prove $\,x^a-1 \mid x^b-1 \iff a\mid b$ Is it possible to downgrade an OEM Windows 8 install to Windows 7? I recently purchased an ASUS K55A. Like all Windows 8 machines, it come with a UEFI feature called Secure Boot. This basically makes sure that the laptop won't load anything other than the Windows 8 OEM version that came with it.  However the Asus UEFI allows for me to disable Secure Boot, and therefore I should be able to revert to Windows 7, Linux, etc. (drivers may or may not be supported). When I insert my Linux Mint boot disc and try to boot from it, though, nothing happens. There isn't even a boot priority list in the UEFI settings (I can provide screenshots later). It just says "Windows 8 Bootloader" and also on the other tab it says "WINDOWS 8 BOOT OVERRIDE".  Has anybody purchased a Windows 8 machine and successfully installed Windows 7 or Linux on it? How to find the smallest $n$ such that $n^a\equiv 1 \pmod p$ Given a prime $p$ and number $a$, how do I find the smallest $n$ such that $n^a\equiv 1 \pmod p$? Is there a non trial-and-error method?  Edit: obviously removing $n=1$! Probability of a player winning before another Given a 7 sided dice, 2 players roll it independantly simultaneously and when a player rolls a '6' he gets a prize.  What is the probability of the first player getting a prize before the second?  So my solution is to sum over all the turns j in which player 1 could win, and make the second player lose all these turns:  $$P(A) = \sum_{i=1}^{\infty}(6/7)^{j-1}*(1/7)*(6/7)^j = 0.461$$ My question is if my solution is correct, and if so, why is the probability so low? It seems to me that either player 1 wins before the 2nd or the other way around, and the probability of them playing forever is 0, so it should be 0.5?