What is the formula of the finite population correction factor?
Explanation of finite correction factor
Analytic continuation of function continuous on boundary Suppose one has a function $f$ in the disc algebra ie: $f$ is continuous on $|z|\leq1$ and holomorphic in $|z|&lt;1$. I wondered, can $f$ always be extended to a holomorphic function on some region containing the boundary (ie: $T$ the unit circle). If not can you give me an example? Thank you, How to fix "-5 No address associated with hostname error" while updating? (Last Jedi spoilers ahead, if you haven't seen the movie, please don't read on.)  So, fridge logic moment for me:      If Vice Admiral Holdo had told Poe Dameron about the plan to just hold on long enough to make a covert run to Krait, then Poe wouldn't have felt the need to send Finn and Rose on their little side-trip, and the code-breaker wouldn't have overheard anything nor sold them out, and the First Order would've had no reason to notice the cloaked ships.   I do understand that there's a lesson in there about following orders, even if said orders come from a pretty face in a pretty dress, but that's kind of an out-of-universe reason. What was Holdo's reasoning? Surely she knew enough about Poe to realize that treating him like a mushroom1 would not result in anything good.  1 "kept in the dark and fed shit" Storage for Eldritch Horror Is there an optimal strategy for storing Eldritch Horror cards and tokens so that game play is facilitated.   I am not looking for answers that including "zip bags" and other things to keep the game element safer while is storage. Although, a strategy that works well for both cases will clearly be superior to one that only works for game play.  I am not limiting this to commercial solutions. I am quiet happy to build your custom made solution if you release the specification/plans of course!  Although, it it requires a 3D printer, more power to you. There is a very bad problem with the "Blank screen" function in Ubuntu 17.10. I refer to the setting accessed via Settings->Power->Blank Screen. This seems to actually perform a screen lock, since I need to enter my password after un-blanking the screen. (However, given the behavior described below it's not clear exactly what this function actually does - maybe it just logs you out? maybe it reboots the machine?)  The problem is that a simple screen lock, which one would expect to lock the screen without affecting the state of any applications, in fact closes all applications that are open when the screen lock activates. In other words, if you have the screen lock set to 5 minutes, and you walk away from your machine to get a sandwich or whatever, when you come back and unlock the machine all your apps have closed without saving their state. So far, the only work-around I have found is to entirely disable screen locking in Ubuntu 17.10. My question is, how can this be fixed so that screen locking works properly - that is: the screen locks on schedule after a period of inactivity, and when unlocked all applications that were running are still running?  I am asking a new question for the following reasons:  1) The existing answers to (and comments on)  do not address the issue, and in fact misrepresent the actual problem in ways that make me think the comment writers have not understood what is happening;  2) I cannot usefully address that question because I do not have sufficient reputation to either upvote the question or comment on it, and I cannot answer the question because I have no idea why this problem occurs;  3) I will probably never achieve a reputation of 15, much less 50, on StackExchange. Which is fine, that's not among my life goals.  4) But this question is important and deserves to be addressed. It is a drastically unacceptable bug. With powershell get exactly the same application list as in Add/Remove programms There are various methods to find installed applications on the system but to my knowledge none returns exactly the same list as control panel item Add Remove Programs. Some of the ways I tried are:   WMI via Win32_Product and Win32Reg_AddRemovePrograms Registry, both x32 and x64 branches   For instance, I have 217 entries in AR and   gwmi  Win32_Product   returns 261 items.  gp HKLM:\Software\Microsoft\Windows\CurrentVersion\Uninstall\*, HKLM:\SOFTWARE\Wow6432Node\Microsoft\Windows\CurrentVersion\Uninstall\* | ? {![string]::IsNullOrWhiteSpace($_.DisplayName) } | select DisplayName   returns 119 items.   (gwmi Win32Reg_AddRemovePrograms) + (gwmi Win32Reg_AddRemovePrograms64) | sort DisplayName -Unique    returns 107 items.  I tried to nail it down with more complex filter that included InstallLocation, InstallSource, InstallDate etc without success. Log4j Logging to a Shared Log File Is there a way to write log4j logging events to a log file that is also being written to by other applications. The other applications could be non-java applications. What are the drawbacks? Locking issues? Formatting? Similar Matrices and Linear Transformations How do I install and manage GNOME Shell extensions? How to make a persistent live Ubuntu USB with more than 4GB Referring to correctly-styled algpseudocode procedure name in document Given an algorithm written in algpseudocode:  \documentclass{article} \usepackage{algorithm} \usepackage{algpseudocode} \begin{document} \begin{algorithm}   \caption{Part 1}   \begin{algorithmic}[1]     \Procedure {FooProc}{$G$}       \State ...     \EndProcedure   \end{algorithmic} \end{algorithm} \end{document}   How can I now refer to FooProc in my document (outside of the algorithm environment) such that it has the same typeset as in inside the algorithm environment? I am a US citizen and have recently visted the UK  with simply a passport which allowed me to vist for 6months I have heard rumors that I am obligated to stay in the US for a Equal amount of time that I have visited the UK before I am able to return, but I am struggling tour no any proof of this obligation .. Am I missing somthing or is it simply not true How can I tell hotels exist that aren't on the booking web sites? There are a ton of sites out there to help book hotel rooms and to aggregate all the different sites to book hotel rooms. These companies make enough money to buy ads on TV, so I won't name them here. I normally poke around 3 or 4 of these as part of planning any trip.  I am now starting some very long term planning for a 6 week South Pacific trip, which includes undertstanding what hotels costs on some very small islands. I have paper guidebooks and I've been looking online. But I come across anomalies. For example, a place which has only 9 hotels listed on the sites I use, and prices range from $1000/night down to $200/night, then when I read the reviews on that cheapest one people are saying "it's nothing special, there are 5 or 6 places just like it here for half the price". Well, not on this site there aren't!  My guess is that many of these places don't have web sites, or don't have online booking, and therefore aren't getting into the aggregators. For some islands I have found local tourism boards with lists of "pensions" and such, typically cheaper than what I can find on the aggregators.    But how can I know? I don't want to assume that popular web sites represent reality, and choose only from places listed there. But I don't want to invest 10-20 hours of research per island only to discover the aggregators had everything. How can I know where the coverage is good and where it isn't, what kinds of hotels are more or less likely to be listed at expedia, trivago, booking, hotels, tripadvisor, and the like? (For example, I don't want to stay at a hostel, so I don't mind if they're not included in online sites.) Are there sites like wikitravel that list places without much of an internet presence?  I'm starting my research over a year before the trip, but wading through hotel pages is not the fun part of the planning so tell me how the smart people do it. How should the "and/or" text of a card be interpreted? How should the "and/or" text of a card be interpreted? For example on a card like  the text reads:     Nahiri's Wrath deals damage equal to the total converted mana cost of the discarded cards to each of up to X target creatures and/or planeswalkers.   For the remainder of this question, let's fix X at 2 to keep things simple.  Should the "and/or" be interpreted such that the effect is applied to a combination of targets the player chooses. That is to say for Nahiri's Wrath the player could perform one of the following options:   Nahiri's Wrath deals damage to each of two target creatures. Nahiri's Wrath deals damage to each of two target planeswalkers. Nahiri's Wrath deals damage to each of one target creature and one target planeswalker.   Or should the card's effect be expanded and applied to both sides of the "and/or". With this interpretation the player would have to the following two options when playing Nahiri's Wrath:   Nahiri's Wrath deals damage to each of X target creatures and Nahiri's Wrath deals damage to each of X target planeswalkers Nahiri's Wrath deals damage to each of X target creatures or Nahiri's Wrath deals damage to each of X target planeswalkers   The confusion stems from  (which was formerly formerly worded using the same phrasing) where some commenters have said things like:     So this lets you do a total of 12 damage? 3 each to 2 target creatures AND 3 each to 2 target players, one of which could be a planeswalker? That's how the "and/or" works, right? You can choose. Otherwise it would just be "or"... Terminology of the sequences of promoters in relation to DNA strands I'm studying molecular biology and I'm trying to understand an experiment which shows the importance of promoters in the relative transcription level (RT). The image below comes from Rolf Knippers' book "Molekulare Genetik" (8th edition).    The legend says (among other things):     Die erste Zeile gibt die normale "Wildtyp"-Sequenz der 5'-flankierenden Region wieder.   Which, in english, means something like:     The first line repeats the normal wild-type sequence of the 5' flanking region.   The column on the right gives the relative transcription (RT) level, 1.0 being the highest possible level of transcription. As we can see, the lines where some parts of the "5' region" have been deleted give quite low RT levels, since some regions of the promoter are missing.  My questions are the following:  1) According to  and , I understand that RNA polymerase reads and uses both coding and non-coding strands in order to synthesize RNA. Therefore, how did they manage to use the sequences strands regions had been deleted to make a polymerase "read them" and perform transcription?  2) If the polymerase reads the template strand in the 3' -> 5' sense, shouldn't we talk of "ATAT box" or "TAAC box" instead of "TATA" or "CAAT" boxes? Does it mean that the "promoter" regions they are using on the graphic above are actually on the coding strand?  Thanks a lot for your help. Can not update Bash on Debian 6.0 (Squeeze) I can not update  on a Debian 6.0 (Squeeze) server to get rid of the discovered vulnerability:  bash --version GNU bash, version 4.1.5(1)-release (x86_64-pc-linux-gnu)  apt-get update apt-get install bash Reading package lists... Done Building dependency tree Reading state information... Done bash is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 7 not upgraded.   Can I use Squeeze-LTS for this server just to update Bash? After one week I will be on another server, so I will not make any other updates.  uname -m x86_64  lsb_release -a No LSB modules are available. Distributor ID: Debian Description:    Debian GNU/Linux 6.0.5 (squeeze) Release:        6.0.5 Codename:       squeeze A (highfalutin) word for a highfalutin word? To illustrate the question, badroit used the word "meretricious" meretriciously.   Is there an English word that describes highfalutin words like "meretricious" that are (gratuitously) used in place of better-understood words like "garish"?  The word may or may not be self-describing. How to calculate the prediction interval for an OLS multiple regression? What is the algebraic notation to calculate the prediction interval for multiple regression?  It sounds silly, but I am having trouble finding a clear algebraic notation of this. 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? Relation between AB and BA Let $A$ and B be $n\times n$ matrices over a field $F$. Then prove or disprove  $(i)\, AB$ and $BA$ have same characteristic values.  $(ii)\, AB$ and $BA $ have same characteristic polynomial.  $(iii)\, AB$ and $BA $ have same minimal polynomial.  Proof of $(i)$   Let $c$ be an eigen value of AB and v be corresponding eigen vector. Then    AB(v)=cv,    B(ABv)=B(cv),    BA(Bv)=c(Bv),   this implies $Bv$ is an eigenvector of $BA$ corr. to eigen value $c$.  But this statement holds if $Bv$ is nonzero.  What if $Bv=0$?  $(ii)$ If $A$ is invertible then ($A$ inverse)$(AB)A= BA$, i.e. $AB $ and $BA$ are similar and hence have same charateristic polynomial.   Similar proof when $B$ is invertible.  But what if both $A$ and $B$ are not invertible?  I have no idea about $(iii)$.  Please help me to complete these proofs.