Rake db:migrate updates schema.rb, but not Mysql table. Any ideas why?
rake db:migrate doesn't seem to work in production
Weird evaluation order in chained functions Is it possible to log back into a Pokemon Go account? So I had 20+ Pokemon on my account and today when I tapped on the app, it brought me back to the original screen when you first start playing. My friend who signed up tested using my username when she first started and my username was unavailable, meaning the account still exists. I don't have the password for the account, but I do have the email. So I wanted to know if it was possible to log back into an account? Continued fraction of a square root If I want to find the continued fraction of $\sqrt{n}$ how do I know which number to use for $a_0$? Is there a way to do it without using a calculator or anything like that? What's the general algorithm for computing it? I tried to read the wiki article but was overwhelmed and lost. I tried Googling but couldn't find a website that actually explained this question.  If anyone has a good site that answers these questions either, please let me know. Thanks! Does "staff" take a plural verb? Which one of these two statements is correct?     Our staff do ...      Our staff does ...   And is staffs ever correct? A concrete example of involution in group theory I am reading the textbook "Introduction to Modern Algebra, Joyce 2017" and in the Cyclic groups and subgroups section, there is a following sentence about involution.     An involution $a$ is an element of a group which is its own inverse, $a^{-1} = a$. Clearly, the order of an involution $a$ is $2$ unless $a = 1$, in which case the order of $a$ is $1$.    I was trying to come up with a concrete example, but I am having difficulties. Maybe when $a = \frac{1}{2}, \frac{1}{2}^2 = 1$? I also searched the  for a concrete example, but wasn't able to find anything.  Can someone provide an example with numbers for me please? I want to understand why the author writes "clearly" that the order of an involution $a$ is $2$. Thank you Simple request, really.  Can we add a detection for the     Please avoid extended discussions in   comments. Would you like to   automatically move this discussion to   chat?   prompt, so that if one of the users in the "extended discussion" has under 20 rep it doesn't appear?  I think a lot of the users this apply to will have low rep and it may take some back and forth to get good info out of them.  New suggestion: how about if a sufficiently high-rep user is clicking on the link, the low-rep user gets a field promotion sufficient to chat? Low-rep users are particularly prone to post questions to lead in this direction of needing to move to chat. We have two sequences , $(a_i)_{i=1}^{2n}$ and $(b_i)_{i=1}^{2n}$ such that  $1\leq a_i, b_i\leq n$ for every $i$.  Show that there are two sets of indexes $I, J \subseteq \left \{ 1,2, ... 2n \right \}$ such what $\sum_{i\in I}a_i=\sum_{j\in J}b_j$.  Well, the question didn't say anything about those sets being empty but I believe that's not what they meant. I don't know that to do with questions like these. There are obviously much more subsets that possible sums ($2^{2n}-1$ compared to $2n^2$) but it doesn't really help.  I'd be glad to hear ideas, hints or solutions. Is this a plant or a fungus? It was soft and covered in flies. My guess is fungi.  Location: South Florida. Find the area of the shaded region in the figure below: Find the area of the shaded region in the figure below:    I am completely stuck on how to start off this question. Please help on some guidance on how to start it off. Bash string range and replace To print part of the string, replace , with . I use command:  echo "${q:16:6}" | sed 's/,/./'   Is it possible to use something like:  echo "${q:16:6/,/.}"   because it does not work? It can be proved that there are two irrational numbers $a$ and $b$ such that $a^b$ is rational (see ) and that for each irrational number $c$ there exists another irrational number $d$ such that $c^d$ is rational (see ).  My question is: Is there an irrational number $a$ such that $a^a$ is rational (and how could you prove that)? PythonTEX not working on current Overleaf compiler Is there a way to make PythonTEX compile as of today in Overleaf V2 ?  \documentclass[]{article} \usepackage[utf8]{inputenc} \usepackage{pythontex}  \begin{document} \begin{pyverbatim} def calc_ellipticity(theta, delta):     theta = np.deg2rad(theta)     psi = np.arcsin(np.sin(2*theta) * np.sin(delta))/2     return np.tan(psi) \end{pyverbatim} \end{document}   Compiling gives : ? PythonTEX ? How can I return to the start of a line in a console? How can I return to the start of a line and overwrite what has already been output on the console? The following does not appear to work:  System.out.print(mystuff+'\r'); How to implement draggable tab using Java Swing? How do I implement a draggable tab using Java Swing? Instead of the static JTabbedPane I would like to drag-and-drop a tab to different position to rearrange the tabs.  EDIT: . How can I search within a manpage? Notepad++ auto indent html code while writing I have seen many plugins in Notepad++ for indenting html code after you write the code, but is there a plugin or other method to auto intent html while you are writing the code?  Many of the other programming languages Notepad++ supports automatically indent while you are writing but html doesn't seem to have the same support.  Any ideas? Continuous function from $(0, 1]$ onto $(0, 1)$? Infinite algebraic extensions of $\mathbb{Q}$ I need help to solve the following exercise:   If $K$ is an algebraic extension of $\mathbb{Q}$ (finite or infinite), then we let $O_{K}$ denote the ring of algebraic integers in $K.$ If $\frak{P}$ is a prime ideal of $O_{K}$ then $\frak{P}∩\mathbb{Z}$ is a prime ideal of $\mathbb{Z}.$ Moreover, if $\frak{P}$ is non-zero, then so is $\frak{P}∩\mathbb{Z}$ . Thus $\frak{P}∩\mathbb{Z}=$$ p\mathbb{Z}$ for some prime $p.$ Show that $O_{K}/\frak{P}$  is a field, and is an algebraic extension of $\mathbb{F}_{p}$; then show that it is Galois over $\mathbb{F}_{p}$ with abelian Galois group.  Now suppose that $K/F$ is a (finite or infinite) Galois extension. Let $\frak{P},$  $O_{K}$ be as before and put $\frak{p}=\frak{P} \cap $$O_{F}$, a prime ideal of $O_{F}.$  Show that $\mathrm{Gal}(K/F)$ acts transitively on the set of prime ideals of $O_{K}$ above $\frak{p}.$   Thanks in advance SEO for websites with very less content and a lot of images Let's say we have an image exhibition website that has got a lot of images but next to nothing content. The focus keyword for this website is "Artistic wallpapers". What would be the best approach w.r.t SEO for such a website.  Here are a few things I can imagine:   Submitting sitemaps ( image and web ) Having a good pagespeed score. Nice navigation Breadcrumbs sharing the website content on Social media. Having appropriate titles.   Having worked on all these things, what can be done if Search engines are picking wrong keywords ( For example views, votes, ratings) Can anything be done so that Search engines don't track these specific items? Also, is it a good practice to have all the pages submitted to Search engines at once? Hiding reputation and encouraging thinking time would improve the quality of answers on SO I've only been a member of SO for a couple of months but I must say that the site can be a bit daunting even for an experienced developer.  Part of this is because when users with very high reputations answer questions then it seems that everyone assumes that they have the right answer.  I don't want to go into the self-fulfilling nature of reputation increase for high reputation people.  But I think it is clear that people with high reputation scores get more upvotes () because people assume (usually accurately) that they are correct.    But if reputation was hidden on SO, at least for, say, the first hour after a question is asked then the probability of the best answer being upvoted the most would surely increase.  This might also require the hiding of the names of the answerers if they have very high reps!  As a second method of getting improved answers I would correlate the value of an answer (in terms of reputation gained) with the difficulty of the question.  And the simplest way to do that would be based on the time required for the question to be answered.  So if a question is answered within a minute then it is a 20% question (2 points per upvote), within 2 minutes a 40% question, within 5 minutes a 60% question and so on, on to say a 200% answer (20 points per upvote) on questions that have been hanging around for months.  This would encourage considered answers to new questions and tempt people into reducing the backlog - rather than encouraging people to sit on the 'newest questions' hoping for a gimme.  These two measures would incentivise people to answer the questions that no-one likes the look of and reduce the relative value of answering easy questions.