Ideally, I would like to specify architecture and Ubuntu version and download all dependencies for that package, then take them to another computer.    I know about apt-get download.... and that would work fine if the architectures and versions matched.  I do see an architecture modifier, but not a version modifier.  Any help, or pointing me toward how to accomplish this with aptitude or another package tool would be appreciated.  even if I could take one .deb to the target computer and list all concrete dependencies... that would really solve the problem.
I have a friend who has got a computer that is not connected to the Internet. Is there any way to install software offline easily?
Alternative set theories This is a (soft!) question for students of set theory and their teachers.   OK: ZFC is the canonical set theory we all know and love. But what other, alternative set theories, should a serious student encounter (at least to the extent of knowing that the theory exists, and about why it is thought interesting)?  Suggestions might be SP (Scott-Potter), NBG, NF, ZFA, IST, ETCS (for a few sentences of explanation, see   But what would be on your list of alternative set theories would be it good for advanced students to hear about, if only briefly? Algorithm for offsetting a latitude/longitude by some amount of meters Why separate Stack Exchange accounts? I understand the reason why Stack Exchange has different sites to separate  from  or . I understand too why the reputation is associated on each site.   Why do I have to create a new  for each web site? I know that when I create a new account, it is automatically associated to my other accounts. But, is there a reason why, when I originally create a user on the first site, I can't go on another site with this user? Present Perfect with the word "ago"? First, I check that my native language is not English, and the problem described below met on one of the exams.   With this sentence:      "The most important news is that my parents [...] a new restaurant a few   weeks ago."   Is the correct tense to use the Present Perfect (have opened) or Past Simple (opened)?   I know that the word "ago" but rather that time Past Simple, but is it also possible to use the present perfect in some cases?  I would be grateful for clarification. I just refreshed the [iphone]-tag-site, and I'm seeing all kinds of questions with what appears to be a grey overlay (see image). What is this for/why am I seeing this? I have never seen anything like this before.. Given a logarithm is true, if and only if, $y = \log_b{x}$ and $b^y = x$ (and $x$ and $b$ are positive, and $b$ is not equal to $1$), are true, why aren't logarithms defined for negative numbers?  Why can't $b$ be negative? Take $(-2)^3 = -8$ for example. Turning that into a logarithm, we get $3 = \log_{(-2)}{(-8)}$ which is an invalid equation as $b$ and $x$ are not positive! Why is this? Using `\input` to insert a section of a document into another I wanted to remove and reinstall the software-center package.  I removed it, but now I can't reinstall.  I tried these commands without success:  sudo apt-get update sudo apt-get install software-center   How can I reinstall software-center?    When I performed the install command this is what I got:  $ sudo apt-get install software-center Reading package lists... Done Building dependency tree        Reading state information... Done Package software-center is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source  E: Package 'software-center' has no installation candidate Why are pointers such a leading factor of confusion for many new, and even old, college level students in C or C++?  Are there any tools or thought processes that helped you understand how pointers work at the variable, function, and beyond level?  What are some good practice things that can be done to bring somebody to the level of, "Ah-hah, I got it," without getting them bogged down in the overall concept? Basically, drill like scenarios. Pronoun question: referring to inanimate objects as 'he' or 'she' I read the following claim concerning pronouns referring to inanimate objects:      Anything that is meant to contain you, protect you or provide you with something beneficial is [often referred to as] a she; anything that is a perceived threat is a he. That's why cars, boats and some countries are she.    Is this really the case, or is it just a subjective claim? (According to the  using he/she for inanimate objects is not recommended and it should be used instead.) Is there a 'rule' for determining whether to use he, she or it based on the impression one would like to express? (I only know the 'rule' for animals: In the case where you know their gender and they are important to you, you refer to them using he/she. E.g. A dog attacked me in the street. It bit me. versus This is my dog Roger. He is 7 years old.) Have these practices changed over time?   Note 1: There is already a similar question (), but that considers only the feminine case and none of the answers offers an objective discussion of the matter.  Note 2: My native language is Czech, where the gender of the pronoun is based only on the grammatical gender of the noun. E.g. a cat (kočka) is always she, a dog (pes) is always he, a boat (loď) is always she and a car (auto) is always it. Prevent browser caching of AJAX call result It looks like if I load dynamic content using $.get(), the result is cached in browser.  Adding some random string in QueryString seems to solve this issue (I use new Date().toString()), but this feels like a hack.   Is there any other way to achieve this? Or, if unique string is the only way to achieve this, any suggestions other than new Date()? Most MTP () devices show up in Windows File Explorer under their device name or a GUID, but they don't have a drive letter assigned.  How can I access the files on such devices from the command line? Using either cmd.exe or PowerShell. In which cases would you say, "I am seeing" instead of "I see"? In which cases would you say, "I am seeing" instead of "I see"? What is the proper usage of "not only... but also"? I'm trying to figure out how to use "not only... but also" properly. Basically, my goal is to combine two clauses by using "not only".  For negations, I've figured out two styles that both sound correct:   He knew that if he fractures his finger, not only would he not be able to compete in the water polo tournament, he would not be able to take the SAT on Monday, either. He knew that if he fractures his finger, neither would he be able to compete in the water polo tournament, nor would he be able to take the SAT on Monday.   However, I don't know how to form a sentence that does not include a negation while using "not only". Here are a few possibilities that I've considered:   Thanks to his remarkable performance on the SAT, not only was he accepted into Harvard, but he was also given a full scholarship. Thanks to his remarkable performance on the SAT, not only was he accepted into Harvard, but he was given a full scholarship. Thanks to his remarkable performance on the SAT, not only was he accepted into Harvard, he was given a full scholarship. Thanks to his remarkable performance on the SAT, not only was he accepted into Harvard, he was also given a full scholarship.   In those four possibilities, I'm varying the usage of "but" and "also" in the last clause.  What is the proper usage of "not only"? 1970s scifi/horror novel where protagonist is used by a crablike creature to feed its larvae, goes mad, and is defeated by retraumatising him I read this book once as a teenager, I think it might have been written in the 1970s but could be late 1960s or early 1980s.  The protagonist is left to die hideously by enemies. He is paralysed and left on some planet (I don't believe it was earth) in the habitat of some kind of crablike creature, which injects him with its young, and periodically returns to force nutrient and a paralytic agent down his throat, as the larvae grows inside him.  He is rescued, and his body rebuilt to some kind of superhuman abilities, but he is traumatised and bent on indiscriminate revenge for his suffering. He proves hard to defeat.   He is eventually defeated by trickery, when he is shown (or demands to see) something by some kind of video link or remote TV/monitor - perhaps he is told that people he wants revenge on, are held captive for him, I can't be sure.   I think maybe he takes hostages or makes a severe threat, and his demands relate to the people he wants revenge on. But he can't be physically reached, so what can be done?  They set up a video feed, to negotiate, or more likely, to purportedly show him they have what (or who) he wants, and he looks to see.  When he looks at the video stream, it's actually an image of the crablike creature. The shock of repressed memories flooding back, renders him re-traumatised and perhaps catatonic, and defeats him. I have attached an image as an example below. I want to twist a rectangle. Do I have to convert that rectangle into a curve or into mesh and then twist it with ctrl+T?   Please explain with an example. I have an Optimus Elite, and it has a minimum brightness setting. In certain apps, I can reduce the brightness below the safe minimum, but when I leave the app, the brightness is increased to the system-wide minimum.  Using , I can permanently set the brightness below the safe amount, and it will stay even after going to other apps. Or using , I can accomplish almost the same thing even without needing root (it displays a translucent 'filter' over the whole screen, reducing brightness/contrast but not actually changing the backlighting power amount).  What I want to know is where the minimum screen brightness is stored. I have a rooted phone with CyanogenMod 9, so I have permissions to edit anything and could change a config or sqlite entry, but I don't know where this value is stored. What I would like to do is use the status bar brightness slider to be able to slide to the actual minimum of the screen, rather than the OS-controlled minimum. Having an app is useful, but having the functionality without the app seems to be within reach, if only I knew where the OS is getting it's safe minimum setting.  Where is this "safe minimum brightness" setting stored? If I can change it, I can remove my apps and use native controls. How can I have a Linux machine join a Windows Domain? Sorry if I am misusing terms here; I actually don't know much about Active Directory and the related technologies.  Basically I have a Linux computer and I'd like it (or my user on that computer) to be associated with my user on the Domain, so that I can browse the network and all that stuff windows has.  Is this feasible?  What do I need to look into to do something like this? I'm having trouble understanding Cantor's diagonal argument.  Specifically, I do not understand how it proves that something is "uncountable".  My understanding of the argument is that it takes the following form (modified slightly from the  article, assuming base 2, where the numbers must be from the set $ \lbrace 0,1 \rbrace $):  \begin{align} s_1 &amp;= (\mathbf{0},1,0,\dots)\\ s_2 &amp;= (1,\mathbf{1},0,\dots)\\ s_3 &amp;= (0,0,\mathbf{1},\dots)\\ \vdots &amp;= (s_n \text{ continues}) \end{align}  In this case, the diagonal number is the bold diagonal numbers $(0, 1, 1)$, which when "flipped" is $(1,0,0)$, neither of which is $s_1$, $s_2$, or $s_3$.  My question, or misunderstanding, is: When there exists the possibility that more $s_n$ exist, as is the case in the example above, how does this "prove" anything?  For example:  \begin{align} s_0 &amp;= (1,0,0,\mathbf{0},\dots)\ \ \textrm{ (...the wikipedia flipped diagonal)}\\ s_1 &amp;= (\mathbf{0},1,0,\dots)\\ s_2 &amp;= (1,\mathbf{1},0,\dots)\\ s_3 &amp;= (0,0,\mathbf{1},\dots)\\ s_4 &amp;= (0,1,1,\mathbf{1},\dots)\\ s_4 &amp;= (1,0,0,\mathbf{1},\dots)\ \ \textrm{ (...alternate, flipped } s_4\textrm{)}\\ s_5 &amp;= (1,0,0,0,\dots)\\ s_6 &amp;= (1,0,0,1,\dots)\\ \vdots &amp;= (s_n \text{ continues}) \end{align}  In other words, as long as there is a $\dots \text{ continues}$ at the end, the very next number could be the "impossible diagonal number", with the caveat that it's not strictly identical to the "impossible diagonal number" as the wikipedia article defines it:     For each $m$ and $n$ let $s_{n,m}$ be the $m^{th}$ element of the $n^{th}$ sequence on the list; so for each $n$,      $$s_n = (s_{n,1}, s_{n,2}, s_{n,3}, s_{n,4}, \dots).$$      ...snip...      Otherwise, it would be possible by the above process to construct a sequence $s_0$ which would both be in $T$ (because it is a sequence of 0s and 1s which is by the definition of $T$ in $T$) and at the same time not in $T$ (because we can deliberately construct it not to be in the list). $T$, containing all such sequences, must contain $s_0$, which is just such a sequence. But since $s_0$ does not appear anywhere on the list, $T$ cannot contain $s_0$.      Therefore $T$ cannot be placed in one-to-one correspondence with the natural numbers. In other words, it is uncountable.   I'm not sure this definition is correct, because if we assume that $m = (1, \dots)$, then this definition says that "$s_n$ is equal to itself"&mdadsh;there is no "diagonalization" in this particular description of the argument, nor does it incorporate the "flipping" part of the argument, never mind the fact that we have very clearly constructed just such an impossible $T$ list above.  An attempt to correct the "diagonalization" and "flipping" problem:  $$s_n = (\lnot s_{m,m}, \lnot s_{m,m}, \dots) \quad \text{where $m$ is the element index and} \quad\begin{equation}\lnot s_{m,m} = \begin{cases}0 &amp; \mathrm{if\ } s_{m,m} = 1\\1 &amp; \mathrm{if\ } s_{m,m} = 0\end{cases}\end{equation}$$  This definition doesn't quite work either, as we immediately run in to problems with just $s_1 = (0),$ which is impossible because by definition $s_1$ must be $ = (1)$ if $s_1 = (0)$, which would also be impossible because...   Or more generally, with the revised definition there is a contradiction whenever $n = m$, which would seem to invalidate the revised formulation of the argument / proof.  Nothing about this argument / proof makes any sense to me, nor why it only applies to real numbers and makes them "uncountable". As near as I can tell it would seem to apply equal well to natural numbers, which are "countable".  What am I missing? Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s.  I know my base case:$$a_1 = 2$$ for either $1$ or $0$. Normally to construct the recurrent relation I would say fill in $n-1$ spaces then add a $1$ or $0$, which is simply:$$a_n = 2\cdot a_{n-1}$$However, I don't believe this is right, because this doesn't take into account that there can't be any consecutive $1$s.  Even when I use the base case of $2$ digits:$$a_2 = 3$$for either $01$, $10$, or $00$, I still get the recurrence relation of:$$a_n = 3\cdot a_{n-2}$$which also does not account for $01$ and $10$ occurring consecutively.   So how would I express this?