LNK1117: Syntax error in option "VERSION:1.0.0"
DEF file syntax error in visual studio 2012
We have a situation: someone saw the boy break the window. Can I make this passive sentence?     The boy was seen to break the window.   I use Murphy's Grammar and this structure is never discussed. Do mindless creatures get feats? Do creatures that have no Intelligence Score ("Int —" in the stat block) gain Feats? I'm creating some monsters but I failed to find the answer for this question. Can I use my laptop as a second monitor? Is it possible to make my laptop's screen act as a second monitor for my desktop computer? Fix Accessibility of the sites on the leagues (and other pull downs that share the same code path) please The  site picker seems to be ordered on-site statistics instead of alphabetically:  This makes it very hard to find Photography, Physics, and Philosophy (for example) since they are nowhere near each other in the list. I’m open to a better solution, but as it stands, this feels a little too user-hostile to assume everyone is only interested in the first 3 to 5 top visible hits in the ordered list.  Scanning pages of unorganized contents is not optimal Keyboard input should filter and not just jump around  It also breaks accessibility when someone wishes to access the list from a keyboard (or a slower input control) as opposed to a mouse and visually. Fundamental group of the torus I'm trying to get my head round the following calculation of the fundamental group of the torus, using Seifert Van-Kampen (I know it's easier to do this by considering covering spaces, but I'm trying to learn the Seifert Van-Kampen method).   Consider the torus $T$ as the unit square in $\mathbb R^2$ with opposite edges identified. Let $A$ be an open disc (say of radius $1/4$ about the origin), and $\overline{A}$ be it's closure. Let $B$ be complement of $A$, so that $A \cap B = S^1$. Then we have $T = A \cup B$ where $A$ and $B$ are a neighbourhood deformation retract pair, so we can use Van Kampen. It is clear that $\pi_1(A) = \{e \}$ and $\pi_1(A \cap B) = \mathbb Z$. So we need to find $\pi_1(B)$. Observe that $B$ deformation retracts onto the boundary of the square which, after identification, is homeomorphic to $S^1 \vee S^1$; in this way we see that $B$ and $S^1 \vee S^1$ are homotopy equivalent (inclusion in one direction, the retraction in another), and so $\pi(S^1 \vee S^1) = F_2$ (which can be calculated by Van Kampen, or by using the theory of covering spaces). So, by Van Kampen, $\pi_1(T) \cong F_2 *_{\mathbb Z} \{e\}$. This is the quotient of $F_2$ by the normal closure of the image of $l_* : \pi_1(A \cap B) \to \pi_1(B)$ (where $l_*$ is the homomorphism induced from the inclusion map $l : A \cap B \hookrightarrow B$). The following is causing me confusion: The generator of $\pi_1(A \cap B)$ is homotopic in $B$ to a loop of the form $u.v.\overline{u}.\overline{v}$, where $u$ and $v$ represent the two generators of $F_2$. So $\pi_1(T) \cong \langle a,b ; aba^{-1}b^{-1} \rangle$, the free abelian group on two generators.  Any explanation or geometric intuition would be really appreciated. Thanks Coupon Collector Problem with Batched Selections How to write special set notation by hand? Something wrong with monthly user rep - some users show quarterly figures? Supremum and infimum of sets I've recently started to study supremum and infimum, and I'm having trouble determining the supremum and infimum of the following sets:  $ A = \left\{ {mn\over 1+ m+n} \mid m, n \in \mathbb N \right\} $ $ B = \left\{ {mn\over 4m^2+m+n^2} \mid m, n \in \mathbb N \right\} $ $ C = \left\{ {m\over \vert m\vert +n} \mid m \in \mathbb Z, n \in \mathbb N \right\} $ $ D = \left\{ {n\over 3} - \left[{n\over 3}\right] \mid m, n \in \mathbb N \right\} $   In $D$, the $[\; ]$ denotes the integral part of ${n\over 3}$.   $E = \{x \mid x \text{ is decimal fraction between } 0 \text{ and } 1 \text{ that has the digits } 0 \text{ and } 1\}$.  In my progress so far I was able to verify that sup $\{x \in A\} = +∞$  Setting $m = (n-1)$ to get  $$ \frac{mn}{1+m+n}= \frac{n(n-1)}{1 + n + n-1} = \frac{n(n-1)}{2n} = \frac{n-1}{2} $$  That way $\frac{n-1}{2}\in A$ for every $n\geq 2$. Thus, the supremum of $A$ is bigger than $\frac{n-1}{2}$ for every integer $n$.  I don't know how to go past this. x_x  Any help would be greatly appreciated! Did something change in the behavior of blocking users' votes if they don't have sufficient rep to vote? I've just noticed that if you try to vote without having a privilege to vote, you're greeted with such message:        So, that's interesting. Does it mean that if I gain 125 (or 15, in case I'm upvoting not having 15 reps) rep on that site, my "suggested" vote goes public and until then it would be recorded as it's done with anon feedback?  And until this change, the votes weren't recorded as anonymous, or has the new message saying that it acts as feedback been added just to not upset users? I created a custom module in drupal 8. And I am trying to add js and css file in  my_module.libraries.yml file using this   lrv_key:   version: 1.x   js:     js/lrv.js: {}        dependencies:       - core/jquery       - core/drupalSettings   css:     theme:       css/lrv.css: {}   But it doesnt work. Need a proofreading why all the units are satisfied $a^2-2b^2 =\pm1$ for $\mathbf{Z}[\sqrt{2}]$ All the units are satisfied Pell's equation $a^2-2b^2=\pm1$  for $\mathbf{Z}[\sqrt{2}]$, $a,b\in\mathbf{Z}$.  Here is my proof:  Let $a+b\sqrt{2}$ be a unit $\in\mathbf{Z}[\sqrt{2}]$. This implies $$(a+b\sqrt{2})(c+d\sqrt{2})=1, c+d\sqrt{2}\in\mathbf{Z}\sqrt{2}$$ $$\implies \mathrm{norm}((a+b\sqrt{2})(c+d\sqrt{2}))=1$$ $$\implies \mathrm{norm}(a+b\sqrt{2})\cdot \mathrm{norm}(c+d\sqrt{2})=1$$ $$\implies (a+b\sqrt{2})(a-b\sqrt{2})(c+d\sqrt{2})(c-d\sqrt{2})=1$$ $$\implies (a^2-2b^2)(c^2-2d^2)=1$$ $$\implies \left[ a^2-2b^2=1\text{ and } {c}^2-2{d}^2=1\right]\text{ or } \left[ a^2-2{b}^2=-1\text{ and }{c}^2-2{d}^2=-1\right]$$ $$\implies {a}^2-2{b}^2=\pm1$$ Proving a vector space is infinite-dimensional Let $S$ be a vector space. Suppose that for any positive integer $n$, there exists a linearly independent subset $S_n ⊆ V$ of size $n$.   How do you show that $S$ is not finite dimensional but infinite-dimensional.  I understand that to be finite dimensional then it must have a finite then  there exists a finite set that such at $\operatorname{Span}(T)=S$. So would it be right to prove by contradiction that there is not a finite spanning set that satisfies $\operatorname{Span}(T)=S$, and hence I could argue that the vector space $S$ is infinite dimensional.  How would I show that $S$ does not have a spanning set $T$, such that $\operatorname{Span}(T)=S$? I need to make a converter to go from RS422 full duplex to my Arduino. I have found lots of different chips which I think can do this, but am slightly confused by the terminology. The RS422 device is a laser distance sensor ().  It has RX+, RX-, TX+, TX-. So I have two lines for input and two lines for output.  I could use two RS485 line drivers to achieve the full duplex comms which I need.  There are a lot of chips to do that.  But then on my Arduino (clone: chipkit max32) would I need to use two UART channels? And then alternate which one I am sending each byte on?  The device uses 4 byte instructions. So if I wanted to send an instruction would I send Serial1(firstByte) then Serial2(secondByte), Serial1(thirdByte), Serial2(fourthByte)?   And then receive data the same way? I feel like I am missing something and can do this on one UART channel but am not sure how. Does anyone know if there is an API to get the current monitor state (on or off) in Windows (XP/Vista/2000/2003)?  All of my searches seem to indicate there is no real way of doing this.    tries to use  which according to Microsoft's docs does not work for display devices.   In Vista I can listen to  but I do not seem to get events when the monitor is turned off manually.   In XP I can hook into WM_SYSCOMMAND SC_MONITORPOWER, looking for status 2. This only works for situations where the system triggers the power off.   The WMI Win32_DesktopMonitor class does not seem to help out as well.   Edit: Here is  on comp.os.ms-windows.programmer.win32 indicating there is no reliable way of doing this.   Anyone else have any other ideas? $H_1 ,H_2 \unlhd \, G$ with $H_1 \cap H_2 = \{1_G\} $. Prove every two elements in $H_1, H_2$ commute Rsync filter: copying one pattern only I would like to show the author names using \citet but I get just the reference number. Here is a minimal code:  \documentclass{report} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{natbib}  \begin{document}   The author \citet{toschi09} has shown that ..  \bibliographystyle{plain} \bibliography{foo}  \end{document}   And here is foo.bib  @article{toschi09, author = {Toschi, F. and Bodenschatz, E.}, title = {Lagrangian Properties of Particles in Turbulence}, journal = {Annual Review of Fluid Mechanics}, volume = {41}, number = {1}, pages = {375-404}, year = {2009},  }   What I get is:     The author (author?) [1] has shown that ..   Any help will be more than welcome, thank you! Error: could not start the command in Texmaker when I run makeindex I'm trying to create a nomenclature but I'm getting the following error when I run makeindex:     Error: Could not start the command   This error appears even with this basic example:  \documentclass{article} \usepackage[refpage]{nomencl}  \makenomenclature  \begin{document} Example of nomenclature \nomenclature{A}{Area}  \printnomenclature \end{document}   In the Configure Texmaker editor I wrote: makeindex %.nlo -s nomencl.ist -o %.nls in the makeindex slot. Then I run:   PdfLaTeX MakeIndex   And the error appears... I also tried all suggestions , but nothing seems to work.  I have installed MacTex 2012 distribution, Mac OS X 10.7.5 Restricting T to string and int?