I have location points collected from a garmin device stored in an excel sheet in Degree Minutes format --- W00208.172,N1046.977.  I am looking for an Excel formula to convert either to Decimal Degrees or Degrees Minutes seconds Format ?
I am looking for either an online tool or one that I can download to convert DD to DMS.  For example, I want to convert from:  41.590833, -93.620833 to 41° 35′ 27″ N, 93° 37′ 15″ W ...  Those are the coordinates, according to , for Des Moines.
I know that I can use something like cat test.txt | pr -w 80 to wrap lines to 80 characters  wide, but that puts a lot of space on the top and bottom of the printed lines and it does not work right on some systems  What's the best way to force a text file with long lines to be wrapped at a certain width?   Bonus points if you can keep it from breaking words. Let K={(1),(12)(34),(13)(24),(14)(23)} show that K is a normal subgroup of the alternating group of degree A4 and find all the members of A4/K and write down the group table for A4/K.   i know that K is the Klein four group and i have already proven it is a normal subgroup but i need a start on approaching the A4/K part of this question no direct answers are necessary,just ideas thank you! :) I understand that faster-than-light communication is impossible when making single measurements, because the outcome of each measurement is random. However, shouldn't measurement on one side collapse the wave function on the other side, such that interference effects would disappear? Making measurements on "bunches" of entangled particles would thus allow FTL communication, by making observed interference effects appear or disappear. How does such an experiment not:  1) Clearly imply that faster-than-light communication is possible?  or  2) (if #1 is rejected) Imply that measurement of one half of an entangled pair does not cause the collapse of the other half's wave function.  Why doesn't this thought experiment clearly show that if we maintain that FTL communication is ruled out, we must also rule out "universal collapse" in the Copenhagen interpretation?  EDIT: Here is an example of an explicit experiment (though I think experts could come up with something better):  You can entangle a photon with an electron such that the angle of the photon is correlated with the electron's position at each slit of a double slit experiment. If the photon is detected (it's outgoing angle measured), then which-path information is known, and there is no interference. If the photon is not detected, the interference remains.   The experiment is designed such that the photon and electron go in roughly opposite directions, apart from the tiny deflection which gives which-path information. You set up a series of photon detectors 100 ly away on one side, and your double slit experiment 100 ly away in the opposite direction. Now you produce the entangled pairs in bunches, say of 100 entangled pairs, each coming every millisecond, with a muon coming between each bunch to serve as a separator.   Then the idea is that someone at the photon detector side can send information to someone watching the double-slit experiment, by selectively detecting all of the photons in some bunches, but not in others. If all of the photons are detected for one bunch, then the corresponding electron bunch 200 ly away should show no interference effects. If all of the photons are not detected for one bunch, then the corresponding electron bunch 200 ly away would show the usual double-slit interference effects (say on a phosphorus screen). (Note that this does not require combining information from the photon-detector-side with the electron-double-slit side in order to get the interference effects. The interference effects would visibly show up as the electron blips populate the phosphorus screen, as is usual in a double-slit experiment when which-path information is not measured.)  In such a way the person at the photon detectors can send '1's and '0's depending on whether they measure the photons in a given bunch. Suppose they send 'SOS' in Morse code. This requires 9 bunches, and so this will take 900 milliseconds, which is less than 200 years. The point is that such an experiment would only work if you assume that the measurement of the photon really does collapse the wave function nonlocally. How do I calculate my skill modifier? I'm trying to fill out the skills section on my first character, but when I look at the character sheets in the Starter Set as examples of how to make a character, the skills that are circled have higher modifiers than their Dexterity or Strength or whatever should make them.  I've filled out all skills but those. What do I add to the ability modifier to get those numbers?   My abilities are Strength 13, Dexterity 14, Constitution 11, Intelligence 15, Wisdom 8, and Charisma 8. Proficiencies are Arcana, Athletics, History, Investigation and Stealth. My saving throws are Strength and Dexterity.   I just started D&amp;D and have the Player's Handbook, DM's Guide, Monster Manual, and the Starter Set. Link to the recommended job is broken in the mobile apps The link to the recommended job in the app brings you to a page with the text: Not Found    Looking at the link it seems like after changing the URL structure in Stack Overflow Jobs they have not been updated in the apps.  For the job in the screenshot this is the used URL in the app:    The correct URL is: Why is foo.hasOwnProperty('__proto__') equal to false? How to make terminal transparent while still having its own background image? Is there a way to give terminal specific background image and make it 50% transparent at the same time? How to know if something is a primitive concept, a law, a definition or a theorem Some basic Physics books are often misguiding in the sense that they don't make clear whether something is a primitive concept, a law, a definition or a theorem. This is often a little confusing. I've asked here some moments ago if there's a definition of force, and I've been redirected to a question about whether Newton's Laws are laws or definitions of mass and force.  This is just an example, but there are many others, like for instance, the conservation of energy, which some books present as a theorem, and some places says that this is a law of Physics. Time on the other hand, is something that according to Feynman's lectures on Physics, cannot be defined, so we just say how to measure it and leave it as a primitive concept.  In this context: how in general can we identify whether something is a primitive concept, a fundamental law of Physics, a definition or a theorem? In my D&amp;D 5e campaign one of the PCs who's a wood elf started dating a dark elf, and as a result she got pregnant and she is about to give birth. One of the other players had their PC die and he is considering playing as the child of the couple.  My question is, which race is the child going to be? What plot points are missing in the Harry Potter movies that are in the novels? Why is there something instead of nothing? A simple but fundamental question.    The "something" means the whole Universe (known and unknown), it could be represented as the reality version of the set of all sets, which is itself . It includes all the  and such.  A better version of the whole Universe could be described with a .  The "nothing" means an absence of the whole Universe, not a particular void or emptiness in the whole Universe but a nonexistent whole Universe. Reinstall software-center in Ubuntu 16.04 Let $d=GCD(n^2+5,n^3-5n^2+6n)$ show that $d|630$ I'm trying to wrap my head around how SQL Server decides to grant certain rights based on a users login privileges.  If a user is part of a group "READ ONLY" which has access to DB1, but they are also a part of a group "SysAdmin" which has full db owner rights to the same DB1, which rights are they given when they log in?  On a similar note. What if they are part of a group but also have a standalone account with other middle of the road privileges? I want to know if my server is running Subversion 1.5.  How can I find that out?  Also would be nice to know my SVN client version number. svn help hasn't been helpful.  Note: I don't want my project's revision number, etc. This question is about the Subversion software itself. I currently have an ec2 &quot;t2.nano&quot; instance up and running. I would like to switch to a &quot;t2.micro&quot;. In order to do that, I need to stop the instance. But I would lose my IPv4 address in the process. And I do not want that (because I have several ssh tunnels up and running from rasps in the wild that are currently hard coded to connect to this IPv4 address). I decided to create an Elastic IP address. But I understand that by creating an Elastic IP address and assigning it to my current ec2 instance, I would lose my current IPv4 address too. Is it possible to create an Elastic IP address from the current IPv4 address of my ec2 instance? If so, how can I do this operation? Attacks of the MAC construction $\mathcal{H}(m\mathbin\|k)$ for common hashes $\mathcal{H}$? Consider a common practically-collision-resistant hash function $\mathcal{H}$ (e.g. , , , ), perhaps based on the  as are the first three. We define a  $\mathcal{C}$ $$(k,m) \mapsto \mathcal{C}(k,m)=\mathcal{H}(m\mathbin\|k)$$ where $\mathbin\|$ denotes concatenation, $k$ is a secret key (constant, or at least of fixed size), and $m$ is a message (possibly of variable length). Assume that an adversary can (iteratively) submit queries with $m_j$ and obtain $C(k,m_j)$, and wants to obtain $k$ or otherwise compute $C(k,m)$ for some $m\ne m_j$.  That MAC $\mathcal{C}$ is not trivially bad. In particular, if $\mathcal{H}$ was indistinguishable from a random function in the , $\mathcal{C}$ would be secure. And even though $\mathcal{H}$ may have the , it does not turn into a devastating attack on $\mathcal{C}$.  The less impractical generic attack that I see is that if a collision was known for $\mathcal{H}$ with the colliding messages of moderate identical length, it could be deduced countless collisions for $\mathcal{C}$. Hence security is demonstrably not better than collision-resistance of $\mathcal{H}$ (for identical-length messages). We could assume that $k$ is half the size of the result of $\mathcal{H}$, and hope that the security is about  or  or , 280, 2128, 2256 hash rounds for SHA-1, RIPEMD-160, SHA-256, SHA-512.   What are the known attacks against $\mathcal{C}$ (better than the above), and their cost, for each of these common hashes?  Is there hope for an argument that an attack against $\mathcal{C}$ would turn into an attack of similar cost against $\mathcal{H}$, or hint of the contrary?  Update: this  is of interest, but I fail to find that it really answers the present question.  Update 2: I am aware that the construction considered is weaker than , and in particular is vulnerable to collision on $\mathcal H$; I stated that, and that it is thus pointless to have the key wider hopeless to target security against some attacks better than half the hash's size. I'm asking exactly what cryptanalytic attack better than finding a collision on $\mathcal H$ there are. There is room for such an attack only by exploiting a weakness in the structure or/and the round function of a concrete $\mathcal H$. ArrayList vs List I saw this reply from Jon on :     If you want a single collection to   contain multiple unrelated types of   values, however, you will have to use   List&lt;object&gt;   I'm not comparing ArrayList vs List&lt;&gt;, but ArrayList vs List&lt;object&gt;, as both will be exposing elements of type object. What would be the benefit of using either one in this case?  EDIT: It's no concern for type safety here, since both class is exposing object as its item. One still needs to cast from object to the desired type. I'm more interested in anything other than type safety.  EDIT: Thanks Marc Gravell and Sean for the answer. Sorry, I can only pick 1 as answer, so I'll up vote both. Why does my regular expression work in X but not in Y? I wrote a regular expression which works well in a certain program (grep, sed, awk, perl, python, ruby, ksh, bash, zsh, find, emacs, vi, vim, gedit, …). But when I use it in a different program (or on a different unix variant), it stops matching. Why? How to check if click event is already bound - JQuery