I cannot recover my Gmail account password in any way. It asks me when I created my account month/year. I have no idea. Also sends verification code and says it cannot identify my account. I also tried with entering last password I remember. Still not functioning. How can I access my e-mail??  Regards
I have forgotten the password or username for my Google account, or I'm unable to access my account for other reasons.  How can I recover my account?  (This Q&amp;A is meant as a general description for all Google and Gmail username/password questions. See: )
Why didn't Count Dooku expose Palpatine? How to create my own math operator with limits? How can i write my own math operator with limits? I want it to look like:  \sum\limits_{e=1}^{m} but with a capital A (if possible bigger than the normal text) instead of the sum.  Thanks for the help! What are the current travel restrictions on individuals entering the United States from regions affected by Covid-19? This community wiki explains the current restrictions by the United States of America on the entry of individuals who may pose a risk of transmission of the SARS-Cov2, the virus which causes the Covid-19 disease. Preventing robots from crawling specific part of a page Given $a>b>2$ both positive integers, which of $a^b$ and $b^a$ is larger? Can the Hubble constant be measured locally? The Hubble constant, which roughly gauges the extent to which space is being stretched, can be determined from astronomical measurements of galactic velocities (via redshifts) and positions (via standard candles) relative to us. Recently a value of 67.80 ± 0.77 (km/s)/Mpc was published. On the scale of 1 A.U. the value is small, but not infinitesimal by any means (I did the calculation a few months ago, and I think it came out to about 10 meters / year / A.U.). So, can you conceive of a measurement of the Hubble constant that does not rely on any extra-galactic observations?  I ask because, whatever the nature of the expansion described by the Hubble constant, it seems to be completely absent from sub-galactic scales. It is as though the energy of gravitational binding (planets), or for that matter electromagnetic binding (atoms) makes matter completely immune from the expansion of space. The basis for this claim is that if space were also pulling atoms apart, I would naively assume we should be able to measure this effect through modern spectroscopy. Given that we are told the majority of the universe is dark energy, responsible for accelerating the expansion, I wonder, how does this expansion manifest itself locally?   Any thoughts would be appreciated. Follow a pipe using less? Can less follow (by pressing F) a piped input (similarly to a file)? For a file that is being written to, the command  less &lt;file&gt;   will follow the file when pressing F.  But if I have a command that pipes output directly into less, like this  command | less   pressing F will do nothing.  So it looks like pipes cannot be followed like files can? Or maybe it has to do with command also writing to STDERR? The effect I'm trying to achieve is always see the latest output of the command: just like keeping PageDown pressed!  A related remark holds for G (go to end): when piping directly to less, it won't work. How to add CC to a webform email? I'm using Drupal 7.  Is it possible to add a CC to a webform email?  I was using   function theme_webform_mail_headers($variables) {   $headers = array(     'X-Mailer' =&gt; 'Drupal Webform (PHP/' . phpversion() . ')',   );   return $headers; }   changing it with      function MYTHEME_webform_mail_headers($variables) {       $headers = array( 'CC' =&gt; 'ccmeail@domain.com', 'X-Mailer' =&gt; 'Drupal Webform (PHP/'. phpversion() .')',  );       return $headers;     }   It does not work, I've cleared all the chaches and it does not add the CC. How could I add the CC?  Thanks in advance. $$ 3x+6y+5z=7 $$ The general solution to this linear Diophantine equation is as described    $$ x = 5k+2l+14 $$ $$ y = -l $$ $$ z = -7-k $$ $$ k,l \in \mathbb{Z} $$  If I plug the original equation into  the solution is: $$ y = 5n+2x+2  $$ $$ z =-6n-3x-1 $$ $$ n \in \mathbb{Z} $$  I can rewrite this as:  $$ x = l $$ $$ y = 5k+2l+2 $$ $$ z = -6k-3l-1 $$ $$ k,l \in \mathbb{Z} $$  However now two equations depend on two variables ($k,l$) and one on one variable $l$. In the first solution one equation depends on two variables and two on one variable.  Questions:  How can I come from a representation like the one from wolfram alpha for the general solution to one where all equations depend on one distinct variable except one equation.  Is there always such a representation? I really get confused when to use say and when to use tell. Which is appropriate in the following:   What did he tell? / What did he say? What are you saying? / What are you telling? Is there a setup where I can leave the water on all summer? What is a complete book for introductory quantum field theory? There's a fairly standard two or three-semester curriculum for introductory quantum field theory, which covers topics such as:   classical field theory background canonical quantization, path integrals the Dirac field quantum electrodynamics computing $S$-matrix elements in perturbation theory, decay rates, cross sections renormalization at one loop Yang-Mills theory spontaneous symmetry breaking the Standard Model   What is a good, complete and comprehensive book that covers topics such as these? How can I prevent Overflow for the Gamma function? I have a Dirichlet distribution from which I'm maximizing $\alpha$ by calculating the log likelihood with the following equation  $p\left(s|\alpha\right) = \sum\limits_{i=1}^O\log\left(\frac{n_i!}{\prod\limits_{j=1}^kn_{ij}!}\frac{\Gamma\left(\alpha_0\right)}{\Gamma\left(\sum\limits_{j=1}^k\left(n_{ij}+a_j\right)\right)} \prod\limits_{j=1}^k \frac{\Gamma\left(n_{ij}+\alpha_j\right)}{\Gamma\left(\alpha_j\right)}\right)$  I have a python script to calculate the log likelihood. It works for small values, but when $n_{ij}$ gets high $\Gamma\left(\sum\limits_{j=1}^k\left(n_{ij}+a_j\right)\right)$ and $\Gamma\left(n_{ij}+\alpha_j\right)$ python runs into overflow error (the max for math.gamma is between 171 and 172).   Is there a way to change the likelihood function so that $\Gamma\left(\sum\limits_{j=1}^k\left(n_{ij}+a_j\right)\right)$ and $\Gamma\left(n_{ij}+\alpha_j\right)$ don't run into overflow errors. Can I just divide the values in $\Gamma$ by for example 100, if I then compare the likelihood between $p(s|\alpha)$ with different $\alpha$ values do the best $\alpha$ values still have the highest likelihood? Why is $c+q$ still a primitive root modulo $q$? Question: Let $p$ and $q$ be distinct odd prime numbers.  By considering primitive roots, we need to show $\exists c\in\mathbb{Z}$ with the property that:  $\bullet$ $c^n\equiv 1\pmod{p}$ whenever $n$ is a multiple of $p-1$, and   $\bullet$ whenever $n$ is not divisible by $q-1$, then $c^n\not\equiv 1\pmod{q}$  I am only interested with the beginning of this answer.  Answer: We let $c$ be a primitive root modulo $q$.  We are going to use Fermat's little theorem so we need $(c,p)=1$  If $(c,p)\neq 1$, then we have $p\mid c$, but then we have $(c+q, p)=1$  and since $c+q$ is a primitive root modulo $q$, we can replace $c$ with $c+q$ for $(c,p)=1$ for using Fermat's little theorem.  I understand the general method and argument, but...  Contention: Why is $c+q$ still a primitive root modulo $q$?  When is this generally true? Is there an identity for when things remain a primitive root?  Why is $(c+q)^{\phi(q)}\equiv 1\pmod{q}$? Call C++ library in C# I have a lot of libraries written in C++. I want to call these libraries from C#, however, I have met many problems. I want to know if there is a book or guideline to tell me how to do that. If you are root, and you issue   rm -rf /    Then how far can the command go? Can you recover data from this kind of an action? Even after the binaries are gone, would the running processes still be active? What would it take to make the same physical machine boot again? What files would you need to restore to make this happen?  I could try this on a VM and see, but I want to know the rationale behind what to expect if I do this. Forcing Subdivide to create non-zig-zag edges I am aware of the die() command in PHP which exits a script early.  How can I do this in Python? Accessing bash command line args $@ vs $* Using the definition of Riemann integrability, prove that $f $is Riemann integrable on $[0,1]$ The following problem came up on a test, and I didn't get it correctly. Please help me understand the problem.  Problem: Define $f:[0,1] \to \mathbb{R}$ by $$     f(x)=  \begin{cases}     1,&amp; \text{if } x=\frac{1}{n}\\     0              &amp; \text{otherwise} \end{cases} $$ for some integer n.  Using the definition of Riemann integrability, prove that f is Riemann integrable on $[0,1]$ and evaluate the Riemann integral $\int_{0}^{1} f(x)dx$.  My Solution:  Let $\epsilon&gt;0$ and $P$ be the partition of $[0,1]$ such that $P=\{0,\frac{1}{n}- \frac{\epsilon}{3},\frac{1}{n}+ \frac{\epsilon}{3},1\}$.Then note that   $U(f,P)=M_0\Delta x_0 +M_1\Delta x_1+M_2\Delta x_2=0+(\frac{1}{n}+ \frac{\epsilon}{3})-(\frac{1}{n}+ \frac{\epsilon}{3})+0=\frac{2\epsilon}{3}$ and   $L(f,P)=0$.   Thus, for every $\epsilon&gt;0$ $$U(f,P)-L(f,P)=\frac{2\epsilon}{3}&lt;\epsilon$$.  This is the prove that I gave and the mistake that I made was that I fixed n. Some important things that I noticed about this problem were that if you graph the function $f(x)$ most of the points fall to the left or close to zero and a fewer fall to the right. Hence, this makes me believe that I need a partition such that I capture most of the points near zero so that I am only left with a finite number of points close to 1. However, I can't seem to find this partition.Any help would be appreciated. In particular, I would like to know how you come up with the partition since I always struggle to come up with one. Thank you!