cfr once asked and answered the following question:   In short: every run of xindy/texindy on an actual file (not the help menu) does end with something like  /usr/local/texlive/2017/bin/x86_64-linux/xindy.run: error while loading shared libraries: libncurses.so.5: cannot open shared object file: No such file or directory   The problem is that the given solution does not work anymore nowadays. Running an up-to-date TeX Live 2017 (vanilla) and Arch Linux x64 with access to AUR I tried to use the packages given in the answer. Unfortunately both cannot be validated and even skipping the signature check does not help.  Probably it could work compiling xindy manually against another library, but where are the official sources with version 2.5.1 (or newer)?  Or is there maybe another way of getting xindy to work on a "modern" OS?  Update: I've tried to compile the ancient sources from 2010 from  (CVS) where any essential binaries and code files are from 1996 (no luck). And the xindy home page talks about xindy 2.2 being a release candidate, although TeX Live 2017 ships with xindy 2.5.1.  Update 2: As @DavidCarlisle showed in the chat the usual behavior would be  $ xindy --version xindy release: 2.5.1 xindy script version: 1.18 xindy kernel version: 3.0 CLISP version 2.49.50 (2017-03-19) (built on desktop-new [192.168.1.4])     architecture: X86_64   Because of the missing library the kernel version and the clisp version do not even show up.
My GNU/Linux system (Arch) now has libncurses.so.6 rather than libncurses.so.5. But I have upstream's vanilla TeX Live (fully updated) and xindy wants libncurses.so.5:    xindy --version   produces the following error  xindy release: 2.5.1 xindy script version: 1.18 /usr/local/texlive/bin/xindy.run: error while loading shared libraries: libncurses.so.5: cannot open shared object file: No such file or directory   And ldd can confirm the problem:  ldd /usr/local/texlive/bin/xindy.run    gives      linux-vdso.so.1 (0x00007ffc07997000)     libm.so.6 =&gt; /usr/lib/libm.so.6 (0x00007fab4d1b1000)     libcrypt.so.1 =&gt; /usr/lib/libcrypt.so.1 (0x00007fab4cf79000)     libncurses.so.5 =&gt; not found     libdl.so.2 =&gt; /usr/lib/libdl.so.2 (0x00007fab4cd75000)     libc.so.6 =&gt; /usr/lib/libc.so.6 (0x00007fab4c9d1000)     /lib64/ld-linux-x86-64.so.2 (0x00007fab4d4af000)   How can I use xindy without changing my operating system, while using vanilla TeX Live?  2 strategies have occurred to me:   compile xindy from sources against libncurses.so.6; compile and install libncurses.so.5 alongside libncurses.so.6.   Option (2) can be dodgy or can be fine, depending on the details. My suspicion is it may be dodgy for this library, simply because no packages are available for the old version of the library, which might mean there are problems having both installed. Moreover, since everything else is compiled against the new version, I'm not sure whether this would be enough for xindy anyway.  Option (1) I have no idea about. I don't know if this is even vaguely doable or, in fact, where the sources are or what might be required to compile them. (I don't suppose there's any chance a pre-compiled binary is available somewhere? But that is probably hoping for too much ;).)  What is the most practicable approach?
Why is electric field of an infinite plate constant at all points? I know from Gauss law, it is $\vec{E}=\dfrac{\sigma}{2 \epsilon_0}(\hat{n})$ at all points. But it doesn't make sense because of the inverse square nature of electric field which suggests if you move further away from the plane, electric field must reduce.   Then why is electric field of an infinite plate constant at all points? Algorithm to match one input file with given numbers of file Game about placing pennies on table This problem is from The Art and Craft of problem solving book:  Consider the following two player game. Each player takes turns placing a penny on the surface of a rectangular table. No penny can touch a penny which is already on the table. The table starts out with no pennies. The last player who makes a legal move wins. Does the first player have a winning strategy?  Now its not hard to see that the first player will always win if you place the coin in the center. But I have been thinking about what would happen If I also allow Quarter, Loonie and Twoonies. Does the first player have a strategy to always win? Could someone provide an explanation? I want to enable GPU rendering, but there is no option in User Preferences > System:    Why is this? How can I get cycles to render using my GPU? Explaining different Standard Deviation results from same data in ArcGIS Desktop and MS Excel? I have done some interpolation in Geostatistical Analyst in ArcGIS and I got the Standard Deviation (SD) a bit different from the SD that I calculated in Excel Spreadsheet.   What algorithm does each package use? Why are the results different? Refereeing papers on behalf of a professor: should it be listed on a CV? My professor sometimes asks me to referee papers for him.  Should I list the corresponding journals in the professionals activity section of my CV? How to automatically archive a directory? I want to do one way synchronization.  I am having Folder A on my computer which is constantly updated with content. Another Folder B is used for backup purpose which is on external HDD.  Now what I expect is that whatever extra which is present in folder A should go to folder B. However something which is present in B and NOT in A ""shall NOT be copied to A"".  In a nutshell, the backup folder may copy everything from the source folder, however nothing should be copied form backup folder to the source. Let us view our deleted comments Forest tree not symmetric What is the difference between these two ways to calculate average velocity? Average velocity:  $$v_{\rm avg,1}=\frac{v_{\rm final}+v_{\rm initial}}{2}$$   and average velocity:   $$v_{\rm avg,2} =\frac{\rm total\;displacement}{\rm time \;taken}=\frac{\Delta x}{\Delta t} $$  What is the difference between them and when do we use them? Conditions: do not modify the original lists; JDK only, no external libraries. Bonus points for a one-liner or a JDK 1.3 version. Is there a simpler way than: List&lt;String&gt; newList = new ArrayList&lt;String&gt;(); newList.addAll(listOne); newList.addAll(listTwo); Context  I'm having trouble understanding the limited situations in which qualifiers can be distributed.  I am given that the rules are:  $$\forall x\left[P(x)\land Q(x)\right]\equiv\forall xP(x) \land\forall xQ(x) \tag{1}$$ $$\exists x\left[P(x)\lor Q(x)\right]\equiv\exists xP(x) \lor\exists xQ(x) \tag{2}$$  $$\forall x\left[P(x)\lor Q(x)\right]\not\equiv\forall xP(x) \lor\forall xQ(x) \tag{3}$$ $$\exists x\left[P(x)\land Q(x)\right]\not\equiv\exists xP(x) \land\exists xQ(x) \tag{4}$$    Questions   What are examples of $P(x)$ and $Q(x)$ that illustrate when these statements are true? How can I show these statements always hold using proofs? Why can't "$\forall x$" be distributed in example 3 or "$\exists x$" in example 4? I recently came across an algorithm that works on values assuming that they are draw from a monoid equipped with a total ordering relation.  I was wondering if there is a term for such a structure, since it seems related to concepts like Euclidean domains and fields (though the requirements are much less strict).  Does this entity have a name?  Or is it just "a monoid over totally ordered elements?"  Thanks! Evaluating string "3*(4+2)" yield int 18 Erase Windows Vista to Install Ubuntu new here. I have an old E-machine which as Windows Vista on it and I want to erase the Windows Vista, and install Ubuntu on it instead, but I am not sure where to start. Can I first install Ubuntu, and THEN erase Windows Vista, or is there a more sure method? I appreciate your help. Is there a function to round a float in C or do I need to write my own? PHP import Excel into database (xls & xlsx) Explanation of method for showing that $\frac{0}{0}$ is undefined Why can´t we assign a new string to an char array, but to a pointer? Is there a new auto-login feature?