Can someone tell me the significance of * sign after a file name ?
I noticed that if I run ls -F on a directory, some of the entries have a * or a @ after them.   spuder@ubuntu:~$ ls -F /sbin acpi_available*   getpcaps*           lvmconf*                 ntfscp*        start-stop-daemon* agetty*           getty*              lvmdiskscan@             ntfslabel*     status@ alsa*             halt@               lvmdump*                 ntfsresize*    stop@ alsactl*          hdparm*             lvmsadc@      spuder@ubuntu:~$ ls -F ~ daq-0.6.1/  examples.desktop       noname-cache.lib  snort-2.9.1/   Templates/ Desktop/    jpgraph-1.27.1/        noname.sch        snortfiles/    Ubuntu One/ Documents/     According to the ls man pages   spuder@ubuntu:~$ man ls ... -F, --classify   append indicator (one of */=&gt;@|) to entries ...   I'm guessing that @ means symbolic link,     What do these other indicators mean ( */=&gt;@| )  ?
Is there a way to prove that the order of an element in a Group divides the order of the Group, WITHOUT USING LAGRANGE'S This is a very easy fact we use in Group Theory,  But somehow, I wondered that whether there may be another way (other than Lagrange's Theorem) to prove that the order of an element divides the order of Group.  I attempted to go on the term "exponent" of the Group (just assume that G is a Finite Group), which we may define the least common multiple of orders of elements in G. But this exponent divides $|G|$, since the order of each element divides $|G|$. So it became a little paradox.   Shall I think that; before teaching this fact in a Course, one should teach about Lagrange's first? Why do I get TypeError: can't multiply sequence by non-int of type 'float'? I am typing to get a sale amount (by input) to be multiplied by a defined sales tax (0.08) and then have it print the total amount (sales tax times sale amount).  I run into this error. Anyone know what could be wrong or have any suggestions?   salesAmount = raw_input (["Insert sale amount here \n"]) ['Insert sale amount here \n']20.99 &gt;&gt;&gt; salesTax = 0.08 &gt;&gt;&gt; totalAmount = salesAmount * salesTax  Traceback (most recent call last):   File "&lt;pyshell#57&gt;", line 1, in &lt;module&gt;     totalAmount = salesAmount * salesTax TypeError: can't multiply sequence by non-int of type 'float' Is division of matrices possible? Top-bar hat misplaced In my profile my hat is on the correct position, but not in the top-bar. This is new. It worked until now.    Works neither in Chrome nor in Firefox. Can chicken not completely cooked then cooled be fully cooked later? If we have two circles in the plane described by $(x_1, y_1, r_1)$ and $(x_2, y_2, r_2)$ we can determine if they are completely disjoint by simply:  $$(x_1 - x_2)^2 + (y_1 - y_2)^2 &lt; (r_1 + r_2)^2$$  Assume this is not the case, we now want to know if one completely overlaps the other.  (That is: if the second circles interior is a subset of the first circles interior.)  If $(x_1, y_1) = (x_2, y_2)$ than we can trivially compare radii, so lets assume their centers are distinct.  The way I have imagined is to create a parametric equation of the line that connects the two centers:  \begin{align} x_p(t) &amp;= x_1 + t(x_2 - x_1) \\ y_p(t) &amp;= y_1 + t(y_2 - y_1) \end{align}  Then we calculate the two line segments (represented as two pairs of t values) where the circles intersect this line.  One is a subset of the other if and only if the corresponding circles are subsets of each other.  Is there a simpler approach I am overlooking? Immediately, his insides started writhing as though he'd just swallowed live snakes -- doubled up, he wondered whether he was going to be sick -- then a burning sensation spread rapidly form his stomach to the very ends of his fingers and toes -- next, bringing him gasping to all fours, came to a horrible melting feeling, as the skin all over his body bubbled like hot wax -- and before their eyes, his hands began to grow, the fingers thickened, the knuckles were bulging like bolts -- his shoulders stretched painfully and a prickling on his forehead told him that his hair was creeping down toward his eyebrows -- his robes ripped as his chest expanded like a barrel bursting its hoops -- his feet were agony in shoes four sizes too small      Harry potter and the chamber of secrets   It is the description of the feeling of drinking Polyjuice Potion, which makes someone into a different person, from the point of view of Harry Potter turning into Gregory Goyle.  And I don't understand what 'bring him gasping to all fours' means, especially 'four'. Does four here mean number 4? Newtonian mechanics: massless particles Possible Duplicates:             I'm wondering whether or not I should use a plural form noun with a collection name. For example, which one is correct, bookList or booksList (obviously they are variables in a programming language)? After a table of addresses is geocoded, ArGIS provides information about each geocoded address, among those the "match score" of the candidate to which the address was matched, which ranges from 0 to 100. According to their documentation "The match score is based on how well the locations found in the reference data match with the address data being searched."  It seems intuitive that 100 means an address with the exact name was found in the Address locator and 0 means no such address was found. However, I could not find any information about how exactly this score is calculated, particularly if values are somewhere between the extremes. I this known?  I found the pointer to  in the answer to , but I could not find any information in that paper that would answer the question. Deleting a channel on slack.com Why is the Lagrangian a function of the position and velocity (possibly also of time) and why are dependences on higher order derivatives (acceleration, jerk,...) excluded?  Is there a good reason for this or is it simply "because it works". Let $F$ be a field and $F[x]$ a polynomial ring. Let $p(x)$ be an irreducible polynomial.  Show that $\gcd(p(x),q(x)) = 1\Longrightarrow \exists r(x),s(x)$ such that $r(x)p(x)+s(x)q(x) = 1$.  I know the proof for Bezout's identity for , but this proof uses the notion of absolute value, which cannot be applied to a polynomial ring.   I am thinking about a way to prove the statement: Use the Euclidean algorithm to compute $\gcd(p(x),q(x))$ and show that the result is $1$, and somehow go backwards to obtain $r(x)p(x)+s(x)q(x) = 1$, but it is a bit messy, and I'm not yet able to see it completely.  Please offer some help. If you have some other methods, that would be great, too. In my work, we are comparing predicted rankings versus true rankings for some sets of data. Up until recently, we've been using Kendall-Tau alone. A group working on a similar project suggested we try to use the  instead, and that they preferred it. I was wondering what the differences between the different rank correlation algorithms were.  The best I've found was , which claims Spearman is used in place of usual linear correlations, and that Kendall-Tau is less direct and more closely resembles Goodman-Kruskal Gamma. The data I'm working with doesn't seem to have any obvious linear correlations, and the data is heavily skewed and non-normal.  Also, Spearman generally reports higher correlation than Kendall-Tau for our data, and I was wondering what that says about the data specifically. I'm not a statistician, so some of the papers I'm reading on these things just seem like jargon to me, sorry. Black screen after installation of Ubuntu 18.04 It would be nice to  for .  As it is, SE kind of stands out (in a not cool way): Can a countable set contain uncountably many infinite subsets such that the intersection of any two such distinct subsets is finite? What can I do if I forgot my Windows password? I got a brand new Windows 7 machine, installed the operating system, created one account and forgot its password. What can I do?  There is no external CD, the operating system is loaded from somewhere inside the machine.  I already tried to remember passwords and tried all candidates with all possible combinations of caps lock, num lock etc. Horizontal scroll bar occludes text I've been running into this lately.  The scroll-bar gets stuck and makes it difficult to read the text.  I'm running Chrome Version 56.0.2924.87 (64-bit) on macos. Is there an MD5 Fixed Point where md5(x) == x? Is there a fixed point in the MD5 transformation, i.e. does there exist x such that md5(x) == x?