I do not want to install Processor microcode firmware for Intel CPUs updates even by accident (I am more than willing to take the security risk). How to disable it being offered in Software Update and how to make sure I am not accidentally installing it?
Can I configure Ubuntu to never install a specific package even if it is required by another package I install?
How do I install an SSH private key generated by PuTTYgen? Cleaning up factor levels (collapsing multiple levels/labels) If $X_n \stackrel{d}{\to} X$ and $c_n \to c$, then $c_n \cdot X_n \stackrel{d}{\to} c \cdot X$ Let $X_n$, $X$ random variables on a probability space $(\Omega,\mathcal{A},\mathbb{P})$ and $(c_n)_n \subseteq \mathbb{R}$, $c \in \mathbb{R}$ such that $c_n \to c$ and $X_n \stackrel{d}{\to} X$. Then $c_n \cdot X_n \stackrel{d}{\to} c \cdot X$.   Here is my proof: By Lévy's continuity theorem it suffices to show that $$\forall \xi: \quad \hat{\mu}_n(c_n \cdot \xi) \to \hat{\mu}(c \cdot \xi) \qquad (n \to \infty)$$  where $\hat{\mu}_n$ (resp. $\hat{\mu}$) denotes the characteristic function of $X_n$ (resp. $X$). Using the tightness of the distributions one can show that $\{\hat{\mu}_n; n \in \mathbb{N}\}$ is uniformly equicontinuous. We have $$|\hat{\mu}_n(c_n \cdot \xi) - \hat{\mu}(c \cdot \xi)| \leq |\hat{\mu}_n(c_n \cdot \xi)- \hat{\mu}_n(c \cdot \xi)| + |\hat{\mu}_n(c \cdot \xi)- \hat{\mu}(c \cdot \xi)|$$ The first addend converges to zero as $n \to \infty$ by the uniform equicontinuity and the second one converges to zero since $X_n \stackrel{d}{\to} X$.  I was wondering whether there is an easier proof - my own proof seems rather like overkill to me. Thanks! This is a general, community wiki  question and answer pair intended to address any questions   concerning the reasons a site or specific site contents do not appear   in search engine results.      If your question was closed as a duplicate of this question and you   feel that the information provided here does not provide a sufficient   answer, please open a discussion on .   My site (or specific pages on my site) is not appearing in search engine results.  Why isn't my content indexed and what can I do about it? How to Avoid Precision Errors While Creating Numpy Arrays? Categorical Principal Component Analysis - using Count, Continuous, Ordinal variables together I have some variables and I want to reduce their number for further analysis. I initially thought of combining them using factor analysis. But since the variables are of all kinds (rating, count, ordinal, continuous dollar amount) I am thinking about using CATPCA for it. However, I have some questions about the technique -   Is CATPCA the right approach or Latent Class Factor Analysis would be the better one? By using the different kinds of variables together - how will the object scores be interpreted? For example - The rating question is on a 10 point scale but the dollar amount ranges from 0 to 1000s, so what will the object score obtained after CATPCA represent? And is it comparable to the Factor Score obtained from traditional PCA? For ordinal variables - Do all of them need to be in the same form, e.g. 1 meaning lowest and 10 meaning highest? Or can they be used in whatever form they are? Is it good to categorize the count and continuous variables based on their distribution and then treat then as ordinal/categorical variables?   I would highly appreciate any help you can provide! How many ways to arrange people on a bench so that no woman sits next to another woman? How to avoid "completely" dark shadow using directional light (as Sun) ? Look at my scene:     Sun is rising and as you can see the scene is realistic; I mean, that what is in shadow is almost completely dark. This is correct, but i would like something less "dark", like an HDR.  These are some parameters i'm using:     This is my unique Light in scene (Sun):     I'm using also a Post-Processing profile with "Eye Adaption" unflagged.  Can you suggest me what i've to change to make my object affected by shadow less.. dark ?   Thanks Question about the order of the product of two elements in an abelian group My reference for learning abstract algebra says that in an abelian group $G$ the product of two elements (say $a$ with order $n$ and $b$ with order $m$) has order $mn$ if $gcd(n,m) = 1$.   What I don't understand is where the $gcd(m,n)=1$ comes into use in proving this fact? For example, $ a^{mn} = (a^n)^m = (e)^m = e$ (identity element). A similar argument for $b^{mn}$ together with the fact that $G$ is abelian is enough to show that $(ab)^{mn} = e$. From here, how do I conclude for an integer $r &lt; mn$ that $(ab)^r \neq e$  Also, are there any other conclusion that can be drawn if $gcd(n,m) \neq 1$ ?  Thanks for any feedback in advance ! Error to calculate date diff with DateTime class How can I install a Canon printer or scanner driver? Prove that there exists such a set of $n$ positive integers Prove that for any positive integers $m$ and $n$ , there exists a set of $n$ consecutive positive integers each of which is divisible by a number of the form $d^m$, where $d$ is some positive integer not equal to $1$.  I don't know how to approach this question. Ubuntu 16.04 LTS Virtualbox 5.0.40 ubuntu r 115130  Today after upgrading to kernel 4.13.0-26 guest vbox machines started to crash whole ubuntu. just hard poweroff is working.  If I startup with kernel 4.10.0-42 everything works fine.  what may be the problem ? Someone has asked for answer to these topics. However, I still want someone to provide me with simple and universal answers. I recently read a sentence from the English-speaking person. It is in an article. It is, ' The available options for mitigating pad cratering are not universally effective (see link below), but they may be helpful on a case by case basis until more crack resistant laminates are developed and become available.  '  If I am to write this, I will use 'a case-by-case basis until more crack-resistant laminates'   Can anyone tell me when to use a hyphen to coin a new word? Is "has or will read" grammatical? I just wrote  in an ELL chat room. But looking at it (or more accurately, listening to my "inner voice" trying to "read it aloud"), I find it bothers me a lot.  A quick check on Google Books finds a claimed 432 written instances of , and 910 instances of , which suggests a significant minority of writers don't have a problem with the fact that the two different read's don't sound the same.  When I check the same construction with other verbs that don't have the same written form for past participle and present tense, it seems people nearly always include both (e.g. :1230, :8; :357, :7).  I'm not usually a big fan of "grammatical rules", but it seems to me there "ought" to be a rule that you shouldn't delete one instance of the verb unless it's "the same" as the one you're keeping. And it also seems to me that since language is primarily spoken, "the same" ought to mean "sounds the same when spoken", not "looks the same when written".  Can anyone who knows more than me about formal rules of grammar settle this one?    As an aside, offhand I can't think of any verb where the past participle and present tense sound the same but are written differently (maybe there aren't any), but would deletion be okay in that case? How do I get the source code for eglibc in a format that will allow stepping through the source with gdb?    I have tried using apt-get source libc6-dev and that works for getting the source code, but I think that since the pre-processor directives were not applied that the line numbers that gdb has does not match with the source I downloaded. This makes it less useful when trying to step through the source and look at how functions in libc are working. Crossbow Expert Feat... for Spells? I was thinking about creating a wizard character. Reviewing the spellcasting rules, I saw this:  Most spells that require attack rolls involve ranged attacks. Remember that you have disadvantage on a ranged attack roll if you are within 5 feet of a hostile creature that can see you and that isn't incapacitated (see chapter 9).  There are a lot of occasions that might arise that would make this a problem, or at least a bit of a hindrance. So as a D&amp;D player normally would when they wanted to break a rule without actually cheating, I went to a list of feats and found Crossbow Expert:  Thanks to extensive practice with the crossbow, you gain the following benefits: You ignore the loading quality of crossbows with which you are proficient. Being within 5 feet of a hostile creature doesn't impose disadvantage on your ranged attack rolls. When you use the Attack action and attack with a one handed weapon, you can use a bonus action to attack with a hand crossbow you are holding.  I may be (am) overthinking things, but does this apply to magic attacks, such as cantrips like Eldritch Blast or Fire Bolt? The literal meaning of the feat says that I can, but it could also imply by the title and also the effects of the feat that this only applies to crossbows, or any other ranged weapon, excluding magic. The strongest evidence that it might not affect ability with ranged magic attacks is:  Thanks to extensive practice with the crossbow  With a crossbow, not with magic. How to get the list of IP addresses in a LAN? Prove that 10101...10101 is NOT a prime. So basically we have a number $10101...10101$ that contains $2016$ zeros and can be written as$ \sum _{ k=0 }^{ 2016 }{ 100^{ k } }$ . I want to prove that this number is not a prime without using anything besides a piece of paper and a pen. I'm stuck on this for quite a few days now. Stop PDFs from displaying inside Google Chrome When I click on a PDF link in Chrome, it opens automatically inside the browser window. How can I get it to download instead and open with an external viewer?  Update: I implemented djhowell's solution but Chrome still seems to be handling PDF files differently from regular files. When I click a PDF link it opens in Adobe Reader, but normally files download to a folder first.  I also find it weird that this is controlled by Reader and not Chrome. Are there not any file-type controls in Chrome anywhere?