NGINX server license costs
Can you help me with my software licensing issue?
I have this table definition as part of a invoice  \begin{tabularx}{\textwidth}[ht]{lXrr}%   It worked fine for years until I have a very short word in the X column for the first time. Now my table is very small in width and centered horizontally on the page.  In my expectation the X column should fill up all space until the width of the table reaches the width of the page except the margins.  I have read about workarounds specifying something like 1.2\textwidth, but I don't like that, because the table is a template included via \include, so it would affect all my invoices.  I also tried \linewidth, \hsize and \columnwidth, but everything results in the same layout.  Is there a way to make the only X column expand so that it uses all available space?    Complete included table definition (Rechnungstabelle.tex):  \newcommand{\Rechnungstabelle}[4]{% vielen Dank für Ihren Auftrag. \noindent \begin{tabularx}{\textwidth}[ht]{lXrr}% \toprule% \bf{Anzahl} &amp; \bf{Bezeichnung} &amp; \bf{Einzelpreis} &amp; \bf{Gesamtpreis} \\% \midrule% #1% \bottomrule% &amp; \bf{Rechnungsbetrag}  &amp; &amp; \bf{\EUR{#2}} \\% \ifthenelse{\equal{#3}{}}{}{&amp; Enthaltene MwSt. 19\% &amp; &amp; \EUR{#3} \\}% \ifthenelse{\equal{#4}{}}{}{&amp; * Enthaltene MwSt. 7\% &amp; &amp; \EUR{#4} \\}% \end{tabularx}% }   Changing the table header row to  \bf{Anzahl} &amp; \bf{Bezeichnung} \hspace{\textwidth} &amp; \bf{Einzelpreis} &amp; \bf{Gesamtpreis} \\%   is a workaround, but I don't think that would be good TeX style.  Minimum example for reproducing:  \documentclass[ fontsize=12pt,                  paper=a4,                 foldmarks=TBMPL,                 fromalign=center,                 ngerman                 ]{scrlttr2} \usepackage{babel} \usepackage[utf8]{inputenx} \usepackage[right]{eurosym} \usepackage{tabularx} \usepackage{ltablex} \usepackage{booktabs} \usepackage{ifthen}  \input{Rechnungstabelle} \begin{document} \begin{letter}  \Rechnungstabelle{     1,0 h &amp; Do something &amp; \EUR{99,00} &amp; \EUR{99,00} \\      }     {99,00}     {}{} \end{letter} \end{document} Convergence/Divergence of infinite series $\sum_{n=1}^{\infty} \frac{(\sin n+2)^n}{n3^n}$ $$ \sum_{n=1}^{\infty} \frac{(\sin n+2)^n}{n3^n}$$  Does it converge or diverge?   Can we have a rigorous proof that is not probabilistic?   For reference, this question is supposedly a mix of real analysis and calculus. The  (ESC), states that for every natural number $n \geq 2$, there exists a set of natural numbers $a, b, c$ , such that the following equation is satisfied:  $$\frac{4}{n}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\tag{1}$$  The basic approach to solving this problem outlined by Mordell [Ref1] is described below  By defining $t$ and $m$ as positive integers greater than zero and $q$ a positive integer greater than one we can observe that  a) There is always a solution for even $n$, since if $n=2^qt$ we have the trivial solution $$\frac{4}{4t}=\frac{1}{t}$$  In the remaining case $n=2(2t+1)$, a solution in the form of two Egyptian fractions can always be found  e.g. $$\frac{4}{2(2t+1)}=\frac{2}{2t+1}=\frac{1}{t+1}+\frac{1}{(t+1)(2t+1)}$$  b) If $(1)$ is a solution for some particular prime $n$ then all composite numbers $mn$ divisible by $n$ are also solutions, thus  $$\frac{4}{mn}=\frac{1}{ma}+\frac{1}{mb}+\frac{1}{mc}$$  will also be a solution. This means that we can simplify the analysis to the cases where $n$ is a prime greater than 2.  Using Mordell's approach we have just shown that we only need to consider the cases where $n$ is prime and where $n \equiv 1 \pmod{2} \;\;[meaning \;\;n=2t+1]$  The argument continues...  Mordell goes on to show in turn that the search can be reduced further to the cases when $$n \equiv 1 \pmod{4} \;\;[meaning \;numbers \;\;n=4t+1]$$ $$n \equiv 1 \pmod{8} \;\;[meaning \;numbers \;\;n=8t+1]$$ $$n \equiv 1 \pmod{3} \;\;[meaning \;numbers \;\;n=3t+1]$$ $$n \equiv 1,2,4 \pmod{7} \;\;[meaning \;numbers \;\;n=7t+1,n=7t+2 \;or\;n=7t+4 ]$$ $$n \equiv 1,4 \pmod{5}  \;\;[meaning \;numbers \;\; n=5t+1 \;or\;n=5t+4]$$  Assembling these results together, Mordell showed that the conjecture can be proved in this context except for the cases when $$n \equiv 1,11^2,13^2,17^2,19^2,23^2 \pmod{840}$$  Mordell stated that since the first prime meeting this condition is 1009, this is proof that the conjecture holds for $n&lt;1009$.  This basic approach can be pursued further. Other workers have shown that the conjecture holds for much higher values of $n$ using similar methods as can be seen on the above Wikipedia page.   Note that other intermediate results can be constructed from the above congruence's, e.g. $n \equiv 1 \pmod{24}$.  The question is:  Are there any other elementary approaches to solving this problem than the one outlined by Mordell (and described above)?  [Ref1] Louis J. Mordell (1969) Diophantine Equations, Academic Press, London, pp. 287-290. How can top principal components retain the predictive power on a dependent variable (or even lead to better predictions)? Why is oil a better lubricant than water? How come mineral oil is a better lubricant than water, even though water has a lower viscosity?    When two surfaces slide over each other with a gap filled with a fluid, the different layers of the fluid are dragged at different speeds. The very top layer touching the top metal surface will have the same speed as the surface itself, while the bottommost layer is stationary. The speed in the layers between is distributed linearly and there exist friction forces between those layers that slow the movement. Those frictional forces should be reduces however, if a fluid with a lower viscosity is chosen.   How come this is not so?   Does it have to do with water's polarity, so that it sticks to surfaces in a different way than oil? With Windows 7, why is an entry in the hosts file not working? I updated some entries in the  at C:\WINDOWS\System32\drivers\etc.  As a test, I decided to make Google point to 127.0.0.1.  # Additionally, comments (such as these) may be inserted on individual # lines or following the machine name denoted by a '#' symbol. # # For example: # #      102.54.94.97     rhino.acme.com          # source server #       38.25.63.10     x.acme.com              # x client host  127.0.0.1       localhost ::1             localhost 127.0.0.1       google.com   This works fine on Windows Vista, but not on Widows 7. When I type google.com into my browser, it goes directly to Google's website.  I am not using a proxy server, and I think there might be some temporary DNS settings that need to be flushed, but I'm not sure.  Does anyone know how to fix this? The proof I have starts of with $\;xy=0\;$ in a field.   Then $x^{-1}$ exists because it is a field.  Then $x^{-1} xy=x^{-1} 0$.  Therefore $y=0$.  But surely if an integral domain can not have any zero divisors, how can we end the proof by saying $y=0$? Surely then y is a zero divisor and hence the field is not an integral domain? How to log out user from web site using BASIC authentication? Sum of closed spaces is not closed As I finished programming the MCU in the Arduino Uno board to receive some RF Signal and drive relays, I moved it into a standalone board I made with Eagle. The circuit is pretty basic, the MCU receives data from a RF Receiver, processes it and then turns on/off some pins that drive 5V relays (through transistors, of course). When I test it on the Arduino Board, you can see that the LEDs toggle ON and OFF whenever I send the data through the RF Transmitter. You send once, it toggles ON, you send another time, it toggles OFF and so on. This works for all the 4 PINS that it has programmed. In my standalone board, each of these four pins are connected to transistors that drive 5V relays. The problem is that only one pin seems to activate, and then it won't even toggle OFF, like you send the data once and you can hear the relay's coil go ON, but then if you try to toggle it OFF it just won't, it's latched ON and I have to unplug and plug the USB cable again to reset it. The ATMEGA328P has a 16MHz crystal, two 22pF caps for the crystal, and a 10K resistor that goes from the Reset Pin to VCC. I'm not sure why the MCU behaves so weird in my board. There's also another VERY weird detail I didn't mention. If instead of using the RF Receiver, I connect the Data Output pin of the PIC that drives the RF Transmitter directly into the Receiver board, that one pin I mentioned that works is able to toggle OFF and ON again, but still, the other pins just don't work. I've tested it not only by hearing the relay's coil but also by using a multimeter. Any help would be really appreciated.  EDIT:  Here is the Eagle Schematic of the board:    It's true that I really didn't concern about the noise, but since it was quite a simple project I didn't think that noise was going to attack so violently, plus  I don't really know how to protect the circuit from inductive noise. Thank you for answering fast!  EDIT 2:  Okay so here goes more detail:    Real photos:      The soldering seems quite awkward but I probed all the traces to check for continuity.  I could make some extra holes to, for example, add a 100nF decoupling capacitor for the MCU and so, but if you think I should enhance the schematic and add a lot more components, then I'll gladly remake the board.   About the supply, right now (for debugging) I'm connecting the Arduino Uno to a Cellphone Charger (Notebook won't supply enough current for relays), and I'm connecting those red and black cables to the Arduino Uno. I'm using that Cheap 433MHZ RF Receiver so if the circuit is so vulnerable to noise as you say, it may also be getting fouled up by the noise. What algorithm for a tic-tac-toe game can I use to determine the "best move" for the AI? How to unlock gungeoneers I've seen on a wiki that there is a ghost gungeoneer and a robot gungeoneer but it didn't say how to unlock them, so how do I unlock more gungeoneers ? I've got a Windows 8 (not .1, not Pro; OEM with a Lenovo Z580 laptop), which I want to use for WP8 development.  I've read  and , and a few more articles.  I have enabled in BIOS what looks like it has to do with hardware virtualisation - "Intel Virtual Technology" (is this VMX?). No signs of EPT or XD.  I've got the four Hyper-V items in the enumeration that msinfo32 shows.  However, in the 'Control Panel/Programs and Features/Turn on|off windows features' list, I don't have Hyper-V.  Is this available at all on my machine, and if not what can I do to get it working?  Thanks in advance. How can I show that if some group $G$ has only one subgroup $K$ of order $n$, then $K$ is a normal subgroup? Would that mean that it only has one subgroup total? If so then I guess that makes sense. Most of the time one or the other feels better, but every so often, "which" vs. "what" trips me up.   So, what's the exact difference and when should you use one or the other? Recommended way to save uploaded files in a servlet application Poll on best VNC / remote desktop software for assisting others on Windows/Mac machines from Ubuntu?    I've heard good things about TeamViewer and Fog Creek Copilot, but I'm wondering if the included GNOME Vinaigre VNC client is good enough for this.  To specify, I'm looking for best option based on:   SIMPLEST ease-of-use for client to download/use on their end. See #1. Works cross-platform I am able to control client's mouse and/or keyboard from remote machine. Let $G(r, n)$ be the Grassmannian of the set of all $r$-planes in a $n$-dim vector space. How to show that the cohomology of a Grassmannian has a basis consisting of the equivalent classes represented by Schubert cycles? I am confused since I don't know how to compute the cohomology of a variety (how to construct the co-chain complex). I am really appreciate if you can compute the cohomology of, for example, $G(2,4)$ and show that it has a basis consisting of the equivalent classes represented by Schubert cycles. Kind of converse of Kolmogorov maximal inequality Let $S_n=\zeta_1+...+\zeta_n$ where $\zeta_i$ are independent with $E\zeta_i=0, E\zeta_i^2=\sigma_i^2&lt;\infty, |\zeta_i|&lt;K$.  Then, $P(\max_{1 \leq m  \leq n}|S_m| \leq x) \leq (x+K)^2/\operatorname{var}(S_n)$.  How do we show this?  The hint says that I should use the fact that $S_n^2-\sum_{m \leq n}\sigma_m^2$ is a martingale. But I am totally clueless....  Any hint would be appreciated! Thanks and regards. Leave Convert to Edit button enabled all the time in the moderator flag list In the moderator flags list, there is a &quot;Convert to Edit&quot; button on answers which are posted by the person who posted the question. This button is disabled at times, and I am not sure that the algorithm used is useful. My proposal is that the Convert to Edit button in the flag list should always be enabled, as it seems fairly frequent that it's disabled when it would be useful. Justification When the button is disabled, it is required that we pop open the answer view in the flag list, and use the regular Mod menu and choose convert to edit there. When we do that, however, we experience this issue:  (that should also be fixed, by the way!) Here are two items currently in the queue:    Note that one has the button enabled, while the other does not. The only differences I can see in those two answers is the age and the number of answers. Neither question has an accepted answer, but the one with the button disabled only has that single answer. I've only just now noticed that difference with these two posts, so I'm not 100% sure if that's the determining factor. 1 It is perhaps coincidental, but these buttons being (dis)abled are reverse of the action needing to be taken. The one with the disabled button needed to be converted to an edit; the one with the enabled button was an attempt to answer their own question. If I'm right about the determining factor here (that the answer is the only one), I'm not sure that's useful. A good bit of the time, an asker will post an answer due to people requesting additional information. In such cases, it seems like it will be likely there are no other answers. 1  Note 1: I was looking to create a userscript to enable these buttons, and I found something that I think is related as to the reason. It looks like the ones which are disabled are on answers which have comments on them. I noticed the title attribute of those buttons says, &quot;There are comments on the post. Please review&quot;. That does seem to make some sense in theory. However, it still seems like I am often converting them, anyway. With the above-linked, separate issue regarding how the 'mod' link on the expanded view works, this is still a bit of an impediment to our workflow. It occurred to me to check if the button was reenabled once you expanded the view, but it does not. Maybe that's an alternate solution. My plan for my userscript is to enable the button, but change the text color (and leave the title attribute), to point out that there are comments.