Does Thor possess any powers without Mjolnir?
Prior to the spell cast on Mjolnir, did Thor control lightning on his own?
Confidence bands in case of fitting ARIMA in R? Is there a way to get reverse numbering on the enumerate environment? To build a list of publications, I wish to show the most recent on top of the list, while keeping the numbering similar. This can be achieved manually by doing something like:  \begin{enumerate} \item[42] pub num 42 \item[41] pub num 41 \item[...] \item[1] pub num 1 \end{enumerate}   but is there a more principled approach? Do community and moderator deletes penalize in the same way that self-deletes do? I usually use "at a company" but I have encountered some articles using "in a company", "in XYZ firm" or "in an organization".  Which one is right? In Fantastic Beasts: The Crimes of Grindelwald Dumbledore teaches DADA. But from the books we always heard about him as of a Transfiguration teacher (say, in Tom Riddle's days). It is stated in the movie that Dumbledore was prohibited to teach DADA by the Ministry, though the limitations seemed to be canceled at the end of the movie together with the removal of his handcuffs (not completely clear about the teaching though). The strange thing is, however, that Dumbledore was a Transfiguration teacher and even the Head of Transfiguration Department in Hogwarts before Newt's days, as we learn from Pottermore:  Under the guidance of her [McGonagall] inspirational Transfiguration teacher, Albus Dumbledore, she had managed to become an Animagus She [McGonagall] sent an owl to Hogwarts, asking whether she might be considered for a teaching post. The owl returned within hours, offering her a job in the Transfiguration department, under Head of Department, Albus Dumbledore.  That is of course if we accept that Minerva McGonagall in the movie is the same Minerva we know. So it seems that he taught Transfiguration, then for some reason switched to DADA and then to Transfiguration again. While it is possible in general, is there any explanation for the reasons? How to show that topological groups are automatically Hausdorff? On page 146, James Munkres' textbook Topology(2ed),  Show that $G$ (a topological group) is Hausdorff. In fact, show that if $x \neq y$, there is a neighborhood $V$ of $e$ such that $V \cdot x$ and $V \cdot y$ are disjoint.  Noticeably, the definition of topological group in Munkres's textbook differs from that in .  A topological group $G$ is a group that is also a topological space satisfying the $T_1$ axiom, such that the map of $G \times G$ into $G$ sending $x \times y$ into $x \cdot y$ and the map of $G$ into $G$ sending $x$ into $x^{-1}$, are continuous maps. Adjusting space between array rows and columns How to assign dynamic Ids for ui:inputDate element inside aura:iteration? As title says, How do I assign dynamic Ids for ui:inputDate elements inside aura:iteration?  Here is the reproducible version of the problem I am facing:  HelloWorldApp.app  &lt;aura:application &gt;     &lt;c:inputDateExample /&gt; &lt;/aura:application&gt;   inputDateExample.cmp  &lt;aura:component &gt;     &lt;aura:handler name="init" value="{!this}" action="{!c.doInit}"/&gt;     &lt;aura:attribute name="datesList" type="List" /&gt;     &lt;table&gt;         &lt;aura:iteration items="{!v.datesList}" var="dateItem"&gt;             &lt;tr&gt;                 &lt;ui:inputDate aura:id="date-id"                                value="{!dateItem}"                                displayDatePicker="true"                               blur="{!c.fldChanged}"/&gt;             &lt;/tr&gt;         &lt;/aura:iteration&gt;     &lt;/table&gt; &lt;/aura:component&gt;   inputDateExampleController.js  ({     fldChanged : function(component, event, helper) {         console.log('Value changed');         //How do I find from which date element, event is fired??         //The below method finds both date elements because the Id is not unique         var dateComponent = component.find('date-id');         console.log(dateComponent);         console.log(dateComponent[0].get("v.value"));     },     doInit : function(component,event,helper){         var datesArray = [];         datesArray.push("2017-01-01");         datesArray.push("2017-01-31");         component.set("v.datesList",datesArray);     } })   This produces the below output and I need to find which element user is clicking on??    Notes:   I can assign unique Id for tr element but not sure how to use that inside component.find() method. I can assign dynamic id for plain input tags but there is too much markup involved for making these similar to lightning date element. I tried giving html5 data attributes for ui:inputDate but it doesn' accept.   Any workarounds or anything I am missing here? Show $GCD(a_1, a_2, a_3, \ldots , a_n)$ is the least positive integer that can be expressed in the form $a_1x_1+a_2x_2+ \ldots +a_nx_n$ Given $a_1, a_2, a_3, \ldots , a_n$ not all zero, show $\gcd(a_1, a_2, a_3, \ldots , a_n)$ is the least positive integer that can be expressed in the form $a_1x_1+a_2x_2+ \ldots +a_nx_n$. Also deduce $a_1x_1+a_2x_2+ \ldots +a_nx_n = b$ has solutions $\iff \gcd(a_1, a_2, a_3, \ldots , a_n)|b$.   I know that $ax+by=n$ has integer solutions $\iff \gcd(a,b)|n$. I'll need to use induction to show $a_1x_1+a_2x_2+ \ldots +a_nx_n = \gcd(a_1, a_2, a_3, \ldots , a_n)$ has solutions, and then I will be able to say that as $\gcd(a_1, a_2, a_3, \ldots , a_n) | a_1x_1+a_2x_2+ \ldots +a_nx_n $ for any $x_1,x_2, x_3 \ldots x_n$ then $c \leq \gcd(a_1, a_2, a_3, \ldots , a_n)$ and $c \geq \gcd(a_1, a_2, a_3, \ldots , a_n)$, and thus $c=\gcd(a_1, a_2, a_3, \ldots , a_n)$. Circular duplicate link allowed Regular Expression to match valid dates I'm trying to write a regular expression that validates a date.  The regex needs to match the following   M/D/YYYY MM/DD/YYYY Single digit months can start with a leading zero (eg: 03/12/2008) Single digit days can start with a leading zero (eg: 3/02/2008) CANNOT include February 30 or February 31 (eg: 2/31/2008)   So far I have   ^(([1-9]|1[012])[-/.]([1-9]|[12][0-9]|3[01])[-/.](19|20)\d\d)|((1[012]|0[1-9])(3[01]|2\d|1\d|0[1-9])(19|20)\d\d)|((1[012]|0[1-9])[-/.](3[01]|2\d|1\d|0[1-9])[-/.](19|20)\d\d)$   This matches properly EXCEPT it still includes 2/30/2008 &amp; 2/31/2008.  Does anyone have a better suggestion?  Edit: I found  on RegExLib  ^((((0[13578])|([13578])|(1[02]))[\/](([1-9])|([0-2][0-9])|(3[01])))|(((0[469])|([469])|(11))[\/](([1-9])|([0-2][0-9])|(30)))|((2|02)[\/](([1-9])|([0-2][0-9]))))[\/]\d{4}$|^\d{4}$   It matches all valid months that follow the MM/DD/YYYY format.  Thanks everyone for the help. Help proving the primitive roots of unity are dense in the unit circle. I'm having difficulty understanding how to prove that the primitive roots of unity are in fact dense on the unit circle. I have the following so far:  The unit circle can be written $D=\{x\in\mathbb{C}:|x|=1\}$. The set of primitive $m$-th roots of unity is $A_m=\{\zeta_k:\zeta_k^m=1,\zeta_k\text{ is primitive}\}$.  Hence, the set of all primitive roots $A$ is given by the union of $A_m$ over $m=1,2,3,\ldots$. But I can't seem to get started on how to prove that $A$ is dense in $D$. Any group of index 2 is normal I'm trying to understand the proof that any group of index $2$ is normal.   Let $G$ be a group and $H$ a subgroup of index $2$.  I understand that if $x\in H$ then $xH=H=Hx$ since $H$ is a subgroup. However, I don't understand why if $x\in G\setminus H$ then $xH=G\setminus H.$  I know there are other proofs of this on this site but none of them specifically address this question. Forward an invocation of a variadic function in C In C, is it possible to forward the invocation of a variadic function? As in,  int my_printf(char *fmt, ...) {     fprintf(stderr, "Calling printf with fmt %s", fmt);     return SOMEHOW_INVOKE_LIBC_PRINTF; }   Forwarding the invocation in the manner above obviously isn't strictly necessary in this case (since you could log invocations in other ways, or use vfprintf), but the codebase I'm working on requires the wrapper to do some actual work, and doesn't have (and can't have added) a helper function akin to vfprintf.  [Update: there seems to be some confusion based on the answers that have been supplied so far. To phrase the question another way: in general, can you wrap some arbitrary variadic function without modifying that function's definition.] Orientation on $\mathbb{CP}^2$ Can a Muggle inadvertently create a horcrux-like object? I think that we have it well-established (regardless of whether or not one sees this as flawed logic) that Harry is not a Horcrux.  A Horcrux has to be made intentionally, and the recipient is cursed and classified as an "evil object," etc.  Neither of which is true for Harry - so, as stated by JKR herself, Harry is not a Horcrux as such.  But the fact remains that murder can, in fact, accidentally create something that shares a key property of the Horcrux: the soul splits, attaches itself to the nearest recipient, and lingers inside.  As it does in Harry's case.  So my question is: is this only true for wizards?  A Muggle cannot utilize a spell to create a Horcrux.  But, if a Horcrux-like object / being can be created accidentally through murder without intentional Horcrux-creating spells, can this also happen in the case of a Muggle committing murder?    Can a Muggle commit murder, have their soul split, and have the piece of the soul inadvertently attach itself to something nearby without any Horcrux-creating spell being cast? Abandoned colony of military engineer corps Summation of series $\sum_{n=1}^\infty \frac{n^a}{b^n}$? How can we evaluate this series  $$\sum_{n=1}^\infty \frac{n^a}{b^n}?$$  Here $a$ and $b$ are positive integers. If $b=1$ then series will be diverging, in other cases, it will be converging, but how to find this sum?  Isn't there a simple solution which doesn't involve Stirling numbers? This issue came up when I got different records counts for what I thought were identical queries one using a not in where constraint and the other a left join. The table in the not in constraint had one null value (bad data) which caused that query to return a count of 0 records. I sort of understand why but I could use some help fully grasping the concept.  To state it simply, why does query A return a result but B doesn't?  A: select 'true' where 3 in (1, 2, 3, null) B: select 'true' where 3 not in (1, 2, null)   This was on SQL Server 2005. I also found that calling set ansi_nulls off causes B to return a result. How to install KDE along Unity? I have just installed the latest Ubuntu 14.04 and I would like to install KDE along side my Gnome/Unity that I have now. How can I do this?  Thanks!