how to remove a file from git to never exist at all so i pushed a ouath key file into my git branch from my local copy. how do i overwrite commits in git to remove the oauth key file?  i tried doing   git rm cache /storage/oauth.key and did a git add, git commit, git push to my branch but the file is still there.  i also tried doing   git revert commitID  but got an error    error: commit 5ac87ad863059396jkljkljlkjce4c64 is a merge but no -m option was given. fatal: revert failed   please advice.
How do you fix a bad merge, and replay your good commits onto a fixed merge? I accidentally committed an unwanted file (filename.orig while resolving a merge) to my repository several commits ago, without me noticing it until now. I want to completely delete the file from the repository history.   Is it possible to rewrite the change history such that filename.orig was never added to the repository in the first place?
How should I approach obvious proofs like these    I have been trying but couldn't find an elegant way to work these. Any help is highly appreciated ! Especially looking for a nice proof/hint for first problem I have a problem with this limit, I don't know what method to use. I have no idea how to compute it. Is it possible to compute this limit with the McLaurin expansion? Can you explain the method and the steps used? Thanks. (I prefer to avoid to use L'Hospital's rule.)  $$\lim _{x\to 0}\frac{x\bigl(\sqrt{3e^x+e^{3x^2}}-2\bigr)}{4-(\cos x+1)^2}$$ Is "Logan" the last movie with Hugh Jackman as Wolverine? has played the role of Wolverine as a major character in various X-Men films since 2000 and contributed highly to the brand of the X-Men movie series. But is he playing the Wolverine character for the last time in Logan?  I am getting to know from my friends that  is the last movie in which he is playing Wolverine and they all say that this is his last contracted film.  Are these rumors true? Is there any official information that confirms that this is Hugh Jackman's last movie as Wolverine? Is it possible to access a 64-bit dll from a 32-bit application? By looking at this picture:    The earth is near the center of the universe. I've read that the universe look the same no matter where the observer is located. It is the same distance everywhere.  So I understand that for general relativity the universe need to be homogeneous and isotropic, so it will look the same no matter where I am.  But what if I'm on one of the planets near the right or left of the image, then if I draw the same picture of the universe, but from my perspective, then I would be also located in the center? If that's not the case (I'm actually near an edge), then part of my sky would be completely dark, and all the sky that way won't be isotropic? I can run faster than _____. (1) him (2) he? Consider the sentence &quot;I can run faster than 15 miles per hour.&quot; Its meaning is clear and to my eyes obviously grammatically correct. Now let me present some variations that have given me trouble for a long time.  I am faster than 15 miles per hour. – To me this is clearly incorrect. Directly comparing me to a speed doesn't seem right. We need to compare my speed to a speed, or me to another person.  I can run faster than him. – Compared to the base sentence, there is a distinct shift in meaning of the comparison. While before I named a speed faster than which I can run, now I am naming a person. It doesn't seem quite right. I realize the parts of speech can change, but my initial objection is that &quot;him&quot; is not a speed.  I can run faster than he. – This seems most correct to me, but still somehow feels objectionable. Is this in fact the correct way to say it? And if so, is it proper as is or need I say &quot;... faster than he can&quot; or even &quot;... faster than he can run?&quot;  I am faster than him. – With &quot;am&quot; instead of &quot;can run&quot; it now seems slightly more correct. But is it?  I am faster than he. – I'm in doubt here. It doesn't seem wrong to me to say, &quot;I am faster than he is&quot; or even &quot;I am faster than he is fast.&quot; (Though I suppose that is a given since I could hardly properly compare to some other category as in &quot;I am faster than he is smart.&quot;)  My speed is faster than his. – Hmm. This seems more proper as &quot;my speed is greater than his.&quot;   So which of these constructions is correct and which is incorrect? Is there a general rule that I can follow? UPDATE The scholarly article  may be of great interest to some readers!  Once we accept that the elided constituent and its antecedent can differ in form, it becomes reasonable to ask how large this difference can be. The answer in Rooth (1992), Fiengo and May (1994), Chung et al. (1995) and subsequent work is that the wiggle room is actually quite small: the elided constituent and its antecedent are allowed to differ only in the realization of inﬂectional morphology. Other than that, both constituents have to be syntactically and lexically isomorphic. I started by Time Series Analysis by Hamilton, but I am lost hopelessly. This book is really too theoretical for me to learn by myself.   Does anybody have a recommendation for a textbook on time series analysis that's suitable for self-study? Is there an unsubdivide function in Blender? An Olympiad problem in prime numbers :can we proof that "n" is prime in this case " Let x,n ∈ $\mathbb{N}$  such that :  1+$x^1$+$x^2$+$x^3$+....+$x^{n-1}$ is prime .  Proof that n is prime .  I actually suppose that n isn't prime absurdly so n=p×k such as p is prime ,I also use the $a^n$-$b^n$ formula  and find that $x^k$-1/$x^1$-1 so that means that k=1 and then  n=p which is absurd. Does Anyone has another answer ? It's so annoying to drag it over and over again. How to change default position of a console? R code to solve for probability of normal distributions? I don't understand which R code I am supposed to be using to figure these problems out. I brief explanation of what the code is doing would be amazing. The problems below are two different applications I'm expected to understand and I don't get either. Thank you!  Problem 1. Let Z~N(0,1) For each of the following, find c such that the equation is true.   a) P(Z&lt;c) = 0.8413  b) P(0&lt;Z&lt;c) = 0.3051  c) P(-c&lt;Z&lt;c) = 0.8664   Problem 2. X~N(3,4) compute  a) P(X&gt;3)  b) P(1&lt;X&lt;8)  c) P(-1.5&lt;X&lt;1) MySQL Prepared statements with a variable size variable list How would you write a prepared MySQL statement in PHP that takes a differing number of arguments each time? An example such query is:  SELECT `age`, `name` FROM `people` WHERE id IN (12, 45, 65, 33)   The IN clause will have a different number of ids each time it is run.  I have two possible solutions in my mind but want to see if there is a better way.  Possible Solution 1 Make the statement accept 100 variables and fill the rest with dummy values guaranteed not to be in the table; make multiple calls for more than 100 values.  Possible Solution 2 Don't use a prepared statement; build and run the query checking stringently for possible injection attacks. I have a question about the following passage on pg. 89 of Zee's QFT in a nutshell:     At first sight, what Dirac wanted does not make sense. The equation is supposed to have the form "some linear combination of $\partial_\mu$ acting on some field $\psi$ is equal to some constant times the field." Denote the linear combination by $c^\mu\partial_\mu$. If the $c^\mu$'s are four ordinary numbers, then the four-vector $c^\mu$ defines some direction and the equation cannot be Lorentz invariant.   The simplest equation I can construct that he is referring to is  $$(c^{\mu}\partial_{\mu}-m)\phi(x)=0, $$  for $m&gt;0$. Taking $\phi(x)\rightarrow\phi(\Lambda^{-1}x)$, and $c^{\mu}\rightarrow\Lambda^{\mu}_{\ \ \nu}c^{\nu}$. Then, the left term transforms like   \begin{align*} \Lambda^{\mu}_{\ \ \nu}c^{\nu}(\Lambda^{-1})^{\sigma}_{\ \ \mu}\partial_{\sigma}\phi(\Lambda^{-1}x) &amp;= \delta^{\sigma}_{\ \ \nu}c^{\nu}\partial_{\sigma}\phi(\Lambda^{-1}x)\\ &amp;=c^{\sigma}\partial_{\sigma}\phi(\Lambda^{-1}x). \end{align*}  Then, we have that   $$ (c^{\sigma}\partial_{\sigma}-m)\phi(\Lambda^{-1}x)=0.$$  But doesn't this show that the equation is Lorentz-invariant? How to compare two Pearson correlation coefficients Since a few days I do not get ahead when trying to compare two Pearson correlation coefficients. Imagine that I've got two datasets where on each I do a correlation between Land Surface Temperature and an urban metric. The datasets are different in their length, so the first one has round about 160.000 observables and the second one has about 2400 observables. For the correlation on the first dataset I get a Pearson of -0.74 and for the second I get -0.885. Now I want to find out whether these coefficients are significantly different from each other. Is there any appropriate method you could suggest?  I already played around with the Fisher-Z-Transformation, but from my point of view with no purposeful results. When I calculate the Fisher-Z on my coefficients, it results in 20.95 (Fisher-Z).  I would be very happy about suitable advices. I am drawing some graphs with tangents. I calculated the tangent should be centered at x=57/27 which is approximately x=2.11. I'm currently using the pos and sloped keys for nodes to draw tangents, but I'm not happy about the result; the tangents don't really align.   I think this is because the pos key calculates the actual length of the graph while the graphs don't have the same length.  I'm sure I can somehow let LaTeX do the calculations for me so as to align the slopes vertically at an x value of my choice. But how?  PS: The below document requires a working installation of gnuplot to compile.    \documentclass{standalone}   \usepackage{pgfplots} \pgfplotsset{compat=1.10} \usetikzlibrary{arrows, decorations.markings,intersections}  \makeatletter \tikzset{     nomorepostaction/.code=\makeatletter\let\tikz@postactions\pgfutil@empty,      my axis/.style={         postaction={             decoration={                 markings,                 mark=at position 1 with {                     \arrow[ultra thick]{latex}                 }             },             decorate,             nomorepostaction         },         thin,         -,         every path/.append style=my axis     } } \makeatother  \definecolor{headtitle}{RGB}{167,63,63}  \begin{document} \begin{tikzpicture}   \begin{axis}[%       axis line style={my axis},       xlabel = $U_A$,       ylabel = $S$,       xmin = 0, xmax = 3.25,       ymin = 0,       xtick={1,1.5},       xticklabels={$U_{B,\mathrm{initial}}$,$U_{A,\mathrm{initial}}$},       xticklabel style={             inner sep=0pt,             anchor=north east,             rotate=35         },       ytick=\empty,       height=.66\linewidth, width=\linewidth-4.5\tabcolsep,       axis lines*=left,       every axis y label/.style={at=(current axis.above origin),anchor=east},       every axis x label/.style={at=(current axis.right of origin),anchor=west}]%     \addplot+[mark={},draw=headtitle] gnuplot[raw gnuplot] {%       set samples 51;       plot [0:3] log(3*(3-x)+1);       } node[sloped,above,pos=.63333,       minimum height=1cm,minimum width=1cm] (SB) {} node[pos=0.6,pin=45:{\color{black}{$S_B$}}] {};      \addplot+[mark={},draw=headtitle] gnuplot[raw gnuplot] {%       set samples 51;       plot [0:3] log(9*x^2+6*x+1);       } node[sloped,above,pos=.83333,       minimum height=1cm,minimum width=1cm] (SA) {} node[pos=0.25,pin=-15:{\color{black}{$S_A$}}] {};       \addplot+[mark={},draw=headtitle] gnuplot[raw gnuplot] {%       set samples 51;       plot [0:3] log(9*x^2+6*x+1)+log(3*(3-x)+1);       } node[sloped,above,pos=.775,       minimum height=1cm,minimum width=1cm] (St) {} node[pos=0.525,pin=165:{\color{black}{$S_\mathrm{total}$}}] {};      \path (SB.south east) edge[headtitle,very thick] node {} (SB.south west);      \path (SA.south east) edge[headtitle,very thick] node {} (SA.south west);      \path (St.south east) edge[headtitle,very thick] node {} (St.south west);   \end{axis}% \end{tikzpicture}% \end{document} I have a Macbook and an iMac, generally I work on my Macbook, but sometimes I need that information on my iMac. My OS is Mac OSX Snow Leopard. Folders Completely Hidden Except via Save As I'm using an audio program called Supercollider on Windows 10. I have saved some files in a folder called "tunes" from SC via Save As, but Windows Explorer and CMD both seem unable to recognise access or recognise the "tunes" folder.  C:\Users\HP&gt;cd "C:\Program Files (x86)\SuperCollider-3.7.2\supercollider-robin\tunes" The system cannot find the path specified.  C:\Program Files (x86)\SuperCollider-3.7.2\supercollider-robin&gt;dir/a doesn't show it either.  However, when saving from SC with Save As, it's there clear as day. I can even shift+right-click to get the path: "C:\Program Files (x86)\SuperCollider-3.7.2\supercollider-robin\tunes"  This makes no sense to me. Can anyone explain and tell me how to access my folder tunes folder please? Name of component on output side cable of a DC power adapter? What is the name of this component (circled in red) of a charger?    What are the uses of this component? Time complexity of nested for-loop Multiplicative nature of the separability degree In what follows, let $E / F$ be an algebraic extension, $h(x),f(x)\in F[x]$ polynomials, $h(x)$ irreducible.   Definitions.   We say $h(x)$ is separable if it has not repeated factors. We say $f(x)$ is separable if all its irreducible factors are separable. We say $\alpha\in E$ is separable over $F$, if its minimal polynomial over $F$ is. The extension $E/F$ is separable if all the elements of $E$ are separable over $F$. We define the field $$\newcommand\sclo{\operatorname{Scl}}\sclo_F E= \{\alpha\in E : \text{ $\alpha$ is separable over $F$ }\}$$ as the separable closure of $F$ in $E$. The separability degree of the extension $E/F$ is defined as $$[E:F]_s = [\sclo_F E:F].$$   Now, suppose the extension $E/F$ is finite.  My question is: how can one proof that with these definitions, if $B$ is an intermediate field of the extension $E / F$, then $$[E:F]_s = [E:B]_s[B:F]_s?$$  I know that the purpose of the separability degree is to count in how many ways we can extend certain injective homomorphism to an automorphism. If one starts defining separability degree this way, as done in the book by Lang, the result follows without much difficulty.  I wonder how to achieve it in this way.