In which comic book did Steppenwolf stab Wonder Woman, and did she die as a result? What was the comic book in which Steppenwolf stabbed Wonder Woman? I saw a comic panel once where he stabbed her.  And did she really die from the wound?
When has Wonder Woman died? I know Wonder Woman has died in canon before, but in which issue did this happen?
I posted a comment to a duplicate question on . But I decided to delete it. Afterwards I voted as duplicate and thought a comment would be generated like     possible duplicate of ...   But it didn't. My guess is that the duplicate-comment won't be generated if a comment exists with that link, even if deleted. Nautilus bookmarks are missing since upgrade to 13.04 My bookmarks are not shown anymore after upgrading to 13.04 Raring ringtails and I can't add any new bookmarks. The function is not shown and the shortcut Ctrl+D isn't working either. Is this functionality just gone for some reason (as the split screen with F3) or is there something wrong with my upgrade?  Thanks for any hints. Drawing simple edge, no arrow I have  \begin{tikzpicture}[-&gt;,auto,node distance=3cm,   thick,main node/.style={draw,font=\bfseries}]   \node[main node] (111) at (0,1) {$X_{1,1}^{(1)}$};   \node[main node] (121) at (0,2) {$X_{1,2}^{(1)}$};   \node[main node] (1n1) at (0,4) {$X_{1,n}^{(1)}$};   \node[main node] (211) at (0,6) {$X_{2,1}^{(1)}$};   \node[main node] (221) at (0,7) {$X_{2,2}^{(1)}$};   \node[main node] (2n1) at (0,9) {$X_{2,n}^{(1)}$};   \node[main node] (n11) at (0,11) {$X_{n,1}^{(1)}$};   \node[main node] (n21) at (0,12) {$X_{n,2}^{(1)}$};   \node[main node] (nn1) at (0,14) {$X_{n,n}^{(1)}$};   \node[main node] (112) at (2.5,1) {$X_{1,1}^{(2)}$};   \node[main node] (122) at (2.5,2) {$X_{1,2}^{(2)}$};   \node[main node] (1n2) at (2.5,4) {$X_{1,n}^{(2)}$};   \node[main node] (212) at (2.5,6) {$X_{2,1}^{(2)}$};   \node[main node] (222) at (2.5,7) {$X_{2,2}^{(2)}$};   \node[main node] (2n2) at (2.5,9) {$X_{2,n}^{(2)}$};   \node[main node] (n12) at (2.5,11) {$X_{n,1}^{(2)}$};   \node[main node] (n22) at (2.5,12) {$X_{n,2}^{(2)}$};   \node[main node] (nn2) at (2.5,14) {$X_{n,n}^{(2)}$};   \node[main node] (11k) at (6,1) {$X_{1,1}^{(k)}$};   \node[main node] (12k) at (6,2) {$X_{1,2}^{(k)}$};   \node[main node] (1nk) at (6,4) {$X_{1,n}^{(k)}$};   \node[main node] (21k) at (6,6) {$X_{2,1}^{(k)}$};   \node[main node] (22k) at (6,7) {$X_{2,2}^{(k)}$};   \node[main node] (2nk) at (6,9) {$X_{2,n}^{(k)}$};   \node[main node] (n1k) at (6,11) {$X_{n,1}^{(k)}$};   \node[main node] (n2k) at (6,12) {$X_{n,2}^{(k)}$};   \node[main node] (nnk) at (6,14) {$X_{n,n}^{(k)}$};   \node[main node] (11n2) at (9.5,1) {$X_{1,1}^{(n-2)}$};   \node[main node] (12n2) at (9.5,2) {$X_{1,2}^{(n-2)}$};   \node[main node] (1nn2) at (9.5,4) {$X_{1,n}^{(n-2)}$};   \node[main node] (21n2) at (9.5,6) {$X_{2,1}^{(n-2)}$};   \node[main node] (22n2) at (9.5,7) {$X_{2,2}^{(n-2)}$};   \node[main node] (2nn2) at (9.5,9) {$X_{2,n}^{(n-2)}$};   \node[main node] (n1n2) at (9.5,11) {$X_{n,1}^{(n-2)}$};   \node[main node] (n2n2) at (9.5,12) {$X_{n,2}^{(n-2)}$};   \node[main node] (nnn2) at (9.5,14) {$X_{n,n}^{(n-2)}$};   \node[main node] (11n1) at (12,1) {$X_{1,1}^{(n-1)}$};   \node[main node] (12n1) at (12,2) {$X_{1,2}^{(n-1)}$};   \node[main node] (1nn1) at (12,4) {$X_{1,n}^{(n-1)}$};   \node[main node] (21n1) at (12,6) {$X_{2,1}^{(n-1)}$};   \node[main node] (22n1) at (12,7) {$X_{2,2}^{(n-1)}$};   \node[main node] (2nn1) at (12,9) {$X_{2,n}^{(n-1)}$};   \node[main node] (n1n1) at (12,11) {$X_{n,1}^{(n-1)}$};   \node[main node] (n2n1) at (12,12) {$X_{n,2}^{(n-1)}$};   \node[main node] (nnn1) at (12,14) {$X_{n,n}^{(n-1)}$};   \path     (111) edge (112)         edge (122)         edge (1n2)     (121) edge (112)         edge (122)         edge (1n2)     (1n1) edge (112)         edge (122)         edge (1n2)     (121) edge[--,dashed] (1n1); \end{tikzpicture}   I just want simple lines, no arrows. How to manage with edge to achieve that? Thanks Where is the line drawn with domain names which include a trademark? A search on google for "iphone developer" turns up loads of websites which have "iphone" in them, a trademarked name by Apple.  So I'm led to believe that having a domain such as iphonedeveloper.com is ok? Well, you're still using Apple's trademark, but it would be hard to brand yourself otherwise. You're an IPHONE DEVELOPER... right?  Well, what if I want to provide a website where users pay to get a list of the best offers from Ebay? I might have a domain like ebaydeals.com (I don't... i'm just speculating!).  Now I've heard that places like Ebay are really hot on the trigger and fire out emails to people who register domains like that straight away. But whats the difference?  In both cases I'm making money from the trademark, effectively, so is it just down to how lenient the company who owns the trademark is? Or are there rules? Is there a specific "line" you don't cross?  Thanks List only regular files (but not directories) in current directory I have used Windows since childhood, and when I hear the phrase "Windows filesystem" I think of directories (folders) within directories, a folder called SYSTEM, a folder called PROGRAM FILES etc. Is this what the system is? Just the layout of the folders?  And then I recently started using Linux, and my reference book says in the linux filesystem everything starts at root and branches off from there. How is that really different from Windows? I mean, it seems the linux system and the windows system are just two ways of setting up a directory tree.  Is this what file system means? bash: warning: shell level (1000) too high, resetting to 1 What are the relationship between administrators groups of domain, dev computer and of Sharepoint services? I know-know I can search and read but anyway I would need to ask in order to escape possible typos, personal misunderstandings and to better remember.     I develop on a machine with installed Sharepoint 2010 Sever where I have local groups:     Administrators Description: Administrators have complete and unrestricted access to the computer/domain   WSS_Admin_WPG Description: Members of this group have write access to system resources used by Microsoft SharePoint Foundation      **Does the description of "Administrators" ("computer/domain") imply all privileges of "WSS_Admin_WPG" ?    Does the description of **WSS_Admin_WPG (in part of "system resources used by Microsoft SharePoint Foundation") imply Sharepoint Server?**    The WSS_Admin_WPG group has entries of:     "BUILTIN\Administrators (S-1-5-32-544)" group   and some user domain accounts   Is "BUILTIN\Administrators (S-1-5-32-544)" group the same (alias to?) as "BUILTIN\Administrators" entry I observe among Sharepoint Farm Administrators (through "Central Administration")?       Is the entries of domain accounts excessive (or necessary)     in "WSS_Admin_WPG" if these accounts make part of "Administrators" group?     in "Farm Administrators" if these accounts are part of "BUILTIN\Administrators (S-1-5-32-544)" group?     What are relationship (difference) between "BUILTIN\Administrators" and "Administrators"? Where can I find historical data on arrival and departure times of a particular flight? Where can I find historical data on flights, specifically Delta international flights?  I need to find out about cancellations, diversions and any other flight data pertaining on particular route at a given time.  This source has to be official and stand up to legal scrutiny. Recurrence Inequality Define sequence ${a_n}$ as follows: $a_1 = \frac {1}{2}, 2ka_k = (2k-3)a_{k-1}.$  Show that for any natural number $n, \sum_{k=1}^{n} a_k &lt;1$ (No calculus is allowed).  I'm really just stuck on the right way to approach this. It is sufficient to show that $\sum_{k=1}^{\infty} a_k &lt;1,$ but this isn't a series I am familiar with. I tried defining a partial sum series $b_n$ such that $b_n = \sum_{k=n}^{\infty} a_k,$ but that didn't help to find a non-trivial relationship. How to put a full stop at the bottom, not mid-line, after an aligned matrix? Time taken to hit a pattern of heads and tails in a series of coin-tosses Inspired by Peter Donnelly's talk at , in which he discusses how long it would take for a certain pattern to appear in a series of coin tosses, I created the following script in R. Given two patterns 'hth' and 'htt', it calculates how long it takes (i.e. how many coin tosses) on average before you hit one of these patterns.  coin &lt;- c('h','t')  hit &lt;- function(seq) {     miss &lt;- TRUE     fail &lt;- 3     trp  &lt;- sample(coin,3,replace=T)     while (miss) {         if (all(seq == trp)) {             miss &lt;- FALSE         }         else {             trp &lt;- c(trp[2],trp[3],sample(coin,1,T))             fail &lt;- fail + 1         }     }     return(fail) }  n &lt;- 5000 trials &lt;- data.frame("hth"=rep(NA,n),"htt"=rep(NA,n))  hth &lt;- c('h','t','h') htt &lt;- c('h','t','t')  set.seed(4321) for (i in 1:n) {     trials[i,] &lt;- c(hit(hth),hit(htt))     } summary(trials)   The summary statistics are as follows,        hth             htt          Min.   : 3.00   Min.   : 3.000    1st Qu.: 4.00   1st Qu.: 5.000    Median : 8.00   Median : 7.000    Mean   :10.08   Mean   : 8.014    3rd Qu.:13.00   3rd Qu.:10.000    Max.   :70.00   Max.   :42.000    In the talk it is explained that the average number of coin tosses would be different for the two patterns; as can be seen from my simulation. Despite watching the talk a few times I'm still not quite getting why this would be the case. I understand that 'hth' overlaps itself and intuitively I would think that you would hit 'hth' sooner than 'htt', but this is not the case. I would really appreciate it if someone could explain this to me. Proving $6^n - 1$ is always divisible by $5$ by induction I'm trying to prove the following, but can't seem to understand it. Can somebody help?     Prove $6^n - 1$ is always divisible by $5$ for $n \geq 1$.   What I've done:  Base Case: $n = 1$: $6^1 - 1 = 5$, which is divisible by $5$ so TRUE.  Assume true for $n = k$, where $k \geq 1$: $6^k - 1 = 5P$.  Should be true for $n = k + 1$  $6^{k + 1} - 1 = 5Q$  $= 6 \cdot 6^k - 1$  However, I am unsure on where to go from here. The search parameter isanswered ignores acceptances The SE definition of "answered" question is: has an answer that is either accepted or has positive score. But the search parameter isanswered appears to ignore the "accepted" clause: when set to "no" it still returns questions with an accepted answer, as long as it has 0 score.    to reproduce the bug (unless meta effect kicks in and the answers get upvotes).     By the way, it seems that isanswered works only when is:question is present, but I'm not complaining about that... yet.   Also, this parameter is not listed on the , but I'm not complaining about that either... yet. Hexadecapole potential using point particles? We can get monopole $1/r$, dipole $1/r^2$, quadrupole $1/r^3$ and octupole $1/r^4$ potential falloff by placing opposite point charges at the corners of a point, line, square and cube, respectively. My book cryptically says "and so on", how does one get a $1/r^5$ and higher potential falloff with a finite number of point-charges in 3 dimensions? Is there a known mathematical equation to find the nth prime? I've solved for it making a computer program, but was wondering there was a mathematical equation that you could use to solve for the nth prime? What is the best way to copy text to the clipboard (multi-browser)? I have tried: function copyToClipboard(text) {     if (window.clipboardData) { // Internet Explorer         window.clipboardData.setData(&quot;Text&quot;, text);     } else {         unsafeWindow.netscape.security.PrivilegeManager.enablePrivilege(&quot;UniversalXPConnect&quot;);         const clipboardHelper = Components.classes[&quot;@mozilla.org/widget/clipboardhelper;1&quot;].getService(Components.interfaces.nsIClipboardHelper);         clipboardHelper.copyString(text);     } }  But in Internet Explorer it gives a syntax error. In Firefox, it says unsafeWindow is not defined. A nice trick without using : So I need to find the Convergence Radius and Convergence Domain of the complex power series: $\sum\limits_{n=0}^\infty \frac{1}{2^{n}} z^{2^n}$  I've tried looking at the individual parts of the series and rewriting it somehow but couldn't find a way.  It can probably be solved, after a step or two, by the formula $R=\frac{1}{\displaystyle\limsup_{n\rightarrow \infty}\sqrt[n]{|a_n|}}$ .  Thanks. Why does ltablex skip a number in captions? The below example presents two tables with an tabularx environment (taken from package ltablex) and a caption. After each tabularx-table, the table counter skips one, as if both the caption and the tabularx environment increase it, while the latter shouldn't.  \documentclass{report} \usepackage{ltablex} \begin{document}  \begin{table} \caption{Caption 1.} % "Table 1" \begin{tabularx}{\linewidth}{|c|} empty table \end{tabularx} \end{table}  \begin{table} \caption{Caption 2.} % "Table 3" \begin{tabularx}{\linewidth}{|c|} empty table \end{tabularx} \end{table}  \end{document}   My reputation doesn't allow me to upload a picture, but the captions are Table 1 and Table 3 respectively. Check for missing fonts/characters in XeLaTeX?