How to use @p in tellraw? Me and my friends are making a game in minecraft and are using tellraw. How do we use @p in tellraw because we cannot find it anywhere! Thanks
How do I make the player name show up on a /tellraw command? So I am currently making a minecraft custom map (for 1.9). I want to make the player "say" something using /tellraw commands. I did figure out how to make the player name come up using /say commands, but still have no idea how to do it using the /tellraw command.  How do I do that?
Motivation behind the definition of ideal class group Trig integral $\int ( \cos{x} + \sin{x}\cos{x}) \, dx $ Assume we have:  $$ \int (\cos{x} + \sin{x}\cos{x}) \, dx$$  Two ways to do it:  Use $$\sin{x}\cos{x} = \frac{ \sin{2x} }{2} $$ Then $$ \int \left(\cos{x} + \frac{\sin{2x}}{2} \right) \, dx = \sin{x} - \frac{ \cos{2x} }{ 4 } + C. $$ The other way, just see that $ u = \sin(x), du = \cos(x)dx $, $$ \int ( \cos{x} + \sin{x}\cos{x}) \, dx = \sin{x} + \frac{\sin^2{x}}{2} + C. $$  Now the part I don't see fully is, why aren't these results completely equal?  Taking the 2nd result, \begin{align} \sin{x} + \frac{\sin^2{x}}{2} &amp;= \sin{x} + \frac{1}{2} \, \left( \frac{1 - \cos{2x}}{2} \right) \\ &amp;= \sin{x} + \frac{1}{4} - \frac{\cos{2x}}{4}. \end{align}  So you have to absorb $\frac{1}{4}$ into $C$ for them to be equal.  Shouldn't they be equal straight away? Can I travel domestically within the United States with my USA expired passport? I need to fly domestically within the United States. The only ID I have is an expired USA passport.  Can I use that to pass T.S.A.?  Can I use it as ID? .NET Process.Start default directory? I'm firing off a Java application from inside of a C#  console application. It works fine for the case where the Java application doesn't care what the "default" directory is, but fails for a Java application that only searches the current directory for support files.  Is there a process parameter that can be set to specify the default directory that a process is started in? How to mount and unmount hard drives under Windows (the unix way) How to add D-link dwm-156 to usb switch mode for automatic eject of driver CD / switch to modem mode? I am running Ubuntu 13.10, 32-bit.  I had every time need to go terminal to "eject" the windows driver CD,nor gone to disk &amp; eject windows driver CD to make the d-link dwm-156 gsm modem functioning through network manager.  It seems that usb mode switch is not working.  But on my friend's computer with ubuntu 14.04 ,usb mode switch is working and i can connect d-link dwm-156 to mobile broadband through network manager as soon as i get in.  Is there any way to make usb mode switch to eject the windows driver CD of d-link dwm-156 in my ubuntu 13.10,32-bit at start up?   The lsusb output is Bus 002 Device 013: ID 2001:a706 D-Link Corp before ejecting the CD (modem as storage device of windows driver).  The lsusb output is Bus 002 Device 005: ID 2001:7d01 D-Link Corp after ejecting the CD (as modem).   I don't want to use the driver in the CD,as i need to send sms &amp; find the data usage. What is the difference between implication symbols: $\rightarrow$ and $\Rightarrow$? I do not understand the difference between $\rightarrow$ and $\Rightarrow$. Sometimes I see implication truth tables labeled with the former, sometimes with the latter.  Aren't they synonyms of logical implication or is there any difference? How to Disable new terms (free tagging) with Taxonomies? Zombies - Why do they need to feed on living animals/humans? Solving an Op-amp circuit The image of the circuit is shown below and it required to find \$V_0\$,  My first attempt at solving this problem is by changing the current source into a voltage source with 1-V and 2k\$\Omega\$ resistance. The fact that the inverting and non-inverting terminals aren't grounded make this problem look difficult.To the point which, I don't know how to proceed with this question or where to start. I would appreciate any help. Following some thought and another schematic from a hint suggested by Alfred, I produced a schematic representing our work.  And  my solution for the problem is below, Using node equation at nodes A and B we have, $$\frac{V_A-V_B}{1k}=-0.5 \text{mA}$$ $$\frac{V_B-(2+V_A)}{1k}=-0.5-x$$ where x is the current that is sent in the output of the op-amp. Using KCL, at the bottom node near the current source we see that the same current that goes through the op-amp also goes through the \$2\text{k}\Omega\$ resistor. Hence, we have, $$\frac{-V_A}{2k}=x$$ Replacing this in the second equation, $$\frac{V_B-(2+V_A)}{1k}=-0.5+\frac{V_A}{2k}$$ And and solving the equations yields \$V_A=-2 \text{-V}\$ and \$V_B=-1.5 \text{-V}\$ Surface tension: the paper clip experiment In the paper clip experiment, the surface tension of water prevents the clip from falling, thus we can assume it exerts a force of $mg$ (weight of clip) upwards.   However, if you try to pull the clip out of water, surface tension opposes this motion also. If for simplicity we assume that the clip is a rectangle of length $l$ and breadth $b$, and the surface tension is $T$, then the liquid exerts a downward force of: $$T×2(l+b)$$  What is going on here? Why is there an inconsistency in the direction along which the force acts? Didn't Harry have any other family he could have searched for? I never want my PNGs to be interlaced. So I wish I could set a bunch of option defaults in the application so that I am saving time when outputting a lot of images as PNG over the course of a day working in Photoshop.  Does anyone know if this is possible in Photoshop without using Actions OR the Save-for-Web option? How does Cantor's diagonal argument work? I'm having trouble understanding Cantor's diagonal argument.  Specifically, I do not understand how it proves that something is "uncountable".  My understanding of the argument is that it takes the following form (modified slightly from the  article, assuming base 2, where the numbers must be from the set $ \lbrace 0,1 \rbrace $):  \begin{align} s_1 &amp;= (\mathbf{0},1,0,\dots)\\ s_2 &amp;= (1,\mathbf{1},0,\dots)\\ s_3 &amp;= (0,0,\mathbf{1},\dots)\\ \vdots &amp;= (s_n \text{ continues}) \end{align}  In this case, the diagonal number is the bold diagonal numbers $(0, 1, 1)$, which when "flipped" is $(1,0,0)$, neither of which is $s_1$, $s_2$, or $s_3$.  My question, or misunderstanding, is: When there exists the possibility that more $s_n$ exist, as is the case in the example above, how does this "prove" anything?  For example:  \begin{align} s_0 &amp;= (1,0,0,\mathbf{0},\dots)\ \ \textrm{ (...the wikipedia flipped diagonal)}\\ s_1 &amp;= (\mathbf{0},1,0,\dots)\\ s_2 &amp;= (1,\mathbf{1},0,\dots)\\ s_3 &amp;= (0,0,\mathbf{1},\dots)\\ s_4 &amp;= (0,1,1,\mathbf{1},\dots)\\ s_4 &amp;= (1,0,0,\mathbf{1},\dots)\ \ \textrm{ (...alternate, flipped } s_4\textrm{)}\\ s_5 &amp;= (1,0,0,0,\dots)\\ s_6 &amp;= (1,0,0,1,\dots)\\ \vdots &amp;= (s_n \text{ continues}) \end{align}  In other words, as long as there is a $\dots \text{ continues}$ at the end, the very next number could be the "impossible diagonal number", with the caveat that it's not strictly identical to the "impossible diagonal number" as the wikipedia article defines it:     For each $m$ and $n$ let $s_{n,m}$ be the $m^{th}$ element of the $n^{th}$ sequence on the list; so for each $n$,      $$s_n = (s_{n,1}, s_{n,2}, s_{n,3}, s_{n,4}, \dots).$$      ...snip...      Otherwise, it would be possible by the above process to construct a sequence $s_0$ which would both be in $T$ (because it is a sequence of 0s and 1s which is by the definition of $T$ in $T$) and at the same time not in $T$ (because we can deliberately construct it not to be in the list). $T$, containing all such sequences, must contain $s_0$, which is just such a sequence. But since $s_0$ does not appear anywhere on the list, $T$ cannot contain $s_0$.      Therefore $T$ cannot be placed in one-to-one correspondence with the natural numbers. In other words, it is uncountable.   I'm not sure this definition is correct, because if we assume that $m = (1, \dots)$, then this definition says that "$s_n$ is equal to itself"&mdadsh;there is no "diagonalization" in this particular description of the argument, nor does it incorporate the "flipping" part of the argument, never mind the fact that we have very clearly constructed just such an impossible $T$ list above.  An attempt to correct the "diagonalization" and "flipping" problem:  $$s_n = (\lnot s_{m,m}, \lnot s_{m,m}, \dots) \quad \text{where $m$ is the element index and} \quad\begin{equation}\lnot s_{m,m} = \begin{cases}0 &amp; \mathrm{if\ } s_{m,m} = 1\\1 &amp; \mathrm{if\ } s_{m,m} = 0\end{cases}\end{equation}$$  This definition doesn't quite work either, as we immediately run in to problems with just $s_1 = (0),$ which is impossible because by definition $s_1$ must be $ = (1)$ if $s_1 = (0)$, which would also be impossible because...   Or more generally, with the revised definition there is a contradiction whenever $n = m$, which would seem to invalidate the revised formulation of the argument / proof.  Nothing about this argument / proof makes any sense to me, nor why it only applies to real numbers and makes them "uncountable". As near as I can tell it would seem to apply equal well to natural numbers, which are "countable".  What am I missing? Equality in an integral estimate Let $u,v\in W^{1,p}(\Omega)$ with $1&lt;p&lt;\infty$ and $\Omega$ be a bounded smooth domain in $\mathbb{R}^N$. Suppose, we have $$\int_{\Omega}|\nabla u|^{p-2}\nabla u\nabla v\,dx=\left(\int_{\Omega}|\nabla u|^p\,dx\right)^\frac{p-1}{p}\left(\int_{\Omega}|\nabla v|^p\,dx\right)^\frac{1}{p} $$ Suppose the equality $$ \int_{\Omega}|\nabla u|^p\,dx=\int_{\Omega}|\nabla v|^p\,dx $$ holds. Then can we say that $u=v$ in $\Omega$? I tried in the following way: Since the first given equality, which is the equality in Holder's inequality holds, and by the second given equality holds, we have $|\nabla u|=|\nabla v|$ in $\Omega$. Then I am unable to proceed. Can someone please help to give an argument? What's a way to implement a flexible buff/debuff system? Overview:  Lots of games with RPG-like statistics allow for character "buffs", ranging from simple "Deal 25% extra damage" to more complicated things like "Deal 15 damage back to attackers when hit."  The specifics of each type of buff aren't really relevant.  I'm looking for a (presumably object-oriented) way to handle arbitrary buffs.  Details:  In my particular case, I have multiple characters in a turn-based battle environment, so I envisioned buffs being tied to events like "OnTurnStart", "OnReceiveDamage", etc.  Perhaps each buff is a subclass of a main Buff abstract class, where only the relevant events are overloaded.  Then each character could have a vector of buffs currently applied.  Does this solution make sense?  I can certainly see dozens of event types being necessary, it feels like making a new subclass for each buff is overkill, and it doesn't seem to allow for any buff "interactions".  That is, if I wanted to implement a cap on damage boosts so that even if you had 10 different buffs which all give 25% extra damage, you only do 100% extra instead of 250% extra.  And there's more complicated situations that ideally I could control.  I'm sure everyone can come up with examples of how more sophisticated buffs can potentially interact with each other in a way that as a game developer I may not want.  As a relatively inexperienced C++ programmer (I generally have used C in embedded systems), I feel like my solution is simplistic and probably doesn't take full advantage of the object-oriented language.  Thoughts?  Has anyone here designed a fairly robust buff system before?  Edit: Regarding Answer(s):  I selected an answer primarily based on good detail and a solid answer to the question I asked, but reading the responses gave me some more insight.  Perhaps unsurprisingly, the different systems or tweaked systems seem to apply better to certain situations.  What system works best for my game will depend on the types, variance, and number of buffs I intend to be able to apply.  For a game like Diablo 3 (mentioned below), where nearly any bit of equipment can change a buff's strength, the buffs are just character stats system seems like a good idea whenever possible.  For the turn-based situation I'm in, the event-based approach may be more suitable.  In any case, I'm still hoping someone comes along with a fancy "OO" magic bullet which will allow for me to apply a +2 move distance per turn buff, a deal 50% of damage taken back to the attacker buff, and a automatically teleport to a nearby tile when attacked from 3 or more tiles away buff in a single system without turning a +5 strength buff into its own subclass.  I think the closest thing is the answer I marked, but the floor is still open.  Thanks to everyone for the input. Is the "live" in "He only lived a few days after the accident" intrasitive or transitive? An example sentence from the :  [I] He only lived a few days after the accident.  [I] means &quot;intransitive verb&quot;. He (subject) + lived (verb) + a few days (noun). What part of speech is a few days? From the :  number 5  way of life[intransitive always + adverb/preposition, transitive] to have a particular type of life, or live in a particular way   used 'transitive verb' like 'She lives a very busy life.' From the ELU question :  She is 16 year old.  '16 years' as acting as an adverb. My questions are:  In &quot;He lived a few days.&quot;, is a few days an object (noun) or an adverb? How is it different from &quot;He lived for a few days.&quot;? &quot;I walked ten miles.&quot; Number + measurement — how can I deal with 'part of speech'? Get next / previous element using JavaScript? So basically, I'd like to use iwconfig to connect to my wifi network when I'm not inside X. But I just don't see a way to do it in the man page. Any idea? How to run find -exec?