Infinitive instead of gerund, specifically after 'require'
When should a verb be followed by a gerund instead of an infinitive?
Evaluating string "3*(4+2)" yield int 18 How do I know the script file name in a Bash script? How can I determine the name of the Bash script file inside the script itself?  Like if my script is in file runme.sh, then how would I make it to display "You are running runme.sh" message without hardcoding that? NEWID() In Joined Virtual Table Causes Unintended Cross Apply Behavior My actual work query was an inner join, but this simple example with cross join seems to nearly always reproduce the problem.  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT NEWID() TEST_ID ) BB ( B )   With my inner join I had many rows for which I added to each a GUID using the NEWID() function, and for about 9 out of 10 such rows the multiplication with the 2-row virtual table produced the expected results, just 2 copies of the same GUID, while 1 out of 10 would produce different results. This was unexpected to say the least and gave me a really hard time trying to find this bug in my test data generation script.  If you take a look at the following queries using as well non-deterministic getdate and sysdatetime functions, you won't see this, I don't anyway-I always see the same datetime value in both final result rows.  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT GETDATE() TEST_ID ) BB ( B )  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT SYSDATETIME() TEST_ID ) BB ( B )   I'm currently using SQL Server 2008 and my work around for now is to load my rows with GUIDs into a table variable before finishing out my random data generation script. Once I have them as values in a table as opposed to virtual table, the problem goes away.  I have a workaround, but I'm looking for the ways to workaround without actual tables or table variables.  While writing this I tried without success these possibilities: 1) placing the newid() into a nested virtual table:  SELECT * FROM (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A ) CROSS JOIN (     SELECT TEST_ID     FROM (         SELECT NEWID() TEST_ID     ) TT ) BB ( B )   2) wrapping the newid() within a cast expression such as:  SELECT CAST(NEWID() AS VARCHAR(100)) TEST_ID   3) reversing the order of appearance of the virtual tables within the join expression  SELECT * FROM (     SELECT NEWID() TEST_ID ) BB ( B ) CROSS JOIN (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A )   4) using uncorrelated cross apply  SELECT * FROM (     SELECT NEWID() TEST_ID ) BB ( B ) CROSS APPLY (     SELECT 1 UNION ALL     SELECT 2 ) AA ( A )   Just before finally posting this question, now I tried this with success it seems, a correlated cross apply:  SELECT * FROM (     SELECT NEWID() TEST_ID ) BB ( B ) CROSS APPLY (     SELECT A     FROM (         SELECT 1 UNION ALL         SELECT 2     ) TT ( A )     WHERE BB.B IS NOT NULL ) AA ( A )   Anyone have any other more elegant, simpler workaround? I really don't want to use cross apply or correlation for a simple row multiplication if I don't have to. Compute the integral $\int\frac{dx}{(x^2-x+1)\sqrt{x^2+x+1}}$ Kinetic energy is simple, right?! from the equation it seems as though if you know the speed and mass you'll know the work. Let's try to prove it. let's assume we know the acceleration and distance for now. $$w=mda$$ So the distance is $$d= 1/2 *at^2$$ Then  $$t = \sqrt{2d/a}$$ So $a*t$, which is the speed, is  $$a*\sqrt{2d/a} = a* \sqrt{2d}/\sqrt{a} = \sqrt{2da} = \sqrt{2w/m}$$ So regardless of the distance or acceleration, if you know the work and the mass, you can calculate the speed which is  $$v=\sqrt{2w/m}$$  What if you know the speed and the mass? You can easily calculate the work. $$v = \sqrt{2w/m}$$ Then  $$v^2 = 2w/m$$  That would mean  $$m*1/2*v^2=W $$ Rearrange it and  $$W= 1/2 *m *v^2$$ would be the equation.  What if you have an initial speed and a new speed and want calculate the amount of work done after an initial speed to get the new speed? You'll just subtract the total work from the initial speeds work.  $$1/2mv^2 - 1/2ms^2$$  where s is  the initial speed and v is the new speed. However if you do it the other way which is  $$d= 1/2at^2 + vt$$ and solve it the answer would be $$1/2ms^2  + 1/2msv$$ Why aren't they equal? Let $A$ be a commutative ring with $1$. Let $I$ and $J_k$, $k=1,\dots,n$ be ideals of $A$ with $I\subseteq \cup _{k=1}^n J_k$. Then I have obtained the following:  (1) If $J_k$, $k=1,\dots,n$, are prime ideals, then there exists some $j$ such that $I\subseteq J_j$.   (2) If $A$ is a principal ideal ring, then there exists some $j$ such that $I\subseteq J_j$.   I want some counterexamples that for all $k=1,\dots,n$, $I$ is not contained in $J_k$. How to get the counterexamples? I got a bunch of files in some directory (along with many other files) that I want to move.   Luckily, all the files I want to move contain a certain identifier in their names, so I can ls | grep IDENTIFIER to get the exact list of files to move.   But, how can I execute mv file /path/to/dest/folder/ at once, and not one by one (there's a lot of files to move)? How to find the frequency and type of my current RAM? How shall I find out the frequency and type of my current RAM? My OS is Ubuntu 12.04. Let $x*y=\gcd(x,y)$ on $D_n=\{x\in \mathbb N:x |n\}$. I have to prove that $(D_n,*)$ is a commutative monoid and I have a problem when finding the identity element.  $x*e=x$  So $gcd(x,e)=x \to e=xk,k\in \mathbb N^*$ and $e \leq n$  A good $e$ is $0$ but it's not in $D_n$ How to compare dates in Java? Functional equation $f(r \cos \varphi)+f(r \sin \varphi)=f(r)$ Find all such monotonous function $f:[0,+\infty)\to \mathbb R$, such that for any real $r\ge0$ and $\varphi \in \left[\frac{\pi}6, \frac{\pi}4\right]$, $$f(r \cos \varphi)+f(r \sin \varphi)=f(r)\text.$$  My work so far:  If $\varphi \in \left[\frac{\pi}6, \frac{\pi}4\right]$ then $$\frac{\sqrt2}2\le\cos \varphi\le\frac{\sqrt3}2$$ $$\frac12\le\sin \varphi\le\frac{\sqrt2}2$$  If $r=0$ then $f(0)=0$  If $\varphi= \frac{\pi}{4}$ then $$f(r)=4f\left(\frac r2\right)$$  $f(x)=cx^2$ for $x\ge0$ and $c\in\mathbb R$ Let users editing a question know if editing it would add it to the reopen queue This is sort of similar to , which was positively received, but was declined for technical reasons. I propose that users who are editing a post that was closed within the last five days be shown a notice on top of the edit form indicating that the post will be added to the reopen queue if edited, and that if one does not plan on editing the post into a state where it can be reopened, one should wait until five days after closure to make the edit. Closed questions are only added to the review queue once per closure by editing, and if a user comes by and makes a minor (yet benign) edit, the diff that reopen reviewers see is just that of the minor edit, and as such they dismiss the task as &quot;Leave Closed&quot;, which prevents it from being added to the queue again by another edit. This deprives the post author (and others interested in seeing the question reopened) of their chance to get the post reopened by editing. While some of these edits may be performed by users using (semi-)automated tools who would thus not see or overlook the warning, this will be a big help because 99%+ of users make edits solely manually and would thus see and possibly respond to such a notice. To help make this request more technically feasible, I propose that it instead only be loaded with the edit form, and that it should only be shown to users who can make binding edits. (Suggested edits occur at the time of approval, and the request to let the reviewers know has already been declined.) Here's an example of what I'm expecting:  This question was recently [closed/marked as duplicate]. This question will be added to a queue for possible reopening if you make this edit. If you are not planning to edit this post into a state where it can be reopened, please wait until [date and time after 70 days] to make your edit. If you are only making edits to the question's tags, please ignore this notice. How can I define a 3D version of the built-in VoronoiDiagram (VoronoiMesh in V10) function? Why do you cast downvotes on answers? This is a question which started off with a , then turned into an , and now it's a question in its own right (as suggested by Jeff). I'm not sure where it could go from here :)  It's obvious that different people cast downvotes for different reasons. (Upvotes are less controversial, generally.) Here are some possible reasons:   Answer is wrong Answer is misleading (may be technically accurate, but will lead to readers making mistakes) Answer doesn't match the question (e.g. a C# answer to a question about Java) Answer doesn't really address the question, e.g. suggesting a completely different solution, even if the question specifies that there are good reasons why the current approach has to be followed Answer is okay, but not as good as another one which currently has fewer votes Answer appears to be plagiarised from existing answers. Answer is by someone I don't like. Answer is abusive (profanity, spam etc). No reason, I just felt like it. I'm a , and prefer down to up. Have you considered down? Ideological grounds: answer suggests a technology I don't like, or expresses a negative opinion of a technology I do like   Personally I go with 1, 2 and 8 - although I'll add comments suggesting changes in various other situations.  Have I missed anything? What do you do, and why? What are the net benefits (to you, the world in general, and the answerer) from your approach? How are answers with the same vote score sorted? When a new question is asked how are the answers sorted?  I just answered a question and there were two other answers.  All three answers have 0 votes and no edits.  Immediately after I answered my answer appeared first.  Now the order refreshed,  it appears they are sorted by reputation. My Ubuntu 14.04 is stuck when trying to login my desktop. The screen goes black and soon after that the login screen comes back.   I followed all steps in  but the issue was not solved. How can I prepend a tag to the beginning of several files? \textcite macro produces "Author (year)" correctly but colours first paren with hyperref I am using a custom \textcite macro that I found somewhere. It works nicely except that it makes the opening paren of "Author (year)" part of the link (also colouring it blue) which is not desired.  This is likely just a minor change to the definition of the macro, but the solution eludes me (I don't get where the opening paren is added at all).    Opening paranthesis should not be part of link and should not be coloured.  (M)WE:  \documentclass{scrartcl}  \usepackage{csquotes}  \usepackage[backend=biber,             bibencoding=utf8,             hyperref=true,             natbib=true,             minnames=1,     %% prevent truncation to year-only             backref=true, %% TODO REMOVE before final             bibstyle=apa,             citestyle=authoryear,             ]{biblatex} \DeclareLanguageMapping{english}{english-apa} \addbibresource{bib.bib}   \DeclareCiteCommand{\textcite}   {\boolfalse{cbx:parens}}   {\usebibmacro{citeindex}%    \printtext[bibhyperref]{\usebibmacro{textcite}}}   {\ifbool{cbx:parens}      {\bibcloseparen\global\boolfalse{cbx:parens}}      {}%    \multicitedelim}   {\usebibmacro{textcite:postnote}}   \usepackage[table,svgnames]{xcolor}  \definecolor{solblue}{HTML}{268BD2}  \usepackage[pdftex]{hyperref}  \hypersetup{    pdfhighlight = /P,    colorlinks=true,    urlcolor=solblue,    filecolor=solblue,    linkcolor=solblue,    citecolor=solblue,    raiselinks=true,    breaklinks,    unicode }   \begin{document}  foobar \textcite{thesis_pockrandt} foobar  \end{document}   bib.bib:  @phdthesis{thesis_pockrandt,     author = {Christopher Maximilian Pockrandt},     title = {{Approximate String Matching: Improving Data Structures and Algorithms}},     year = {2019} } Installing Steam on Debian I have ran into some issues when it went down to install Steam on Debian. The console as well as Apper comes up with missing dependencies  and the package isn't going to install. How many points in RSA, such that $m^e = m \bmod n$ For every RSA-cryptosystem, there exist some messages $m$, for which it holds that $m^e \equiv m \pmod n$ As to the question, how many such messages exist, this question has already been asked and answered here:  However, I do only understand the answer up to a certain point Suppose that $n$ is only 1 prime. Then it holds that the number of unconcealable messages is $\gcd(e-1, p-1)+1$ This is because in $m^e \equiv m \pmod  p$ , either $m = 0$ or $m \not= 0$. In the latter case $m$ can be expressed as $g^t$, where $g$ is a Generator in $\mathbb{Z_p}$ $g^{t*e} \equiv g^t \pmod p$ $g^{t(e-1) \bmod p -1 } \equiv g^{0 \bmod p -1} \pmod p$ $t(e-1) \equiv 0 \pmod {p-1} $ has exactly $\gcd(e-1, p-1)$  solutions, so the total number of unconcealable messages is, together with $m=0$ , $\gcd(e-1, p-1)+1$ When we now look at real RSA, which has two prime factors in its modulus, it holds that the number of unconcealable messages is $(\gcd(e-1, p-1)+1)\cdot(\gcd(e-1, q-1)+1)$ Why is that so? I suppose it has to do with CRT, but I just cant understand why.