i'd like to setup phpmyadmin in Ubuntu without asking for parameters in prompts, i don't know if there's a way to pass these parameters in the command: sudo apt-get install phpmyadmin and give the options like the server type "apache2" and mysql admin password.  Thanks a lot.
How can i disable totally the prompts that appear while installing a Debian package, i've used all the options that i've found but there are some packages that are still prompting.  I'm using this command:  apt-get -y --allow-unauthenticated --force-yes -o DPkg::Options::="--force-overwrite" -o DPkg::Options::="--force-confdef" install x11-common   Why the x11-common package is still prompting? how can i get rid of these prompts?  Thanks in advance  --Victor  Edit: just to clarify, the prompts are not "yes/no" prompts, are open questions in a coloured screen (typical two color screen) but i want to set the default option of these questions
What is the name of this castle part? What's the current state of LaTeX3 (2020)? There are a few questions on this forum asking about why Latex3 is taking so long to come out. However, all of these are from the early 2010s. I'm just wondering what the current state of the project is and whether it's ready (or nearly ready) for prime time? Problem  The sequence $(a_n)_{n=1}^\infty$ is given by recurrence relation:   $a_1=\sqrt2$, $a_{n+1}=\sqrt{2+a_n}$.   Evaluate the limit $\lim_{n\to\infty} a_n$.  Solution   Show that the sequence $(a_n)_{n=1}^\infty$ is monotonic. The statement $$V(n): a_n &lt; a_{n+1}$$ holds for $n = 1$, that is $\sqrt2 &lt; \sqrt{2+\sqrt2}$. Let us assume the statement holds for $n$ and show that $V(n) \implies V(n+1)$. We have that $$a_n &lt; a_{n+1}.$$ Adding 2 to both sides and taking square roots, we have that $$\sqrt{2+a_n} &lt; \sqrt{2+a_{n+1}},$$ that is $a_{n+1} &lt; a_{n+2}$ by definition. Find bounds for $a_n$. The statement $$W(n): 0 &lt; a_n &lt; 2$$ holds for $n=1$, that is $0 &lt; \sqrt2 &lt; 2$. Let us assume the statement holds for $n$ and show that $W(n) \implies W(n+1)$. We have that $$0 &lt; a_n &lt; 2.$$ Adding two and taking square roots, we have that $$0 &lt; \sqrt2 &lt; \sqrt{2+a_n} &lt; \sqrt4 = 2.$$ The limit $\lim_{n\to\infty} a_n$ exists, because $(a_n)_{n=1}^\infty$ is a bounded monotonic sequence. Let $A = \lim_{n\to\infty} a_n$. Therefore the limit $\lim_{n \to\infty} a_{n+1}$ exists as well and $\lim_{n \to\infty} a_{n+1} = A$. (For $(n_k)_{k=1}^\infty = (2,3,4, \dots)$, we have that $(a_{n_k})_{k=1}^\infty$ is a subsequence of $(a_n)_{n=1}^\infty$, from which the statement follows.) We have that $a_{n+1} = f(a_n)$. That means that $A = \lim_{n\to\infty} a_n = \lim_{n \to\infty} {f(a_n)} = f(\lim_{n \to\infty} a_n) = f(A) = \sqrt{2 + A}$. Solving the equation $A = \sqrt{2 + A}$, we get $A = -1 \lor A = 2$. Putting it all together, we get that $A = 2$, because the terms of the sequence are increasing and $a_1 &gt; 0$.   Is my solution correct? How to get bright concert photos? I've been starting to shoot some live music recently and have been doing an okay job and see an improvement with each time I shoot. However recently I was shooting and all of my photos have come out very dark, too dark to use really. I was shooting in manual with 1/100 shutter speed aperture as wide as possible and a 6400 iso. Any advice is welcome. Thanks in advance. I would like to be able to render several files one after the other, when I am not using my computer, e.g. at night. Is there a way of doing this? I know that the movies were written to be a stand alone universe on their own, but what key elements were missing in the movies that were vital in the books that viewers are missing out on? How to show  tag literally in / tag? Is it safe to use a voltage divider for Arduino and DC motor controller? Careers ad asking if I want to work where I already work? While my code is compiling, I usually like to go through some reviewing and especially the late answers.  What I do see a lot in answers to old questions is the self-defense mechanism     ""   As if there is something fundamentally wrong with answering old questions. This leads me to two questions/thoughts:   Should we edit phrases like that out of the answer? (Given it's a good/valid answer to begin with, without any of the likely "old answer" problems. I realize the example linked to has its flaws.) Should we perhaps explicitly encourage answering old unanswered questions somewhere in the FAQ? (I'm unaware of any such recommendation, but might have read over it. Let me know if I did) I am curious how people picture geometrically how the covariant derivative acts with regards to vector fields. I understand that it is merely an object which has been defined for some use and obeys certain conditions but how would you picture such a thing geometrically? In other words, when someone asks you what the covariant derivative is, how do you explain it in absence of a formal definition? First, when I never had installed sl:  diogosaraiva@Ubuntu:~$ sl O programa 'sl' não está instalado actualmente. Pode instalá-lo escrevendo: sudo apt-get install sl   traslaction: "The program 'sl' is not currently installed. You can install it by typing:"  But when I'm tired of it and I remove it by typing sudo apt-get remove sl per example...  I get this when I type sl:  -bash: /usr/games/sl: Ficheiro ou directoria inexistente   translate: "-bash: /usr/games/sl: No such file or directory" instead of:    diogosaraiva@Ubuntu:~$ sl O programa 'sl' não está instalado actualmente. Pode instalá-lo escrevendo: sudo apt-get install sl   This appears with others packages too...  How I get rid of this: -bash: /usr/games/sl: Ficheiro ou directoria inexistente ?  I want see the original:  diogosaraiva@Ubuntu:~$ sl O programa 'sl' não está instalado actualmente. Pode instalá-lo escrevendo: sudo apt-get install sl   Output of type sl  sl está hasheado (/usr/games/sl) Let $({\Bbb R},{\mathcal A},\mu)$ be the measure space where ${\mu}$ is the Lebesgue measure.  Assume that $\int_{\Bbb R}|f|^pd\mu&lt;\infty$ ($p\geq1$). There is an exercise for proving that       $$\int_{[0,\infty)}pt^{p-1}\mu(\{x:|f(x)|\geq t\})d\mu(t)=\int_{[0,\infty)}\mu(\{x:|f(x)|^p\geq s\})d\mu(s).$$   If one formally let $s=t^p$, then $ds=pt^{p-1}dt$ and one would immediately get the equality above. However, how can I justify it rigorously in the sense of Lebesgue integration?    [Edited] What puzzles me is that I have the "change of variable" theorem for Riemann integration, but all the integrations here are in the Lebesgue sense. Unless one has shown that the integrands are also Riemann integrable, how can I directly use "change of variable"? Why are hard drives never as large as advertised? From all the hard drives I have bought, they never seem to be as large as the advertised size; from 320 GB down to 290 GB, from 500 GB down to 450 GB, etc. Is there a technical reason for this? Direct Link to a Comment Substitute for onions and garlic Equicontinuity on a compact metric space turns pointwise to uniform convergence I know that   If $\{f_n\}$ is an equicontinuous sequence,  defined on a compact metric space $K$, and for all $x$, $f_n(x)\rightarrow f(x)$, then $f_n\rightarrow f$ uniformly.  I'm having trouble proving this.  I see the same problem  but am having trouble following the proof, particularly with part (3).  Can someone guide me through a proof of this result? Why does Oracle 9i treat an empty string as NULL? A friend asked me to help her with her old iPhone 4 (she has upgraded to a 7). When I turn it on, it says, "iPhone is disabled" and "connect to iTunes."  When I do so, iTunes reports that it is locked with a passcode, and that I need to type that in to continue. However, the iPhone does not display a keypad or allow any sort of input.  Apple suggests the only solution is a wipe, but this will lose all of her photos.  Can photos be retrieved (at a minimum) from a disabled iPhone 4? Which Stack Exchange website for machine learning and computational algorithms? I'm currently working on many machine learning and computational algorithms, such as Singular Value Decomposition, Support Vector Machines, and others.  I'd like to ask questions about these topics, but I don't know which Stack Exchange website to use to post my questions.   Should I use ? Should I use ? Should I use ? Should I use ?   How do I tell?  What criteria do I use?