I tried Googling and haven't been able to find anything reliable that shows me how to generate the CSR. I have multiple domains, that I'd like added so I can't use the usual OpenSSL wizard:  *.domain1.com *.domain2.com   How can I get this generated?
This is a school-network.  Official (outside reachable domain name) is  bgschwechat.ac.at (www.bgschwechat..., mail.bgschwechat... and ftp.bgschwechat..)  Internally the windows domain is named bgs.ac.at  We need (possibly cheap) SSL certificates for Webserver and Exchange-Server  From our firewall (www.bgschwechat.ac.at) (Sophos UTM9) requests get NATed to virtual machines - some of them need SSL   Webserver (running CENTOS - www.bgschwechat.ac.at) Exchange Server (named xch.bgs.ac.at) should be reachable via NAT as mail.bgschwechat.ac.at WSUS Server (dc2.bgs.ac.at) - only for internal clients   My question: What kind of SSL-Certificate would we need to secure eg. both domains (bgschwechat.ac.at AND bgs.ac.at) so that they appear secured from outside when NATTING for example mail.bgschwechat.ac.at to xch.bgs.ac.at ?  Or do we need to rename the interior domain to the official domain name?  ...recommandations where to purchase such certificate?
Total combinations from number of unique combination? How can you find count of the total combinations possible if you have the count of unique combinations? Suppose I need to form a sum of $3$ using $\{1,2\}$ Unique combn. $(1+1+1)$, $(1+2)$ hence '$2$' unique but total is '$3$' i.e, $(1+1+1)$, $(1+2)$, $(2+1)$ I know the elements used to make the combination Note: Number of unique combinations (ie. 2 here) is known. How can I find the total number of combination given the unique combinations? Present and future of bots on Stack Exchange There are discussions on Meta already for some time now about the potential usage of bots on Stack Exchange (SE). The earliest I could find goes back to  , but there have been others , .  Here’s an  about having a bot that tries to answer “easy” questions. The scenario is that (almost) duplicate, simple questions are asked time after time, despite SE’s efforts to prevent this by listing related questions at posting time. This is where the bot could be of service: it could quickly retrieve and post an answer from a previous duplicate (or with smarter Artificial Intelligence - AI)  even from elsewhere on the web, like a user manual or a mailing list discussion). I imagine this might save some review time for moderators, and perhaps users would also enjoy not having to answer over and over again to the same question. Besides, answers would be very fast, which should make everyone happy if they are also of good quality.  This idea of “janitor” bots can have more use cases besides answering “easy” questions (see also discussion ), like suggesting missing tags and re-formatting what should have been code blocks, to name a few.  Yet, despite a long time since these discussions, better Machine Learning Classifiers (ML) and AI over the years, and   , it doesn’t seem that any such bots are among us (except maybe ). As part of a research project at the university, I am trying to understand why this is the case.  For this reason I’d like your opinion on the following:   Do you consider a bot “harmful” for the SE communities?   If yes, would you consider the bot harmful even if   it operates in an automatic manner only in limited scenarios (e.g. specific tags) it operates in a semi-automatic manner (namely with the supervision of a moderator who decides for posting or not the answer).  it operates only for a limited amount of time in a small community (e.g. here).   Would you consider it too risky to give a bot a try? Would you accept an answer provided by a bot?   If not, why ? (e.g. you don’t trust replies from machines)  Would you consider useless a “sloppy” answer by a bot, even if it is provided in just a few seconds? Answers may be not perfect, but they may link to other relevant threads that can help the asker to fix the problem without waiting extra time for a human response. Placing null at the end of the List Sum of binomial coefficients with index divisible by 4 I am trying to obtain a closed form expression for  $\sum {n \choose 4k}$  I am trying to use the binomial expansion of $(1 + i)^n$ and $(1 - i)^n$. $$(1 + i)^n + (1 - i)^n = 2\left(\sum {n \choose 4k} -\sum {n \choose 4k + 2}\right)$$ Stuck at this now. I can't come up with a way to simplify the second term on RHS. Any help would be appreciated. launch a VM on Ubuntu On Ubuntu 14.04, I installed VirtualBox on which I have created 2 Ubuntu virtual machines.  Does Ubuntu provide a way to launch  the virtual machine I want at a particual moment ? Is there any solution for this problem by developing a .sh script for example or using any other programming language ? There are no book recommendations for Astrophysics here. I will write my own answer, but I am also interested in what are others' views on the question (I will NOT mark my own answer as the best one). These are my current disk partitions. /yedek is for some personal backup files. As you can see there is only Ubuntu on my PC. I will install Windows, too. Because of this I want to shrink /dev/sda3 . It currently 546GB and I want to split it: 300GB for / and 246GB for Windows (NTFS) is OK for me.  I'm using GParted for the first time. How can I shrink /?  I don't want to lose any datas from Ubuntu. Install python packages for specific python version I understand that in Ubuntu 14.04, you have access to both python 2.7.6 and python 3.4.0. When getting python packages through the command line, how do I make sure that I am installing packages meant for python 2.7.6 and not for python 3.4.0? How to gather full network usage statistics on a freebsd router? I have a freebsd box, which serves as a router from LAN to the outside world. It has several Internet providers, OpenVPN servers and clients, NAT and so on.  I would like to have complete statistics on when, who, to whom, via which provider, via which protocol, and how many bytes have been sent.   I agree that the minimal time scale will be an hour, i.e. no need for millisecond precision.  I tried vnstat2, ntopng and some other programs, but they don't seemed to have what I need or it is not obvious.   I don't understand, why this feature is not easily available. But I am not good in freebsd, so please, give me some clues. I couldn't find much on the new Lucene-based search, and don't know much about the engine in general, so I'm asking this question.  Does anybody have a description of how search results are ranked?  Does the rank calculation include:   rep of post's author? views? unique referers? PageRank of referers? rank of questions that link to the post? whether a question is closed? vote count? answer count? How are large amounts of money expected to be made during the early parts of the Waterdeep: Dragon Heist adventure? How do I write an Apex unit test? This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, including more unit test resources, navigate to the  tag.  This canonical question is intended to address several classes of common questions by providing a quick summary and links to comprehensive resources:   How do I start writing my first unit test?  How do I unit test this code?  I need help writing this unit test.   Salesforce Stack Exchange looks for detailed, specific questions that the community can help you with, and can't write tests on your behalf. We feel that working with the resources below can help you get started, and we encourage you to make an attempt to write your test and return to SFSE with your specific questions when you encounter challenges you can't resolve. How does Newtonian mechanics explain why orbiting objects do not fall to the object they are orbiting? Is there a proper way to handle large combat engagements with party members involved? For instance, a party of four player characters raise a force of 30 militia men to go take a bandit camp. When they get there the bandit camp has 40 men, and none of them notable.  For the sake of simplicity, both the 30 men and the 40 bandits are armed with long swords, and wearing leather armor.   Is there a proper way to handle combat between the 30 man militia and the 40 bandits while also incorporating our four player characters? If no "proper" way exists, is there a generally accepted "best" way? In a document I'm writing, I'm using the familiar  option for my floating tables, and I  them. I'd like to avoid repeating that every time I'm creating a table. I assume it's easy to add something in my preamble that makes sure that these two options are used every time I begin a new table environment?  \documentclass{article} \begin{document} \begin{table}[hbt] \centering \begin{tabular}{*3{l}} 1 &amp; 2 &amp; 3\\ a &amp; b &amp; c\\ \end{tabular} \end{table} \end{document} It seems Microsoft has tried to solve this problem .  In Windows 7, there is no boundary between monitors and the mouse can move freely across the top of the screen between my 3 monitors, provided I had set their heights equal in display settings. Windows 8 introduced sticky corners. See .  Windows 10 got sticky corners as well. There are a few pixels at the top corners of each display where the mouse cannot cross over onto the other display. One must move the cursor down to avoid this region in order to get to the next display.  The image shows roughly the region where mouse movement is not permitted in Windows 10, but is allowed in Windows 7.    Personally, I had no problem with unrestricted mouse movement across the top of my screens - I got used to "aiming" for the x, and the convenience of unrestricted cursor movement. Like all the people who wanted to disable it in W8, I'm wondering if there is a way to disable it in W10.  Edit to address possible duplicate:  Although the problem is identical to the one in , solutions to solve the problem in W8 involving editing the registry key MouseCornerClipLength do not work in W10, since that registry key is not present in W10. Also adding that key and setting the value doesn't work. I searched the entire registry and couldn't find it in another location. No other W10 keys in the node referenced in the W8 solution are obvious replacements.  Edit to address possible solutions in comments  harrymc's  and  that worked for for Windows 8.1 do not work in Windows 10. Jointly Complete Sufficient Statistics: Uniform(a, b) Let $\mathbf{X}= (x_1, x_2, \dots x_n)$ be a random sample from the uniform distribution on $(a,b)$, where $a &lt; b$.   Let $Y_1$ and $Y_n$ be the largest and smallest order statistics.  Show that the statistic $(Y_1, Y_n)$ is a jointly complete sufficient statistic for the parameter $\theta  = (a, b)$.     It is no problem for me to show sufficiency using factorization.   Question: How do I show completeness? Preferably I would like a hint.    Attempt: I can show $\mathbb E[g(T(x))] = 0$ implies $g(T(x)) = 0$ for the one parameter uniform distribution, but I am getting stuck on the two parameter uniform distribution.   I tried playing around with $\mathbb E[g(Y_1, Y_n)]$ and using the joint distribution of $Y_1$ and $Y_n$, but I am not sure if I am going in the correct direction, as the calculus is tripping me up. I have some files with TikZ graphics that have suddenly changed appearance since I upgraded to PGF-2.10.  Here is a minimal example:  \documentclass{minimal} \usepackage{tikz} \begin{document} \pgfversion\par \begin{tikzpicture} \draw[blue] plot[domain=-1:1] (\x,{\x^2 + \x^3}); \draw[xshift=4cm,blue] plot[domain=-1:1] (\x,{(\x)^2 + (\x)^3}); \end{tikzpicture} \end{document}   In PGF 2.00 I had this:    while in 2.10 I have this:    The one on the left in PGF 2.10 looks like the graph of y=x^3 but could also be y=x^3 + x|x|.   This has been  on sourceforge and  on the pgf-users mailing list.  Although I haven't checked myself yet, the bug remains open and some of the commenters below report that problems still exist in the CVS version.   Geoffrey Jones notes the bug is in the 2.00 CVS version:     Hi Matthew, not an answer, just an FYI   that's too large for the comment box.   My compile of your code through pgf   v2.00 produces the result you see with   v2.10, above:       I.e., the difference you observe seems   to pre-date v2.10.   There is a workaround by inserting parentheses.  But since I have so many old lecture files I'd rather find a solution that doesn't involve rewriting my TikZ code.  And I'm squeamish about using the CVS bleeding edge code even if it were fixed, since I don't want to introduce other problems.  Ideally I'd like a simple patch that I can stick at the preamble, or just fix one file in the PGF distro. Do messages from feeds prevent freezing/deleting a chat room? Convergence of Ratio Test implies Convergence of the Root Test In Elias Stein and Rami Shakarchi's Complex Analysis textbook, we have the following exercise:     Show that if $\{a_n\}_{n=0}^\infty$ is a sequence of complex numbers such that $$\lim_{n\to\infty}\frac{|a_{n+1}|}{|a_n|}=L,$$ then $$\lim_{n\to\infty}|a_n|^{1/n}=L.$$    I've been trying to prove this with no luck. The only thing I've thought of doing is $$\lim_{n\to\infty}\left(\frac{|a_{n+1}|^n}{|a_n|^n}\right)^{1/n},$$but this hasn't lead me anywhere except dead ends. Will someone provide a hint for me about how to proceed? Thanks!  Minor update: I don't know if it's helpful yet, but I know we can write the limit as $$\lim_{n\to\infty}\left(\frac{|a_{n+1}a_n\cdots a_0|}{|a_n\cdots a_0|}\cdot\frac{1}{|a_n|}\right).$$This reminds me a lot of the geometric mean, which even has the exponents I'm trying to get...