How to write a ContainsAll query using LINQ? (C# LINQ-TO-SQL)
Determine if a sequence contains all elements of another sequence using Linq
The  says that there is a moderator election occurring.   How does the election work and how can I get involved? I have two users, user1 and user2, that are both members of groupA. user2 has a folder in their home directory called folderA. If they wish to allow read-write-execute permissions for all members of groupA, how would they do this?  What if folderA contains many files and additional folders that also need to have read-write-execute permission?  Information regarding groups is a little 'spotty' across the web, so I am putting my question here in the hope someone posts a clear answer that might help others out too.  Thanks! Is there a name for when the same word is used at the beginning and end of different phrases/sentences? Is there a name for when one phrase ends with a word that starts the next phrase. For instance:     life is a peach and cream   Or     sunscreen in the eye for detail   Or (from Dave Eggers' Heartbreaking Work of Staggering Genius)     JFKFC Deleting (Erasing) all Data from Failed SanDisk MicroSD Card I've had two 32GB SanDisk MicroSD cards go bad recently.  One I was able to temporarily revive using the kind advice offered in this thread:   When I insert the other into a reader, it registers as 30.6MB (that's MB, not GB).  I've tried all sorts of software and other techniques to revive this card and retrieve the important data off of it (including FindAndMount and TestDisk).  Nothing has worked.  So I'm thinking of returning the card for a refund.  But first, I would like to make it unreadable by someone more skilled than myself.  Is there any way to do this, given that I cannot even format the card or get it to be recognized as more than 30.6MB?  I am looking for a method that does not entail the kind of obvious physical destruction that would jeopardize obtaining a refund from the retailer.  If Costco (where the card was purchased) accepts physically destroyed cards for return, then physical destruction is acceptable (but please have knowledge that they do).  Given two failures, I don't really want to send the card to SanDisk for replacement, because I no longer trust the reliability of their products. Almost sure convergence of the Poisson process Let $N = \{N(t) \}_{t\geq 0 }$ be a Poisson process. I already know that $N(t)- \lambda t$ is a martingale where $\mathbb{E} [ N(t) ] = \lambda t$.   I want to prove that $$ \frac{N(t)}{t} \rightarrow \lambda, \quad t \rightarrow \infty \quad \text{ a.s.}. $$  To prove this I received a hint that I should use the martingale law of large numbers which states that:  Theorem: (Martingale LLN)  Let $S= (S_n = \sum_{k=1}^n X_k)_{n=1,2,\ldots}$ be a martingale with respect to the filtration $(\mathcal{F}_n)_{n=1,2,\ldots}$. Then $\sum_{k=1}^n X_k/k$ converges almost surely on the set $\left\{ \sum_{k=1}^\infty k^{-2} \mathbb{E}\left[ X_k^2 \mid \mathcal{F}_{k-1} \right] &lt; \infty \right\}$. Hence $S_n/n \rightarrow 0$ a.s. on the same set.  Now to use this theorem I think I need to use Doob-Meyer to decompose $N(t)$ as the sum of a martingale and an increasing process. Which would be the martingale $M(t) = N(t) - \lambda t$ and increasing process $A(t) = \lambda t$. But how is $M(t)$ the sum of a martingale? And I do not know how this exactly relates to the thing I have to prove. Thanks for any help. Show that the dual space of the vector space of all polynomials is isomorphic to the infinite-dimensional Euclidean vector space over the reals May I please ask how to show the dual space of the vector space of all polynomials is isomorphic to the infinite-dimensional Euclidean vector space over the reals?  (i.e. Show that $(\Bbb{R}[X])^*$ and $\Bbb{R}^{∞}$ are isomorphic where $\Bbb{R}$ means the set of all reals) Enable disk encryption after installation Is $\mathbb{Z}[\sqrt{-7}]$ a UFD or not? Is $\mathbb{Z}[\sqrt{-7}]$ a UFD or not? I feel like there should be some easy example showing that it is not, but I can not think of one. So I was thinking... If heat I feel is just lots of particles going wild and transferring their energy to other bodies, why am I not burned by the wind?  When I thought about it more I figured out that wind usually carries some humidity, and since particles of liquid are moving same speed as the wind, they are basically static relative to each other, so no energy is transferred between them (wind and water particles). And if that water sticks to my skin and wind blows, it'll evaporate thus taking energy from my skin and make me feel cold.  Thing is, I don't think that's really the case but even if it is, if I somehow dry out the wind, will it burn me if it's strong enough? And winds can reach some pretty high velocities (though I must admit I'm not sure if they are comparable to movement of atoms in warm bodies etc...).  So. Bottom line. Can I be burned by wind in some perfect scenario? Who provides the Internet service to Internet Service Providers (ISPs)? I've been wondering recently about how the infrastructure of the Internet really works.    I know that I have an Internet Service Provider (ISP) that supplies my connection to the Internet.   But what I don't know is: Who provides the Internet to the ISP?  And who supplies it to them? Is there a never-ending loop that eventually connects us all together? I have an input type="image". This acts like the cell notes in Microsoft Excel. If someone enters a number into the text box that this input-image is paired with, I setup an event handler for the input-image. Then when the user clicks the image, they get a little popup to add some notes to the data.  My problem is that when a user enters a zero into the text box, I need to disable the input-image's event handler. I have tried the following, but to no avail.  $('#myimage').click(function { return false; }); How to find event listeners on a DOM node when debugging or from the JavaScript code? Are there any versions of t-SNE for streaming data? I have a table with a varchar(max) column that stores text ~4-10KB in size. Data is just being added - never modified, it is a log. My problem is that a table grows too large in size - I would like to keep about 1000000 rows in this table.   I am limited to SQL Server Express and hit the limit on database size. Compression is not available in SQL Server Express and I afraid that Filestream may not be appropriate and the number of files would be too big.   What is the best solution in this case? "R cannot be resolved to a variable"? If I enter my password correct first time, I login as normal.  If I enter my password wrong, it says invalid password. If I attempt to enter the correct password now then the screen freezes and doesn't go to dock as normal. I must restart using a physical button or shutdown to get out. Login works normally after restart, assuming I get it right first time.  EDIT:  After entering a wrong password, if I click cancel and then go back to my user to login, it works fine. Why can current only flow in loops? In the following image:   Why can't current flow across the following wire? It's a simple question, but I've kind off always wondered.  Thanks! I am trying to prove this binomial identity $\sum_{r=0}^n {r {n \choose r}} = n2^{n-1}$ but am not able to think something except induction,which is of-course not necessary (I think) here, so I am inquisitive to prove this in a more general way.  The left side of an identity occurs while solving another problem (concerning binomial theorem) so I am more interested in deriving the right side from the left side, else I have to remember it now onward.  EDIT: I am more interested in an algebraic proof rather than combinatorial argument or something involving calculus (however I liked  and  solution), hence I am removing the combinatorics tag. Stack Overflow is a site of passers-by They says that Stack Overflow is a community-driven web-site. But, as a matter of fact, it is not.  There is no community at all. It's more like an imageboard, as a number of participants makes them pretty much like anonymous to each other despite of registration.   Stack Overflow is a site of passers-by.  Passers-by who want to solve their silly typo problem and passers-by who eager to share their vast knowledge in spotting silly typos. And - oh - sometimes to perform a civic duty and vote to close a question they have no idea what to answer to and thus calling it "not a real question".  So, as a funny consequence, whatever question can get   answered upvoted downvoted closed deleted   depends not on its quality but only on the fluctuation happened to "community" at the given moment, at a pretty random rate.  It is not only quite discouraging. It makes the very idea of collecting and improving knowledge quite impossible. Is there any formula for number of divisors of $a \times b$? Let $a$ and $b$ be two numbers,    Number of divisors of $a$ is $n_1$; Number of divisors of $b$ is $n_2$;    How to find the number of divisors $N$ of product $a \times b$ by using known number of divisors of factors $n_1$ and $n_2$?  If $a = 20$ and $b = 21$, then $n_1 = 6$ (number of divisors of $a$), $n_2 = 4$ (number of divisors of $b$. Then $a \times b = 420$ and $N = 32$ (number of divisors of $a \times b$).  Is there a formula to find $N$ in terms of $n_1$ and $n_2$?