My phone was stolen, I'm trying to login to Gmail, but since Gmail sends a code when you log in I can't get the code. I still know my password but it still asks for the code.  I tried my recovery mail but it says:     There's no Google account with the info that you provided.   But I provided the right info. Is it still possible to retrieve my account?
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: )
This is a follow up to   I am using a SHA-256 HMAC function on a single-word input: sha256hmac(privatekey,word) = output. The private key length is 128 bits, it does not change. The "word" is literally one short word.  Assuming an attacker knows "word" and "output" for multiple words (e.g., dog = "dsfwrw3r3r323211", cat = "3erwerwetwewer"):   Is it significantly easier for an attacker to identify the private key by brute force with the above word/output pairs, as compared to a situation where they do not have those pairs? Is this brute force vulnerability (with word/output pair knowledge) an actual security concern? Shrink the database only up to its initial size which is set after creating database In SQL server every database has a property Initial Size (MB) which can be seen in properties of database in SSMS. By default it will be 3 MB for mdf and 1 MB for ldf file.  So now if create a new database then it will be set to default size(i.e 3 MB for mdf and 1 mb for ldf file). But after creating the database  I change the initial size to some other value say For mdf 10 MB and ldf 5 MB.(In real-time some database administrator may want to change initial after creating database)  But now if shrink the database it will shrink beyond the initial size I have set after creation(consider that no data is there in database otherwise it will shrink to its actual content size). It will shrink till the initial size it had during creation of database(i.e 3mb for mdf and 1 mb for ldf). I was expecting to shrink till the initial size which I have set(i.e 10 mb for mdf and 5mb for ldf). Can it be possible to do? If possible then how?  In some article i saw like dbcc SHRINKFILE can be used to shrink beyond initial size and dbcc SHRINKDATABASE cannot shrink beyond initial size. But I want to shrink only till the initial size to which I have set.  Note: I know that shrink is bad and should not be done.But I want to know how it can be done? If sql server considers only the initial size set during creation of database then what is the use of setting the initial size after creating database?  EDIT:  From microsoft shrink related article: Using DBCC SHRINKDATABASE you can not shrink database below its initial size.  My question is Can I change the initial size of existing database itself?  EDIT:  I have about 5 sql server instance. All the database where created with default size of 3 mb for data and 1 mb for log(about 3 years back). Now all the databases are in the range of 100-1000 mb. I wont shrink the database normally as it is not good practice. But some database grow more than 10 GB(mdf file itself as i insert so much data in it). So when database is large I will shift unimportant and old contents from this database to another server as it is not required in that server for me. So that database size reduces from 10 GB to 1 GB. Now the remaining 9 Gb left unused. Now I  want to specify database size to be reduced to 2 GB so that i will get 1 GB free space(Also 2 Gb is the ideal size for this database), Which can be used to avoid autogrowth till next 1 Gb of data is filled. Also i have set 100 MB auto-growth for this kind of large database which has more writes. So instead of specifying size as 2 GB in shrinkfile command,if it was possible to change initial size to 2 GB (which shrink considers) then it would have been better. During this database creation there was no plan about size ,autogroth etc. As it was created about 3 years back. Now i am planning to set autogrowth etc. I cant again create new database with new initial size and shift data. So I was asking whether I can change the Initial size for existing database? How to execute a program or call a system command from Python Question on determinants of matrices changing between integer matrices The following problem came up from a though I had while reading:  Let's say we have $M=\mathbb{Z}^n$ and we have another free $\mathbb{Z}$-module, $N$, inside of $M$ also with rank $n$.  We know we can make a matrix $A$ that changes $N$ to its representation in $M$ (ie has as columns the basis $N$ expressed in coordinates coming from the basis of $M$). If the index of $N$ in $M$ is $m$, I am pretty sure just from tinkering that the determinant of $A$ should also be $m$, however, I have not been able to show this.  It is unclear to me how to proceed. I though maybe I could do something related to the points in $\mathbb{Z}^n$ that are within the unit box of $N$, but I cannot really make sense of this.  Thank you for any help or direction. Getting text from last marker to EOF in POSIX.2 java.lang.NoClassDefFoundError: org/apache/xpath/XPathAPI The no. of all possible matrices of order $3\times 3$ with each entry $0$ and $1$ and $ -1$. Suppose f is a twice differentiable function with $f(0)=0$ and $f(1)=1$, $f'(0)=f'(1)=0$. Then show that $|f''(x)| > 4$ for some $x$ in $(0,1)$ Let $A$ be a nonempty and bounded below, and define $B= \{b\in \mathbb{R}: b$ is a lower bound for $A\}$. Show sup$B$ = inf$A$.   So far I have: Let $A$ be nonempty and bounded below. This implies $\exists l \in A, \forall a \in A, l\leq a$ and $l =$ inf$A$. Let $B = \{b\in \mathbb{R}: b$ is a lower bound for $A\}$ and let $M=$ sup$B$. This implies $\exists b\in B, \forall b \in B, b\leq M$. By definition of $B$, we know inf$A \in B$. Since $b\leq$ sup$B$, with sup$B$ the largest element in $B$, we have inf$A \leq M =$ sup$B$, so inf$A \leq$ sup$B$.  I realize I have to prove that sup$B \leq$ inf$A$ to get that sup$B$=inf$A$. I am having trouble doing so.   Part B: Use (a) to explain why there is no need to assert that greatest lower bounds exist as part of the Axiom of Completeness. How to rename multiple files by removing the extension? I have a number of tiff files named:    sw.001.tif sw.002.tif ...   and I want to remove the .tif at the end of each of the files.  How can I use the rename command to do this? Block network access of a process? Is it possible to block the (outgoing) network access of a single process? Euclidean domain in which the quotient and remainder are always unique Let $R$ be a Euclidean domain in which the quotient and remainder are always unique. Does it follow that the ring $R$ is either a field or a polynomial ring $F[X]$ for some field $F$? Is there an easy way to see associativity or non-associativity from an operation's table? Most properties of a single binary operation can be easily read of from the operation's table. For example, given $$\begin{array}{c|ccccc} \cdot &amp; a &amp; b &amp; c &amp; d &amp; e\\\hline a     &amp; e &amp; d &amp; b &amp; a &amp; c\\ b     &amp; d &amp; c &amp; e &amp; b &amp; a\\ c     &amp; b &amp; e &amp; a &amp; c &amp; d\\ d     &amp; a &amp; b &amp; c &amp; d &amp; e\\ e     &amp; c &amp; a &amp; d &amp; e &amp; b \end{array}$$ it is easy to check that it is closed (no elements occur in the table which don't occur as row or column index), commutative (the table is symmetric), has a neutral element (the row and column of $d$ are copies of the index row/column), and has an inverse element for each element (there's a $d$ in each row and column). In other words, almost all important properties can immediately be seen. The only part missing is associativity.  Therefore my question: Is there a simple way to see directly from the operation's table (i.e. without doing explicitly all the calculations) if an operation is associative? Because I'm still living like it's 2008, I run a website with a .in TLD. The website has nothing to do we India and does not target Indian users.  Unfortunately, when I go to Google Webmaster Tools I see that Google have locked my geotargeting status to India:    On the , Google state that:     Sites with country-coded top-level domains (such as .ie) are already associated with a geographic region, in this case Ireland. In this case, you won't be able to specify a geographic location.   This seems implausibly inflexible, so I want to know if there are any sneaky ways of removing auto-geotargeting, or changing it to a more appropriate region? Contemporary written usage of "whom" in objective case Possible Duplicate:          I was writing a LinkedIn recommendation one day, and ended up pondering for a while which of these forms to use:     … is a great developer whom I always   found easy to work with.      … is a great developer who I always   found easy to work with.   Both are basically correct in contemporary English, right? But is one or the other preferable, and if so, why?   (In this case I went with the latter, as it seemed more common (Google)  and I wanted to avoid sounding unnecessarily “archaic”, although I’m not sure whether that would have been the case. Also note that I try to write in a “friendly professional” style instead of overly formal one. :-) Why does WCF return myObject[] instead of List like I was expecting? Showing that the product of all $n$th Roots of Unity is $(-1)^{n+1}$ I need to show that the product of all the $n$th roots of unity is $(−1)^{n+1}$.   Is there a way to do this by induction? If there is, I can't seem to figure it out. Are there other, perhaps more efficient, methods of proof? In Windows I used command-line clipboard copy-and-paste utilities...      pclip.exe and gclip.exe     These were UnixUtils ports for Windows (but they only handled plain text). There were a couple of other native Windows utilities which could write/extract any format.    I've looked for something similar in Synaptic Package Manager, but I can't find anything.    Is there something there, that I've missed? ... or maybe this is available in Bash scripting?    The type of utility I'd like will be able to read/write via std-in/std-out or file-in/file-out, and handle Unicode, Rich Text Format, picture, etc. clipboard formats...    NB: I'm not after a clipboard manager. Evaluate the integral $\int_0^{2a}\int_0^\sqrt{2ax-x^2}\frac{\phi'(y)(x^2+y^2)x dxdy}{\sqrt{4a^2x^2-(x^2+y^2)^2}}$ The graduate students at my university (a relatively large state school in the US) are considering joining a union. To help decide whether to sign a union card in support of joining the union, I'm interested in more information about how unions have helped graduate students at other universities. What are some improvements to graduate life gained by graduate students at other universities upon joining a union?  I'm also interested in information about how unions have hurt graduate students at other universities. What are some detriments to graduate life caused by graduate students joining a union?  I'm primarily interested in student-body-wide benefits/detriments, instead of student-specific or faculty/administrator-specific claims (e.g. "my advisor treated me better with the union behind me" or "my students have stopped working since they joined a union" is not what I'm looking for).