The higgs particle or field is what gives mass to everything. It's said that nothing can escape a black hole. If that is true how can the black hole "tell" its mass as even the higgs would not be able to escape? If higgs particles are able to escape, will eventually all matter be converted to higgs particles -- it's the only way out of the black hole?
I like to know when a dying star collapsed into a black hole, is there anything inside or on the event horizon that is interacting with higgs field?
How to do vlookup and fill down (like in Excel) in R? Is it true that every pair of twin primes >3 is of the form 6n plus or minus 1? Is it possible to have twin primes whose center is not divisible by 6? Review Audit failed when "late answer" answer is a duplicate I just got a review audit where the "late answer" was a duplicate of the accepted answer, but flagging it on that basis failed the review. That seems like a bug to me.  Question here:   I found that by clicking the question to view the entire Q&amp;A, and noticed that the copy was from a generic "user12345" account (probably with 1 rep as well) and the original from a real-looking account. Viewing the whole Q&amp;A is often useful when reviewing, especially late answers (which are often repeats of earlier points, disagreements with those, or random addendums better submitted as edits). I looked at the duplicate and thought "weird, rep harvesting maybe?" so I clicked "needs moderator attention" and wrote "copy and paste of accepted answer". FAIL!  I think that this review type can't ever work, because to avoid the problem I found you'd need to make up whole new "late answers" which by definition the review bot can't know anything useful about. Either that or to pass you'd just need to take any action at all, including upvoting the original of the duplicated answer. Which I didn't do, BTW, because I had no idea or opinion about the question or answer.  (this is not a duplicate of "What are review tests", it predates that and focuses on a particular defect within the process. See the comments below). Positive integer multiples of an irrational mod 1 are dense I'm not sure how to solve this one. Thank you!  $2.$ For any $\alpha\in \mathbb R$ we define $$\lfloor \alpha \rfloor = \max_{n\in\mathbb Z}\{\,n\mid n\leq \alpha\,\}$$ and $$\alpha\bmod 1 = \alpha - \lfloor \alpha \rfloor$$ Let $\alpha$ be irrational. (a) Given $n\in\mathbb N$ show that $\{\,k\alpha\bmod1\mid k\in\mathbb N\,\}\cap\left[0,\frac{1}{n}\right]\neq\emptyset$ (b) Prove that $\{\,n\alpha\bmod 1\mid n\in\mathbb N\,\}$ is dense in $[0,1]$. Does magic jack work on Ubuntu? Does magic jack work with Ubuntu? I originally had my magic jack on a computer with windows XP and I decided to switch to Ubuntu but I still want Magic jack. In PHP, how do you change the key of an array element? Sum of the series:$\frac{1}{1\cdot 2}+\frac{1\cdot3}{1\cdot2\cdot3\cdot4}+\cdots$ I have a question where i couldn't find any clue. The question is  $$\frac{1}{1\cdot 2}+\frac{1\cdot3}{1\cdot2\cdot3\cdot4}+\frac{1\cdot3\cdot5}{1\cdot2\cdot3\cdot4\cdot5\cdot6}+\cdots$$  I could get the general term as $t_n=\frac{1\cdot3\cdot5\cdot7\cdots(2n-1)}{1\cdot2\cdot3\cdot4\cdot5\cdot6\cdots2n}$  I have also tried it to form the sequence in the telescopic form.But couldn't get. Any hint will be appreciated. How do I prevent a line from appearing by itself:  Orphan: at the bottom of the page, or Widow: at the top of the page? Calling future method from batch class? Factorial of 0 - a convenience? If I am correct in stating that a factorial of a number ( of entities ) is the number of ways in which those entities can be arranged, then my question is as simple as asking - how do you conceive the idea of arranging nothing ?   Its easy to conceive of a null element in the context of arrays, for example - so you say that there is only one way to present a null element.   But, in layman terms - if there are three humans $h1, h2, h3$ that need to be arranged to sit on three chairs $c1, c2, c3$ - then how do you conceive of a) a null human, and b) to arrange those ( that ? ) null humans ( human ? ) on the three chairs ?   Please note that referral to humans is just for easy explanation - not trying to be pseudo-philosophical. Three balls to be arranged on three corners of a triangle works just fine. So basically, how do you conceive of an object that doesn't exist, and then conceive of arranging that object ?  So, in essence ... is $0! = 1$, a convenience for mathematicians ? Not that its the only convenience, but just asking. Of course, there are many.  If yes, then its a pity that I can't find it stated like so anywhere.  If not, then can anybody suggest resources to read actual, good proofs ? I have a HP Pavilion dm4-2070us which has an Intel Corporation Centrino Wireless-N 1000 adapter.   The problem is that my computer doesn't show the wireless networks after I upgraded my system to Ubuntu 11.10. Following is my output for sudo lshw -class network:  *-network DISABLED          description: Wireless interface    product: Centrino Wireless-N 1000    vendor: Intel Corporation    physical id: 0    bus info: pci@0000:01:00.0    logical name: wlan0    version: 00    serial: 8c:a9:82:81:5a:30    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress bus_master cap_list ethernet physical wireless    configuration: broadcast=yes driver=iwlagn driverversion=3.0.0-12-generic firmware=39.31.5.1 build 35138 latency=0 link=no multicast=yes wireless=IEEE 802.11bgn    resources: irq:42 memory:c2500000-c2501fff  *-network    description: Ethernet interface    product: AR8151 v2.0 Gigabit Ethernet    vendor: Atheros Communications    physical id: 0    bus info: pci@0000:08:00.0    logical name: eth0    version: c0    serial: 2c:41:38:07:f3:e3    size: 100Mbit/s    capacity: 1Gbit/s    width: 64 bits    clock: 33MHz    capabilities: pm msi pciexpress vpd bus_master cap_list ethernet physical tp 10bt 10bt-fd 100bt 100bt-fd 1000bt-fd autonegotiation    configuration: autonegotiation=on broadcast=yes driver=atl1c driverversion=1.0.1.0-NAPI duplex=full firmware=N/A ip=192.168.1.7 latency=0 link=yes multicast=yes port=twisted pair speed=100Mbit/s    resources: irq:44 memory:c1400000-c143ffff ioport:2000(size=128)   The output for rfkill list all:  0: hp-wifi: Wireless LAN     Soft blocked: no     Hard blocked: no 1: hp-bluetooth: Bluetooth     Soft blocked: no     Hard blocked: no 2: phy0: Wireless LAN     Soft blocked: no     Hard blocked: no 3: hp-wwan: Wireless WAN     Soft blocked: no     Hard blocked: no   I have also searched about the status of the WiFi network being shown as disabled. Somehow everything pointed to the fact that my wireless device is switched off and it can be switched on from Windows only. However, I don't have windows partition and it has just Ubuntu 11.10 so I don't see any point in switching the device on in Windows. How to instantiate polymer component programmatically in dartlang? I already have an Apple ID, made at Apple.com. Now, when I want to access the App Store from my iPad, I am told that I have to review my information. On the credit card page, I am not presented with a "None" option, even though I am in the United States.   What can I do to proceed without entering this information? Fetch the row which has the Max value for a column Table:   UserId, Value, Date.   I want to get the UserId, Value for the max(Date) for each UserId. That is, the Value for each UserId that has the latest date. Is there a way to do this simply in SQL? (Preferably Oracle)  Update: Apologies for any ambiguity: I need to get ALL the UserIds. But for each UserId, only that row where that user has the latest date. Recently when skimming through my physics-text I encountered an interesting definition of Force $$F(x) = -\frac{\mathrm dU(x)}{\mathrm dx}$$  We were taught that some functions are continuous but not differentiable. So for the force to exist $U(x)$ has to be differentiable. So how can we prove that $U(x)$ is differentiable everywhere? Proper way to exit iPhone application? I am programming an iPhone app, and I need to force it to exit due to certain user actions.  After cleaning up memory the app allocated, what's the appropriate method to call to terminate the application? Why is negative times negative = positive? Someone recently asked me why a negative $\times$ a negative is positive, and why a negative $\times$ a positive is negative, etc.  I went ahead and gave them a proof by contradiction like so:  Assume $(-x) \cdot (-y) = -xy$  Then divide both sides by $(-x)$ and you get $(-y) = y$  Since we have a contradiction, then our first assumption must be incorrect.  I'm guessing I did something wrong here. Since the conclusion of $(-x) \cdot (-y) = (xy)$ is hard to derive from what I wrote.  Is there a better way to explain this?  Is my proof incorrect?  Also, what would be an intuitive way to explain the negation concept, if there is one? Does GCM (or GHASH) only provide 64-bit security against forgeries? In a  a doubt was voiced about my answer, which claims GCM to requires $2^{128}$ for a successful forgery. The doubt was that the square root needs to be taken meaning the security would be $2^{64}$.  So of course I immediately checked the relevant security theorem ():  $$\mathbf{Adv}^{\text{auth}}_{\operatorname{GCM}[\operatorname{Perm}(n),\tau]}(\mathcal A)\leq \frac{0.5(\sigma+q+q'+1)^2}{2^n}+\frac{q'(\ell_A+1)}{2^\tau}$$  with $\sigma$ being the total plaintext size in blocks, $q$ being the total number of encryption queries, $q'$ being the total number of decryption queries, $n$ being the size in bits of the underlying permutation, $\ell_A$ being maximum authenticated input length in blocks and $\tau$ being the tag size in bits.  Now clearly from this we can see that performing $2^{n/2}=2^{64}$ queries yields a strong enough advantage for a break.  Now my question is: When talking about "n-bits of security" or "needs $2^n$ operations to break", do we usually talk about "online" security, ie queries to an oracle can be done and cost $1$ or "offline" security where no oracles are available or do we need to make this decision depending on the situation?  TL;DR: Does GCM offer 64 or 128 bit security? How can I format to show text inside ""? I've posted a lot to StackOverflow, and I've noticed something kind of irritating with the formatting in writing questions and comments. If I need to put something inside a &lt; and a >, without spaces in the middle (like right there), it will think it's code and not show up, like this   (obviously it won't come up what I wrote there, or else this wouldn't be an issue, but if you open up the question to edit you can see what's written there.)  If I want it to show up, right now I have to add an extra set of brackets inside of the originals with a junk variable, like right &lt;here> (again, open in edit window to see).  This is really annoying when trying to show variables like lists that require those brackets, and I feel like the junk variables could confuse people looking at the edits. Is there a way to get around this formatting? Thanks! Why is it that Android still can't be installed as regular OS? Are there any technical or others reasons why Android is still a firmware and not an OS which can be just installed without a lot of hassle?  Why there is no universal image which could detect appropriate drivers (kernel modules), partition NAND in some standard way and configure boot loader to boot updated OS version?  What stops Google from making a real (less firmware-like) OS (an OS for small ARM, x86 etc. devices)?