Dual-boot Ubuntu on MacBook Air
How do I find out which version and derivative of Ubuntu is right for my hardware in terms of minimal system requirements?
How to amplify 3.3V to 10V by using an NPN transistor? How to select resistor based on current, how does the amplification happen? example of compact operator Let $E=l^p=\left\{x=\left(x_n\right): x_n\in\mathbb{R}, \sum_{1}^{\infty}\left|x_n\right|^p&lt;\infty\right\}$ with $1\le p&lt;\infty$, $\left\|x\right\|_E=\left(\sum_{1}^{\infty}\left|x_n\right|^p\right)^{1/p}.$ Let $\left(\lambda_n\right)$ is a bounded sequence in $\mathbb{R}$ and consider the operator $T$ defined by $$T(x)=\left(\lambda_1x_x,\ldots,\lambda_nx_n,\ldots\right)$$ where $x\in l^p$. Prove that $T$ is a compact operator from $E$ to $E$ iff $\lambda_n\rightarrow 0$.  Can anyone give me some hints to solve this problem? Thank you! Find total number of relations that are equivalence as well as partial order set. Assume set contains total $n$ elements.     My attempt:  As equivalence relation has property reflexive, symmetric and transitive and POSET has property reflexive, antisymmetric and transitive.  Symmetric and antisymmetric will cancle each other except reflexive relation and transitive relation can case antisymmetric, so it's also absent on resultant relation.  Therefore, all diagonal element should be present to satisfy conditions of equivalence as well as POSET.  So, it's independent of number of total number of element of set and answer will be $1$.     Can you explain in formal way, please? What's the difference between a Long Term Support Release and a Normal Release? What are the differences between an Ubuntu Long Term Support release (LTS) and a normal release? BJT Astable Multivibrator I want to know how can I achieve this effect in LaTeX:    Basically it looks like this: {F}IRST {L}ETTER, where the letters in the braces are a little bigger than the other ones but they all the letters are uppercase.  Any suggestions? Let $X \subset L^1(\mathbb{R})$ a closed linear subspace satisfying \begin{align} X\subset \bigcup_{p&gt;1} L^p(\mathbb{R})\end{align}    Show that $X\subset L^{p_0}(\mathbb{R})$ for some $p_0&gt;1.$   I guess the problem is that in infinite measure spaces the inclusion $L^p\subset L^q$ only holds for $p=q$. Is it maybe possbile to apply Baire's Theorem in some way? The vast majority of intelligent species in the Star Trek universe are bipedal, humanoid creatures.  From the lot I've seen of TOS, TNG, DS9, Voyager, Enterprise, and the movies, it seems that this coincidence goes largely unquestioned.  Metaknowledge grants that it is much easier to have human actors portray human-like beings, and so this was probably done due to budgetary/technological limitations.  However, I'm wondering if an in-universe reason for this was ever given or explored? I'm going to submit form using cURL, where some of the contents is come from other file, selected using sed  If param1 is line matching pattern from other file using sed, below command will works fine:  curl -d param1="$(sed -n '/matchpattern/p' file.txt)" -d param2=value2 http://example.com/submit   Now, go to the problem. I want show only text between 2 matching pattern excluding the matching pattern itself.  Lets say file.txt contains:  Bla bla bla firstmatch It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout. secondmatch The point of using Lorem Ipsum is that it has a more-or-less normal distribution of letters, as opposed to using 'Content here, content here', making it look like readable English.   Currently, lots of "beetween 2 matching pattern" sed command won't remove firstmatch and secondmatch.  I want the result to become:  It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout. Combinatorial Proof for Binomial Identity: $\sum_{k = 0}^n \binom{k}{p} = \binom{n+1}{p+1}$ I am studying combinatorics and I came across the identity $$\sum\limits_{k=0}^n \binom kp =\binom {n+1}{p+1}.$$ I have read the algebraic proof and it does not appeal to me. Is there an elegant counting trick we can use to arrive at this identity? What is a good book to learn number theory? Measuring draw time of layer in ArcMap? I'd like to quantitatively measure the display performance of mosaic datasets, image service layers, raster layers, feature layers, etc. in ArcMap 10.  How can I measure the draw time of a particular layer (or the complete drawing process if that is the only option) in ArcMap? What are the interfaces, objects and events involved? Is the  class in .NET suitable for accurately measuring this type of operation?  Has anyone already created an ArcMap add-in or extension for this purpose? Disable the default app key (super+num) functionality on Ubuntu 17.10 and later I like to switch workspaces via Super+Number. But unfortunately the default behavior in Ubuntu for Super+Number is to select applications from the dock.   Is it possible to disable that functionality? I've tried overriding the keyboard shortcuts but it doesn't appear to be working. When I went to the review overview on Meta on 08.01.2015, 19:16, it listed two open items in the suggested-edits queue, however when I clicked on the queue, I was told that the queue had been cleared. When I went back to the review overview, however, the edits were there again.  Since the icons for recent reviews had not moved, I suppose that these were still the same two items waiting for review, and since phenomenon lasted for half an hour now, I would rule out  or  to be the reason for this.  After a while, the phenomenon ceased, with one new reviewer popping up in the icon list of recent reviewers.  I had not performed or skipped any suggested-edit review from the queue at that point.    A similar phenomenon occurred for several hours up to 11.04.2015, 11:05: The review overview showed two suggested edits and when I went to the suggested-edits queue, it was cleared. Sometimes, edits that I could review appeared, but two phantom edits remained. youtube-dl failed to extract signature It is considered very useful to utilize youtube-dl software for downloading youtubes.  A message is seen and it stopped working, which is following.  ERROR: Signature extraction failed: Traceback (most recent call last):   File "/usr/lib/python2.7/dist-packages/youtube_dl/extractor/youtube.py", line 479, in _decrypt_signature     video_id, player_url, s   File "/usr/lib/python2.7/dist-packages/youtube_dl/extractor/youtube.py", line 383, in _extract_signature_function     res = self._parse_sig_js(code)   File "/usr/lib/python2.7/dist-packages/youtube_dl/extractor/youtube.py", line 454, in _parse_sig_js     u'Initial JS player signature function name')   File "/usr/lib/python2.7/dist-packages/youtube_dl/extractor/common.py", line 391, in _search_regex     raise RegexNotFoundError(u'Unable to extract %s' % _name) RegexNotFoundError: Unable to extract Initial JS player signature function name; please report this issue on https://yt-dl.org/bug . Be sure to call youtube-dl with the --verbose flag and include its complete output. Make sure you are using the latest version; type  youtube-dl -U  to update. ; please report this issue on https://yt-dl.org/bug . Be sure to call youtube-dl with the --verbose flag and include its complete output. Make sure you are using the latest version; type  youtube-dl -U  to update.   What should I do to proceed? Find all $x$ such that $x^6 = (x+1)^6$. Concatenating two std::vectors I use Gingerbread.   My Android phone has feature, that turns off display during call when I put the phone to my ear. However, the sensor is probably over-sensitive in my device, so it often turns off during call even when I don't keep it next to my face.   This is an issue if I want to use keyboard during call when the screen turns off. Can I disable this feature? We know that any particle moving at speed of light will have infinite mass.  Since even Light has particles. Then what is the size of the Particle? How to imagine this with the mass of light particles. Show the title character limit when writing a title I just ran into this while writing .  [I originally wrote:     you need a minimum of X reputation to comment on questions that are not your own, and on answers that are not to your own questions   But had to shorten it to:     you need a minimum of X reputation to comment]   First, it didn't tell me that I'd gone over the character limit for the title until after I had already tabbed out of the title field.  Second, it didn't tell me how much I'd gone over or anything. I had to copy-paste the text I'd written into my text editor in order to get some real-time feedback on the exact character count, to help figure out how to best shorten it.