It says in my textbook that we cannot use the parallelogram law of addition for two parallel vectors, but the triangle law always applies, I didn't get this at all. How does the triangle law apply if two vectors, or two sides of the triangle, are parallel to each other? And if you guys say that it is a duplicate of any other question, then please explain why.
How Triangle Law and Parallelogram law of addition of Vectors are different?Ain't they.  Please don't tell me the things written in book......give me the appropriate reason.And how do i distinguish between the two while adding vectors,what am i trying to say is i get really confused where to use parallelogram law and where triangle law  P.s:my basics are really weak though!May be the question might not be right
Finite order endomorphisms Why the finite order endomorphisms are diagonalizable over the complex numbers (or any algebraically closed field where the characteristic of the field does not divide the order of the endomorphism) with roots of unity on the diagonal? CSS Selector that applies to elements with two classes Let $G$ be abelian, $H$ and $K$ subgroups of orders $n$, $m$. Then G has subgroup of order $\operatorname{lcm}(n,m)$. I've seen a lot of games in the LCS and All-Star, and they sometimes changed bot and top lanes.   When is this a good practice? What do you gain from doing this? Should I do this to avoid counters or if my solo laner has more sustain than theirs? More than one private key for RSA In an RSA-encryption scenario, Bob's public key pair $(n, e)$ is $(143, 43)$. An attacker Mallory tries brute-force and comes to $d = 7$ as the private key. The value of $φ(143) = 120$ is not known to Mallory. However from $43 \cdot d \equiv 1 \bmod 120)$, one can calculate the first positive element $d = 67$ from multiplicative group $d = 120 + 67n$ and $n \in \mathbb{Z}$ $d = 7$ clearly doesn't fit in that multiplicative group, so how come it can successfully decrypt the encryption? How to remove snap completely without losing the Chromium browser? Show that if $fd'=f'd $ and the pairs $f, d $ and $f',d' $ are coprime, then $f=f' $ and $d=d' $. Show that if $fd'=f'd $ and the pair $f, d $ are coprime, that is gcd($d,f $)=1, as is the pair $f',d' $, then $f=f' $ and $d=d' $.  This should be simple, but I couldn't verify it. Thanks in advance! I am a bit lost how one has deduced the formula for electric field with electric dipole because of some inconsistency between different sources. The  contains a delta function in the formula, but  gives only the formula without the delta function,  $$\bar{E} = -\nabla \phi = \frac{-p}{4\pi \epsilon_{0} r^{3}} ( \hat{e}_{z}-3\hat{u}_{r}(\hat{u}_{r} \cdot \hat{u}_{z}) ) $$  Is it intentionally left out?  My notes mention that the dipole is with a circular thing $P=Q d$ where $d$ is distance and $Q$ is charge. How to plot points in a color corresponding to some value? Helllo!  For a project that I am doing, I need to render the my model to a sprite sheet. This is all fine, except that the model has a cloak, which uses a cloth animation. I need to smoothly transition from the end of the cloth simulation to the start, so it doesn't just jerk back, but I can't find any way of doing this.  Thanks in advance. I read news on the BBC (on its website) this morning. When I was reading the news I noticed the definite article the was missing in a sentence. As per my opinion, the reporter missed the article the. But I also thought that the reporter also had some point as he did not use the article there. So I just wanted to confirm so landed here to get some help on it.     On the website:      It also proclaimed the group's leader, XYZ  (name), as caliph and   "leader for Muslims everywhere".      As per my opinion it should have been:      It also proclaimed the group's leader, XYZ  (name), as the caliph and   "leader for Muslims everywhere".   Source link: If $f:E\rightarrow S$ is an elliptic curve over a scheme $S$ (so $f$ is proper and smooth of relative dimension one with geometrically connected fibers of genus one, equipped with a section $0:S\rightarrow E$), then is the sheaf $\underline{\omega}_{E/S}:=f_*\Omega_{E/S}^1$ actually free of rank one? According to the statement of Grothendieck-Serre duality in Hida's book Geometric Modular Forms and Elliptic Curves, there should be a canonical isomorphism $\underline{\omega}_{E/S}\cong\mathcal{Hom}_{\mathscr{O}_S}(R^1f_*\mathscr{O}_E,\mathscr{O}_S)$, and the first result on elliptic curves in this book is that $R^1f_*\mathscr{O}_E\cong\mathscr{O}_S$. It's also not clear to me whether $S$ is being assumed (locally) Noetherian, but if that's necessary for Grothendieck-Serre duality to hold, then I'm fine with assuming it. I can't find another reference with a statement of Grothendieck-Serre duality in this generality which does not use the language of derived categories (which I unfortunately don't understand).  The reason I'm kind of skeptical about this is that in Hida's book, as well as in Katz-Mazur, it is said that $\underline{\omega}_{E/S}$ is invertible, so that an $\mathscr{O}_S$-basis $\omega$ for $\underline{\omega}_{E/S}$ can be found locally on $S$. If the invertible sheaf in question were really trivial then one would be able to choose a global $\mathscr{O}_S$-basis for $\underline{\omega}_{E/S}$, and there would be no reason to talk about doing so locally. Hida goes on to say that, choosing an $\mathscr{O}_S$-basis $\omega$ locally on $S$ allows one to regard $(\Omega_{E/S}^1,\omega)$ as a relative effective Cartier divisor in $E/S$, which also doesn't make complete sense to me because if we can only find $\omega$ locally, how are we getting a global section $\omega\in H^0(E,\Omega_{E/S}^1)=H^0(S,\underline{\omega}_{E/S})$ (unless $\underline{\omega}_{E/S}$ really is trivial)? A logic puzzle involving a balance. Possible Duplicate:          You have 12 balls and you know that they all weigh the same except for 1 which is heavier or lighter than all the others (you don't know which though). How can you make sure you know which ball is the heaviest/lightest in only 3 weighings?  The way I approached it was to split up the 12 balls into three sets of 4 and weigh two of the sets. If the sets balanced the scale, then I know the ball I am looking for must be in the set of 4 balls not weighed, else, I disregard said set and arbitrarily choose the heaviest set of 4 (as opposed to choosing the lightest set). I split the heaviest set of 4 balls into 2 and weigh that... etc.  Repeating this process until all 3 tries have been "used up", even if everything just so happened to be in your favor (the arbitrary choice you have in choosing the heaviest or lightest set happens to be the correct choice) in the end you still end up having to choose between 2 balls. A 50% chance is good, but I am wondering, is there a way to make sure 100%? Assume you have already completed your undergrad and have been working for a number of years. Does one need to be part of a university or a learning institution to publish papers? NOTE: I am not interested in calling /secur/logout.jsp since it ends all the active salesforce sessions.  I am developing a web application that is registered on salesforce as a connected app, so I am using salesforce credentials to authorize the user.  Application is developed in REST API and the communication with salesforce is happening in restful manner.   Auth url:   Authorization:  Method 1: If there is no salesforce session active, The user is taken to salesforce login page, where he enters his salesforce details to be authorized and after which he is taken to home page of my web application.  Method 2: If there is already a salesforce session active in another tab, the user is directly authorized and is taken to home page of my web application.  Now I am trying to implement logout button for my application, such that the following scenarios are covered,  Scene 1: The user is authorized using method1, and the user press the logout. Upon trying to logback the user is prompted for credentials.  Scene 2:  The user is authorized using method2, and the user should use logout to logout of the web application (not from active sessions). Upon login, the user should be again able to login using method2.  Can someone help me on how to implement the logout button such that it covers scenario 1 &amp; 2.  Thanks in advance. Given a dictionary like so:  my_map = {'a': 1, 'b': 2}   How can one invert this map to get:  inv_map = {1: 'a', 2: 'b'} I want to learn more about hopf algebras but I am having trouble finding a down to earth introduction to the subject with lots of motivation and examples. My algebra knowledge ranges from Dummit and Foote, Atiyah-Macdonald commutative algebra, and Hartshorne level algebraic geometry.  What are good places to look at for a hopf algebra beginner? My main motivation is for studying groupoid schemes from an algebraic point of view. Which mathematical operation does the right hand rule for current come from? I am currently wondering about the famous .  Where does it come from mathematically that when you point with your thumb in the direction of the current, your curved fingers will point in the direction of the $B$-field? In other words, which mathematical operation does it come from? Probably it has to do with some vector product or Stokes theorem application, but I am not quite sure about it. Suppose $G$ is a finite group and I know for every $k \leq |G|$ that exactly $n_k$ elements in $G$ have order $k$. Do I know what the group is? Is there a counterexample where two groups $G$ and $H$ have the same number of elements for each order, but $G$ is not isomorphic to $H$? I suspect that there is, but I haven't thought of one. Im having trouble with the second part of this question,  Let $H$ be a normal subgroup of $G$ with $|G:H| = n$,  i) Prove $g^n \in H$ $\forall g \in G$ (which i have done)  ii) Give an example to show that this all false when $H$ is not normal in $G$.(which I am having trouble with showing)  Any suggestions?