How can I write a macro with more than 10 arguments?
I have a mathematical transformation that takes 16 parameters (grouped into 3+8+5) and would like to make a latex command for it, so that I can easily change the notation for it if the need arises.  As far as I know, both \def and \newcommand take a maximum of 9 arguments, is there any (recommended) way to extend this?
Is there an easy method for installing binary builds of glibc? Time and time again I see questions such as these:       And these are the types of solutions we're typically pushing:        Is this really the best we can do? Aren't there binary builds of GLIBC that we can simply unzip into a directory such as /opt/myglibc, and set the $LD_LIBRARY_PATH or whatever and run whatever application we want, without issues?   An application, such as the newer builds of Chrome (28+) that appear to require GLIBC 2.14?  NOTE: This thread titled:  on tecmint.com is what ultimately got me thinking about this.  References How to succeed with making omelette I have $k$ pairs of samples from different distributions. For each pair of samples I want to check if the samples are taken from a normal distribution with the same mean and variance. I assume the normal distributions for each pair is different and independent of other pairs. I do not know the mean and variance of any of the distributions.  I am doing a two sample t-test for each of the pairs. I want to combine the $k$ resulting p-values.   I could use Fisher's method but I am wondering about the distribution of the average t-value. If these were z-values rather than t-values I would use Stouffer's z-test. I could also approximate the t-distribution with a z-distribution and than use Stouffer's z-test, but I am not sure if that is a good approximation.  Is there a test like Stouffer's z-test for t-values?  Is there a better way to combine the t-values? PCA on correlation or covariance? What are the main differences between performing principal component analysis (PCA) on the correlation matrix and on the covariance matrix? Do they give the same results? Redirect all subsequent commands' stderr using exec Proof of an elementary property of Projection Operators I'm asked to show the following:  Let $X$ be a linear space, and let $P : X \rightarrow X$ be a projection operator. Restricted to the linear space $range(P)$, the projection $P$ is the identity operator, that is, $Px = x$ for all $x \in range(P)$.  If anyone could offer a hint for how to show this. I'm rusty with linear algebra so don't really know what I'm supposed to bring in outside of what's specified in the lemma/definition of projection. What is so special about the range of P that would make this so? Is there a notification mechanism for when a dependency property has changed? How do you extract IP addresses from files using a regex in a linux shell? I am looking for an application which can do the following:   Resize one or more images Compress images Rotate and flip images Rename multiple images using a progressive number or a prefix/suffix Convert an entire PDF file to a bunch images Extract an image from a Windows .ico file Convert images to DPX, EXR, GIF, JPEG, JPEG-2000, PDF, PhotoCD, PNG, Postscript, SVG, TIFF, and other formats   I am running Ubuntu GNOME 15.10 with GNOME 3.18. Set limit to one author when using "et al." in biblatex How to set the font for a \section title (and chapter etc) How do I specify the fonts, and general font size, for the titles, chapters and sections in my document  Update:  I can see how my question is confusing.  I use \section and \chapter etc. to organise my document, and I would like to change the way the section and chapter titles are displayed. I installed Ubuntu yesterday, so I'm trying to get used to it.  I'm really close to my router, but my wifi signal gets too low. Sometimes I'm in Facebook or Youtube and the signal is high, almost full, but it is usually in one or two bars, and sometimes none.  I can use Internet normally, I can watch videos and stuff, but the problem is when I try to update something or Ubuntu is downloading stuff, the downloads get stuck or get cancelled telling me that I should check my connection.  How can I fix this? I should be getting a really good signal, I'm really close to my router, my phone has full signal, and a notebook with Windows 7 has full signal here too.  Sorry my bad English and I hope you can help me.  $ lsusb Bus 009 Device 001: ID 1d6b:0001 Linux Foundation 1.1 root hub Bus 004 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 008 Device 001: ID 1d6b:0001 Linux Foundation 1.1 root hub Bus 007 Device 001: ID 1d6b:0001 Linux Foundation 1.1 root hub Bus 003 Device 002: ID 0bda:8179 Realtek Semiconductor Corp.  Bus 003 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Bus 006 Device 002: ID 0458:003a KYE Systems Corp. (Mouse Systems) NetScroll+ Mini Traveler / Genius NetScroll 120 Bus 006 Device 001: ID 1d6b:0001 Linux Foundation 1.1 root hub Bus 005 Device 001: ID 1d6b:0001 Linux Foundation 1.1 root hub Bus 002 Device 001: ID 1d6b:0003 Linux Foundation 3.0 root hub Bus 001 Device 001: ID 1d6b:0002 Linux Foundation 2.0 root hub Boot screen in low graphics/text mode My ubuntu boot screen shows up in a strange low resolution, almost text mode, instead the usual and sleek white "ubuntu" over dark background. It's not a big issue because when GDM loads everything becomes ok, but If there's an easy way to fix it I would like to give it a try. Can you update to macOS 10.14 (Mojave) without converting to APFS? At WWDC 2018 macOS 10.14 or macOS Mojave was disclosed.  I am currently on macOS Sierra (10.12) and am looking forward to upgrading to macOS Mojave once its released.  I was wondering if it will be possible to update to macOS Mojave without converting to APFS, similar to  trick from OS X Daily on how to upgrade to macOS High Sierra (10.13) without converting to APFS with the command /Applications/Install\ macOS\ High\ Sierra.app/Contents/Resources/startosinstall --converttoapfs NO. Suppose we have a natural number $n \ge 0$.  Given natural numbers $\alpha_1,\ldots,\alpha_k$ such that   $k\le n$ $\sum_i \alpha_i = n$   what is the maximum value that $\Pi_i \alpha_i$ can take?  I'm quite sure that there is a theorem telling me the result, but I cannot find it. For sure an upper bound is $n^k$ but I'm searching for a real upper bound. I'm pretty sure that upper the bound should be $n^2$, but I don't know I could prove it. Each package name is in the form: package-XubuntuY*_amd64(i386)  So my questions are:   What does the X stand for? What does the Y stand for?   for example binutils_2.22-6ubuntu1.3_amd64  What is the meaning of the numbers 6 and 1.3 The computer gave me this output in a window:  E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_natty_main_binary-i386_Packages E: The package lists or status file could not be parsed or opened.   How can I fix this? why this code can run ? double a[3]; a[1,1]=1; Where do executables look for shared objects at runtime? I understand how to define include shared objects at linking/compile time. However, I still wonder how do executables look for the shared object (*.so libraries) at execution time.  For instance, my app a.out calls functions defined in the lib.so library. After compiling, I move lib.so to a new directory in my $HOME.  How can I tell a.out to go look for it there? Use fixed keyboard for a given app I would like to tell my Android that when I'm in a given app it should switch to a given keyboard. My use case is that I want to use Hacker keyboard with Connectbot.