83b election - did not submit tax return for the taxable year of the election
I file 83(b) election, but did't include a copy of it in that year’s tax return
Why NuGet adds app.config with assemblyBinding to LIBRARY projects during a NuGet package update? I gave a scammer my telephone number, address, and name. How bad is it? How do I make Bash my default shell on Ubuntu? How to toggle or turn off text selection being sent to the clipboard I would like to disable the default behavior that seems to happen with every Linux distribution that I've ever tried that any selected text is immediately sent to the clipboard (Mint, Ubuntu, Fedora, SuSE, etc.) and every window manager (Gnome, KDE, Cinnamon), and instead to behave more like the Windows implementation.    I know that this is a beloved behavior by many in Linux, and I'm sure many will think I'm an idiot.  The reason I want to do this, is that I'm a keyboard junky when navigating a GUI.  (e.g.  when I'm in Linux and I copy a URL and then switch to my browser and type Ctrl+L, it selects the address bar and moves my intended paste down one notch and replaces it with what I'm trying to overwrite.)  I know there are MANY workarounds, but I don't really care about that, what I'd prefer is to be able to toggle the behavior for the clipboard. Variables losing their values Countable additivity implies countable subadditivity? Suppose $\mu$ is a measure in a ring $R$ of a set $X$. So for any mutually disjoint subsets $A_1,A_2,\ldots$ such that $\sum_{i=1}^\infty A_i\in R$, we have that $\mu(\sum_{i=1}^\infty A_i) = \mu(A_1)+\mu(A_2)+\cdots$. (i.e. countable additivity)  I'm wondering: Does that imply countable subadditivity? I.e. for any subsets $A_1,A_2,\ldots$ such that $\sum_{i=1}^\infty A_i\in R$, is it always true that $\mu(\sum_{i=1}^\infty A_i)\le \mu(A_1)+\mu(A_2)+\cdots$?  I believe it should be true, because you can take the mutually disjoint subsets $A_1,A_2-A_1,A_3-(A_1\cup A_2),A_4-(A_1\cup A_2\cup A_3),\cdots$, each of which is in $R$ (because unions and differences of sets in $R$ are again in $R$), then apply countable additivity, then use monotonicity on the fact that $A_n-(A_1\cup\cdots\cup A_{n-1})\subseteq A_n$.  Is that right? I just want to make sure I didn't make any mistake in my logic. My usb mouse sleeps after 5 seconds of inactivity when running on battery power. It wakes uo again when i press any button on the mouse. This is really annoying.  I have made lsusb, and I noticed my mouse is   Bus 001 Device 012: ID 04d9:2083 Holtek Semiconductor, Inc.  I have checked my /sys/bus/usb/devices/usb1/power/autosuspend but it is already set to 0, and the directory usb1 has many subdirectories which also have autosuspend files, and i dont know how to edit them.  Also, I would like a permanent solution, which would work for any mouse, on any of my 3 usb ports. Any ideas?  Using: Ubuntu 12.04 64bit I’m writing a series of blog posts and I’m finding a little bit of a conundrum. I want the audience that can be manufactured on Medium but I also want the SEO that comes from long form text on my website.  Is there any type of SEO conflict that would arise from putting the exact same posts on both? I have a problem. I am going to make a minecraft animation in blender. But when I put a minecraft texture on a 3d cube that is 16x16x16 it is very low resolution is there a way to get the texture in a better resolution or is there a way to make blender make the texture better?  I hope you have an answer. Thanks in advance Calculating $\lim_{x\to0} \left\lfloor\frac{x^2}{\sin x \tan x}\right\rfloor$ Find $$\lim_{x\to0}  \left\lfloor\frac{x^2}{\sin x \tan x}\right\rfloor$$ where $\lfloor\cdot\rfloor$ is greatest integer function   I am a high school teacher. One of my students came up to ask this limit.  For $\lfloor\frac{\sin x}{x}\rfloor$, I have used $\sin x &gt; x$ using increasing decreasing functions.  I tried to prove $x^2 &gt; \sin x \tan x$ using increasing /decreasing  function but I am not getting it. Short story, domed refuges Game Theory and Uniform Distribution question? In an Auction , two players are  bidding. Their bids will be a unknown fraction of their valuations. The valuations come from a uniform distribution $$[0,1] $$  If Player 2 bids $$ v/2 $$  and Player 1 bids $$b1&lt;1/2$$   What is the probability player 1 wins ? Clearly for player 1 to win,players 2 bid has to be less than player 1 bids. $$P(v/2 &lt; b1)$$  $$P(v &lt; 2b1)$$ I follow the question up to this stage. Now it says since its uniformly distributed the probability player 1 wins is $$2b1$$ Im confused how can you just get 2b1 from the inequality ?  Thanks in advance The Problem  Currently if I flag a post, I cannot check the status of the flag unless I have prior helpful flags. This means, for example, that a new user who wants to check the status of his first flag cannot do so while it is pending (active).  This feature request is based on my experience on MSO, where I wanted to check the status of my flag but could not get to the summary page without cheating (tweaking my SO link to work with MSO). It also stems from this question, where the OP indicates he had the same issue:   My Proposal  If I have flagged any post, then show me a "flags" link (red arrow in image below). If I have any helpful flags, then the number of helpful flags should be displayed (blue arrow). If I have not flagged anything, then neither should be displayed (as with current site functionality). Proof of Young's inequality The following problem is from Spivak's Calculus.  Suppose that $f$ is a continuous increasing function with $f(0)=0$. Prove that for $a,b \gt 0$ we have Young's inequality   $$ ab \le \int_0^af(x)dx+\int_0^bf^{-1}(x)dx$$, and that equality holds if and only if $b=f(a)$.  It is enough to consider the case $f(a) \gt b$, and show that the strict inequality occurs in this case.  I've tried proving this using the theorem  $$ \int_a^bf^{-1}=bf^{-1}(b)-af^{-1}(a)-\int_{f^{-1}(a)}^{f^{-1}(b)}f$$  but I got stuck along the way.   How may I show this rigorously using the definition or properties of integrals? Any hint, suggestions or solutions would be appreciated. URL Rewriting of a query string in php I'm using wordpress multiste 3.3.1 I'm not gonna update it in the future. So I disabled all upgrade functions.  I want to remove the wordpress admin bar from both frontend as well as dashboard.  I can remove it from frontend using this code.  add_action( 'init', 'disable_admin_bar', 1 ); function disable_admin_bar() {     add_filter( 'show_admin_bar', '__return_false' ); }   But i couldn't find any solution to remove it from dashboard.   I don't want to use css solution to hide admin bar and I'm ready to edit the core files to remove it  Can anyone help me to remove it completely?. Thanks How to troubleshoot unwanted white spaces smartly? BibTeX handling of the Dutch "van" name prefix with natbib I want to produce the following with LaTeX/BibTeX:  In the running text:     ... we refer the reader to the work of Van Noort (2010).   In the bibliography:     Thomas van Noort. An important paper. 2010.   I have tried many tricks, but I don't seem to able to fulfill all the requirements:   "Thomas van Noort" has to appear sorted in the bibliography by the name "Noort". In the running text, the "Van" needs to have an uppercase 'V' In the bibliography, the "van" needs to have a lowercase 'v' I am using hyperref, and I want the whole "Van Noort (2010)" text to link to the reference.   Using plain \citet will generate:     ... we refer the reader to the work of van Noort (2010).   Note the lowercase 'v'; this is not acceptable, as per standard treatment of Dutch names. Setting the BibTeX name to Van Noort, Thomas makes the running text citation look ok, but then in the bibliography I get     Thomas Van Noort. An important paper. 2010.   Note the uppercase 'V'; this is also not acceptable, as it should only be uppercase if it is not preceded by the first name.  (1) is easy: I set the BibTeX author field to {\noopsort{Noort}}{van Noort}, Thomas. (2) and (3) I can fake by saying something like we refer the reader to the work of Van Noort \citeyear{...}, but this is not nice, and does not fulfill (4).  Anyone has any suggestions? I was under the impression that LaTeX and BibTeX were designed with these kind of things in mind, so maybe I'm missing something... Why rationalize the denominator? In grade school we learn to rationalize denominators of fractions when possible. We are taught that $\frac{\sqrt{2}}{2}$ is simpler than $\frac{1}{\sqrt{2}}$.  says that "there is a bias against roots in the denominator of a fraction". But such fractions are well-defined and I'm failing to see anything wrong with $\frac{1}{\sqrt{2}}$ - in fact, IMO it is simpler than $\frac{\sqrt{2}}{2}$ because 1 is simpler than 2 (or similarly, because the former can trivially be rewritten without a fraction).  So why does this bias against roots in the denominator exist and what is its justification? The only reason I can think of is that the bias is a relic of a time before the reals were understood well enough for mathematicians to be comfortable dividing by irrationals, but I have been unable to find a source to corroborate or contradict this guess. Matrices: system that is "computationally singular" versus "exactly singular" I would like to know the mathematical concepts behind singular matrices. Matrices that do not have inverses in R throw one of two errors. I have provided some examples of both errors below:    Error in solve.default(W) :  system is computationally singular: reciprocal condition number = 1.58603e-17   Error in solve.default(Z) :  Lapack routine dgesv: system is exactly singular: U[2,2] = 0    Can anyone explain the difference between the two? Why is the first "nearly singular" whereas the second is "exactly singular"?