Apologies if this has been previously asked and answred, I did search but found nothing that provided the answer:  I have an HP Envy8, that came with a power adapter rated Output: 19.5V 3.33A. I also have a loan of an HP Envy x360, for which I don't have a power adapter to hand, but know the rating is 19.5V 2.31A.    My question is: Can I use the higher Amp rated adaptor (3.33A) with the lower rated machine (2.31A) without possible damage.  (I have checked and the adapters fit).
Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.
Why (and how) did using cat on binary files mess up the terminal? If I understand the cat manual correctly:       concatenate files and print on the standard output   cat will take files as argument and print them on standard output. What I don't get is if I use the command:    cat img.png &gt; copy.png   I will obtain 2 png files identical while if I just    cat img.png     I have all chance that my terminal get messed up and misinterpret what I type.     How's that possible?   Binary values are still binary data. Why it does not simply shows a series of 0 and 1 or the interpretation of those binary data in ASCII or whatever the encoding in terminal is?   Is this behavior also possible by cating a text file containing strange characters?   Should a mechanism to prevent this behavior  like try{}catch{} statement should be implemented? Move all files of type to a new folder in windows 7 Here is a question as phrased in Advanced Linear Algebra (Steven Roman):     Show that a linear operator $\tau$ on a finite-dimensional complex inner product space $V$ is normal if and only if whenever $S$ is an invariant subspace under $\tau$, so is $S^\perp$.   I'm only interested in the $\Rightarrow$ direction. Wikipedia (and ProofWiki)  that uses some kind of computation with the trace. Linear Algebra Done Right chooses an orthonormal basis and then uses the fact that $\Vert \tau v \Vert = \Vert \tau^* v \Vert$.  However, the above  proofs seem a bit too computational to me. Can the following argument work?  (Use $\odot$ for orthogonal direct sum.) Suppose that $\tau$ is normal and write $$V=E_{\lambda_1} \odot \cdots \odot E_{\lambda_k}$$ where the $E_{\lambda_i}$ are the eigenspaces of $\tau$. If $S$ is a $\tau$-invariant subspace then $\tau|_S$ is diagonalizable, so $$S=\widetilde{E}_{\lambda_1} \odot\cdots\odot \widetilde{E}_{\lambda_k}$$ where the $\widetilde{E}_{\lambda_i} \le E_{\lambda_i}$ are the eigenspaces of $\tau|_S$ (which could be trivial). Then choose orthogonal complements $D_i$ such that $E_{\lambda_i} = \widetilde{E}_{\lambda_i} \odot D_i$, and then $$S^\perp = D_1 \odot\cdots\odot D_k.$$ Since each $D_i$ is a subspace of an eigenspace, they are all $\tau$-invariant. How to compute $k$'th roots $\!\bmod n$? I have the following equation: $$ n \equiv M^k\mod(b) $$ where n, a, b are integers, and M is unknown. How do I solve this equation to find the M value? Those a and b are public keys of the RSA algorithm and n is the result of encryption. I need to find the encrypted message. datatool with longtable Why doesn't my Bash script recognize aliases? Model a simple 3D spiral shape? I need to model a simple spiral shape. I imagine the best way to do this is with curves, but I am unsure how to create a perfect spiral shape with curves. What's the best/easiest way to make a spiral tube? How can I set the maximum amount of characters in a UITextField on the iPhone SDK when I load up a UIView? Are there tips and tricks to overcome a fear of flying? Are there tips and tricks for people with fear of flying that can makes them have a more pleasant experience when flying? I know drugs can do magic, and . I'm ideally after official advice and recommendations, but other tips and tricks would be nice as well. If n is such that every element $(\mathbb{Z}/n\mathbb{Z})^{\times}$ is a root of $x^2-1$. Prove that $n$ divides 24. I have a hard time formulating proofs.  For this problem, I  can see that if $n$ is equal to $8,$ this statement is true.  $(\mathbb{Z}/8\mathbb{Z})^{\times}$ includes elements:  $1,3,5,7$, and all of these are roots of $1-x^2 \pmod 8.$  And obviously $8$ divides $24.$  But how do I prove this without depending on number calculations and only using theorems?  Help Please?  I need a step by step walk through of how to do this proof and what theorems would be appropriate to use. Does the shape of a containter affect the apparent mass of liquid inside it when measured by a scale? For both containers it is true that:  $p_{bottom}=p_{atm}+\rho gh$ and $F_{bottom}=a*p_{bottom} \iff F_{bottom}=a*p_{atm} + a\rho gh$  I do not know how a scale functions, but I guess that the only force it can count is the force by the liquid on the bottom of each container (the only surface that is in touch with the scale is the bottom of the container). Thus, if we measured the mass of these two masses of water (lets assume that the mass of the containers is negligible) it would appear to be the same in each case. Am I right? I've searched the net for such information and found different command lines, like these ones:  sudo apt-get remove application sudo apt-get remove application*  sudo apt-get remove --purge application sudo apt-get remove --purge application*  sudo apt-get purge application sudo apt-get purge application*   So, what is the correct way? Is it necessary to use that "*"?  After that, I also found these commands:  sudo updatedb sudo locate application sudo rm -rf (file/folder name) $\operatorname{Hom}(X \times Z, Y) \cong \operatorname{Hom}(X, \operatorname{Map}(Z, Y))$ is not true in $\textbf{Top}$ I read that in the category of topological space it is not true that $\operatorname{Hom}(X \times Z, Y) \cong \operatorname{Hom}(X, \operatorname{Map}(Z, Y))$ for every $X, Y, Z$ topological spaces. In particular, I read that this does not work when $Z = \mathbb{R} \setminus \{ 1/n \mid n \in \mathbb{N}\}$. This was not explained, i.e. there was no example.   I am looking for an example or – maybe better – just a hint.  EDIT   $\operatorname{Map}(Z, Y)$ is endowed with the compact-open topology $\cong$ means just bijection; i.e. there is already an obvious bijection as sets, but the claim is that (I think) sometimes the "output function" is not continuous Proving that $\lim_{n \rightarrow\infty} \int_{0}^{\frac{\pi}{2}} \sin(t^n) dt =0$ It is clear that $\lim_{n \rightarrow\infty} \int_{0}^{1} \sin(t^n) dt =0$. (which is not what is to be proved here)  I don't know how to proceed with the remaining part of the integral ie $\lim_{n \rightarrow\infty} \int_{1}^{\frac{\pi}{2}} \sin(t^n) dt$ (I tried substitution and partial integration).  Can anybody give me a hint ? Using Newton's method calculate $ \frac{1}{\sqrt{a}} $ without division Suggest algorithm for the numerical calculation $ \frac{1}{\sqrt{a}} \ a &gt; 0 $ without division, use Newton's method.  My idea is:  $$ \frac{1}{\sqrt{a}} = (\sqrt{a})^{-1} = a^{-\frac{1}{2}}$$ $$ x = a^{-\frac{1}{2}} \Rightarrow f(x)=x^2 - a^{-1}$$ And next step is calulate $ f'(x)=2x $, but after substitution I got: $$ x_{n+1} = \frac{x_n^2+a^{-1}}{2x_n}$$ And know I still have divion, I guess. Maybe you've better idea on this task? What TV movie had lost space cadets who piloted yellow tripod robots, and a squid bad guy? Diagram Software I study computing on an advanced level and I need a program that will make it easier to create flowcharts and other diagrams efficiently. I don't need too many features; I just want something that works! I'm aware that there are many website that do exactly what I need but most of the times when I need to draw diagrams I don't have access to the internet Horizontal spacing issue in \listoftheorems using amsthm + thmtools Ubuntu 12.04 (Wubi) not starting - root.disk corrupted I have Ubuntu 12.04 installed through Wubi on my laptop. For some reason when i click on Ubuntu on start up (when you have to either select windows or Ubuntu) I get the following screen, the grub cursor keeps flashing.  Gnu grub version 1.99-21 Ubuntu 3.4   Minimal bash-like line editing is supported. For the first word, tab lists possible command completions. Anywhere else tab lists possible device or file completions.   grub&gt;   Could you tell me what I can do to fix this problem and to start Ubuntu normally? Will C++ exceptions safely propagate through C code?