how to get 32 bit kernel headers in 64 bit debian installation aptitude search linux-headers   provides this:  p   linux-headers-3.16.0-4-all      - All header files for Linux 3.16 (meta-pack p   linux-headers-3.16.0-4-all-amd6 - All header files for Linux 3.16 (meta-pack i   linux-headers-3.16.0-4-amd64    - Header files for Linux 3.16.0-4-amd64      i A linux-headers-3.16.0-4-common   - Common header files for Linux 3.16.0-4     p   linux-headers-amd64             - Header files for Linux amd64 configuration   but i need to get 32 bit kernel headers  how to do that with apt?
How do I run 32-bit programs on a 64-bit Debian/Ubuntu? I have a 64-bit (amd64 a.k.a. x86_64) Debian or Ubuntu installation. I need to run 32-bit (i386/i686) programs occasionally, or to compile programs for a 32-bit system. How can I do this with a minimum of fuss?  Bonus: what if I want to run or test with an older or newer release of the distribution?
How to get a toddler to start chewing and eating solids? My son is 18 months old and still doesn't want to chew and eat solid foods. We have to blend soups and other food into purée for him to accept it. If there is even a slight solid, he will automatically push it out of his mouth with his tongue.  I have had a breakthrough with breakfast where I don't blend as much and leave it a little chunky. He ate it but still pushed chunks of soft banana that were bigger out.  Some of my friends have kids that are 4-5 months younger, who are eating chicken cutlets.  Any ideas or proven methods for getting a child to start eating solids? I have been texture painting in look dev mode. But when i try to render it, everything looks very dark. I have 3 sun lights in my scene, ambient turned on in Eevee settings. What am i missing? I really like the look of my scene in Look Dev mode, how can i achieve the same look when my scene is rendered too? Let $(X,d)$ be a metric space, and say $(x_n)$ is a Cauchy sequence such that it has a convergent subsequence $(x_{n_k})$ that converges to $x$. We show $x_n \to x$. Let $\epsilon &gt; 0$. Take $N &gt;0$ such that for all $n,m &gt; N$, we have   $$d(x_n,x_m) &lt; \frac{\epsilon}{2}.$$  By hypothesis, we can take also $K &gt;0$ such that for all $n_k &gt; K$, we have  $$ d(x_{n_k},x) &lt; \frac{\epsilon}{2}.$$  Put $M = \max \{N,K\}$. Therefore, for all $n,m,n_k &gt; M$, we have  $$ d(x_n,x) \leq d(x_n, x_{n_k}) + d( x_{n_k},x) &lt; \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon.$$  Hence, $x_n \to x$ as desired.  Is this a correct approach? Thank you very much in advance. Suppose that f is continuous on $(a,b)$ and $\lim_{x\to a^+}  f(x) = \lim_{x\to b^-} f(x) = \infty$. Prove that $f$ has a minimum on all of $(a,b)$.  I was thinking of applying the extreme value theorem, but I realized that it applies only to closed intervals. So I was thinking of defining a closed interval that is in $(a,b)$, and using the definition of one sided limits to go about the problem, but I don't know how to proceed. Help please? Machine learning cookbook / reference card / cheatsheet? I find resources like the  and  incredibly useful. They obviously serve well as references but also help me to organize my thoughts on a subject and get the lay of the land.   Q: Does anything like these resources exist for machine learning methods?  I'm imagining a reference card which for each ML method would include:   General properties When the method works well When the method does poorly From which or to which other methods the method generalizes. Has it been mostly superseded? Seminal papers on the method Open problems associated with the method Computational intensity   All these things can be found with some minimal digging through textbooks I'm sure. It would just be really convenient to have them on a few pages. Code snippets for methods in Visual Studio Chain length. how long or how many links I measured from the middle of each sprocket and it's 17 inches. Not sure what length of chain I should get How can I stop being prompted to unlock the 'default' keyring on boot? Whenever Ubuntu boots up, a dialogue pops up asking me to unlock my default keyring. Is there some way this can unlock automatically through PAM or some other magical way? How to reshape data from long to wide format Is there a math basis for what I observe in simulations? diameter on a compact metric space I have troubles showing the following:  Let $(X,\rho)$ be a compact metric space and $F \subset X$ a closed subset. Prove that if diam $F &lt; \infty$, then there exist $x_{0}, y_{0} \in F$ such that diam $F= \rho(x_{0},y_{0})$.  It looks so trivial yet hard to find the trick. Getting disk i/o statistics for single process in Linux Considering the three types of Devil Fruits that has been explained are 1. Paramecia Type - where the user can get super human abilities and change their body parts into weapons, etc. 2. Zoan type - where the use can turn into a particular animal and inherit its abilities 3. Logia Type - where the user's body inherits a particular element and the body becomes like air which cannot be touched or damaged by non Haki users.  So what exactly is the type of Gomu Gomu no Mi? It cannot be Zoan or Logia. It's very close to a Paramecia but still doesn't have a logical explanation to be of Paramecia type! So is it some special type of Devil Fruit? Is GTA Online cross-platform? How does the Wizard spellbook work? How do I determine what spells are in my spellbook when creating a character? Do I simply have a spellbook with all Pathfinder spells? Or if I'm creating a level 6 wizard, do I start knowing all level 6 spells, and then have to learn the rest as I play the game? In classical logic, why is $(p\Rightarrow q)$ True if $p$ is False and $q$ is True? Provided we have this truth table where "$p\implies q$" means "if $p$ then $q$":  $$\begin{array}{|c|c|c|} \hline p&amp;q&amp;p\implies q\\ \hline T&amp;T&amp;T\\ T&amp;F&amp;F\\ F&amp;T&amp;T\\ F&amp;F&amp;T\\\hline \end{array}$$  My understanding is that "$p\implies q$" means "when there is $p$, there is q". The second row in the truth table where $p$ is true and $q$ is false would then contradict "$p\implies q$" because there is no $q$ when $p$ is present.  Why then, does the third row of the truth table not contradict "$p\implies q$"? If $q$ is true when $p$ is false, then $p$ is not a condition of $q$.  I have not taken any logic class so please explain it in layman's terms.       Administrative note. You may experience being directed here even though your question was actually about line 4 of the truth table instead. In that case, see the companion question  And even if your original worry was about line 3, it might be useful to skim the other question anyway; many of the answers to either question attempt to explain both lines. Wake-on-LAN quit working with latest kernel (Bionic) How to recover data from a USB-connected hard disk that shows no partition? How to understand the LaTeX warning “there were undefined references”? Do inequalities hold under differentiation? If I have the inequality $f \leq g$, does this imply $f'\leq g'$?  The reason I am asking is because I am using this fact to prove a question with Taylor theorem.