I'm looking to create a 180° spiral staircase with a step width of 1.28m; step height of either 16cm or 8cm, and step depth of 32cm (inner) and 64cm (outer). This model will be inside, thus the player shall never see its backfaces. How can I make this model with exact measurements? I ask because I hate curves.   Any help would be much appreciated ♥
I would like to create a half-turn staircase without a landing. Is there an easy way to accomplish this without having to manually calculate and create each step individually?  Here’s an image similar to what I would like to achive:    I have found the Archimesh add-on including . While I can bend the created stairs, I haven’t found any way to get anywhere close to the image above. My stairs just always look out of shape and I don’t know how to get the outline of the staircase into a square.  I should mention that I only have very little experience with Blender modeling, so it’s well possible that I’m just missing some curve modification basics. Perhaps Archimesh is also the wrong approach for this in the first place?
Blank screen after installing nvidia restricted driver Can I fly back to Italy if my Italian residency card has expired and is being renewed? I have a residence permit (permesso di soggiorno) for Italy. I am currently in the Netherlands for an exchange. My permit expired on the 30th of November and I applied for a new one but I will get the card in January. I have the documents supporting that I have applied for the renewal of the permit. In the middle I want to travel to Italy for Christmas and come back to the Netherlands.    Would this be a problem? Management of fruit bowls on the Enterprise D I have noticed that guest quarters on the Enterprise D have fruit bowls on their tables.  A prominent instance is the fruit bowl in Berlinghoff Rasmussen's quarters in "".  The first thing that Rasmussen does when Data takes him to his guest quarters is take a piece of fruit and shove it in his pocket.  Who replicates fruit for these fruit bowls before guests arrive?  More generally, who removes unused fruit and tidies quarters after guests leave?  Is there a ship hospitality staff, perhaps including Guinan's wait staff in Ten Forward? Negative pressure How to calculate the sum of sequence $$\frac{1}{\binom{n}{1}}+\frac{1}{\binom{n}{2}}+\frac{1}{\binom{n}{3}}+\cdots+\frac{1}{\binom{n}{n}}=？$$ How about its limit? One thing that made me curious while watching a football game on TV was the numbers that appear on the ground. For instance, there's a "1st &amp; 10" beside one team, but there was a "3rd &amp; 6" a few minutes prior (and I think it was beside the other team). What do these numbers mean? Additive function $T: \mathbb{R} \rightarrow \mathbb{R}$ that is not linear. A function $T:V \rightarrow W$ is additive if $T(x+y) = T(x) + T(y)$ for every $x, y \in V$. Prove that there exists an additive function $T: \mathbb{R} \rightarrow \mathbb{R}$ that is not linear.  My attempt: Let $T$ be the function $T: \mathbb{R}$ (over the field $\mathbb{Q}$) $\rightarrow \mathbb{R}$ (over the field $\mathbb{R}$). The set $\{1, \sqrt{2}\} \subseteq \mathbb{R}$ is linearly independent for the vector space $\mathbb{R}$ over $\mathbb{Q}$. Then, there must exist a linearly independent set $W \subseteq \mathbb{R}$ (over $\mathbb{Q}$) such that $\{1, \sqrt{2}\} \subseteq W \subseteq \text{span}(W) = \mathbb{R}$ (over $\mathbb{Q}$).  I have been told that the function defined as $T(1) = 1$ and $T(w) = 0$ for all $w \in \text{span}(W) \setminus \{1\}$ is additive but not linear, but I cannot see why this is? I can see why it is not linear, clearly $T(\sqrt{2} \cdot 1) = 0$ but $\sqrt{2} T(1) = \sqrt{2}$. But, why is $T$ additive? For example, $T(1+1) = T(2) =0$ but $T(1) + T(1) = 1+1 = 2$? Is there a mistake somewhere? I have forgotten my ID proof and I'm doing an Indian domestic flight. Can I still fly? I am travelling from Delhi to Indore, a domestic flight. I forgot to take ID proof. Can I still fly? Why are tar archive formats switching to xz compression to replace bzip2 and what about gzip? closed form for $\binom{n}{0}+\binom{n}{3}+\binom{n}{6}+...+\binom{n}{n}$ In the radio series, how did Zaphod get into the artificial universe? In the book The Restaurant at the End of the Universe, it's very clearly explained how Zaphod gets into the simulated universe; he's in it from the moment he enters Zarniwop's office, and a big deal is made of him leaving via the window rather than the door so that he stays in it.  In the radio series, however, this doesn't happen. At the end of Fit the Seventh, Zaphod asks "How do we get to this universe, then?" and Roosta replies "I'm afraid it looks like we don't...", pointing out that the building is splitting down the middle, preventing them reaching the office.  Later, in Fit the Twelfth, Zaphod finally meets Zarniwoop in the lounge of the slightly-delayed spaceliner and reacts with astonishment at learning he's been in the artificial universe all this time. "How did we get into it? I mean like where, when?"  Zarniwoop only replies enigmatically: "You didn't notice? Well, I'll let you work it out for yourself."  So, how did he get in? As noted, he never actually entered Zarniwoop's office. My only thought is that it happened during the "body debit" incident with the disco, but there's no particular indication that that should be the case. Is there any other possibility? On the computer upstairs we have an option to make the computer make a sound when we press Caps Lock, Number Lock and Scroll Lock. Is there a way to do this on Ubuntu 12.04? I am having trouble finding out why the white space between my paragraphs is variable. Sorry, I am not allowed to post images but sometimes there is no white space (like it should be), just an indent to denote that a new paragraph has started. While sometimes the paragraphs start with an indent AND there is (sometimes substantial and thus variable) white space between the last sentence of the previous paragraph and the first sentence of the new paragraph.  In my tex file, there is no difference between what I do in the first and second examples of my text: just two hard returns to denote the start of a new paragraph. I was wondering whether it could be due to placement of figures and footnotes but I have no idea how to change it. I don't mind a little variable white space between paragraphs but the above example is too extreme for my taste. Thanks for your advice! Checking out  and  (and some papers) was a bit difficult for understanding Group Action. The closest to understanding was this part:    I understand the definition of homomorphism (a structure-preserving map between two algebraic structures of the same type). And from what I understand the symmetric group is a group of functions (bijective functions) mapping elements of a set $X$ onto itself.  However I get confused at this line:     ...an action of $G$ on $X$ may be formally defined as a group homomorphism $\phi$ from $G$ to the symmetric group of $X$.   That seems to be the definition of group action, but I am having trouble understanding how to apply that.  What that says to me is it is a homomorphism (function) $f \colon X \rightarrow S$ where $S$ is a set of bijective functions on $X$. That itself seems weird, I thought a group action would result in a number or something related to $\{1, 2, 3\}$ (defined next).  Continuing, if we have a set $X = \{1, 2, 3\}$ and a group $(*,\{4, 5, 6\})$, then the symmetric group of $X$ would be something like $S = \{1 \rightarrow 2, 2 \rightarrow 3, \dots \}$, and $\phi$ would be something like $f : \{4, 5, 6\} \rightarrow S$. That doesn't make sense to me and I feel like I'm interpreting something wrong. I don't see how mapping to a set of functions $S$ will result in an action on the set. I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe? Attacks of the MAC construction $\mathcal{H}(m\mathbin\|k)$ for common hashes $\mathcal{H}$? Consider a common practically-collision-resistant hash function $\mathcal{H}$ (e.g. , , , ), perhaps based on the  as are the first three. We define a  $\mathcal{C}$ $$(k,m) \mapsto \mathcal{C}(k,m)=\mathcal{H}(m\mathbin\|k)$$ where $\mathbin\|$ denotes concatenation, $k$ is a secret key (constant, or at least of fixed size), and $m$ is a message (possibly of variable length). Assume that an adversary can (iteratively) submit queries with $m_j$ and obtain $C(k,m_j)$, and wants to obtain $k$ or otherwise compute $C(k,m)$ for some $m\ne m_j$.  That MAC $\mathcal{C}$ is not trivially bad. In particular, if $\mathcal{H}$ was indistinguishable from a random function in the , $\mathcal{C}$ would be secure. And even though $\mathcal{H}$ may have the , it does not turn into a devastating attack on $\mathcal{C}$.  The less impractical generic attack that I see is that if a collision was known for $\mathcal{H}$ with the colliding messages of moderate identical length, it could be deduced countless collisions for $\mathcal{C}$. Hence security is demonstrably not better than collision-resistance of $\mathcal{H}$ (for identical-length messages). We could assume that $k$ is half the size of the result of $\mathcal{H}$, and hope that the security is about  or  or , 280, 2128, 2256 hash rounds for SHA-1, RIPEMD-160, SHA-256, SHA-512.   What are the known attacks against $\mathcal{C}$ (better than the above), and their cost, for each of these common hashes?  Is there hope for an argument that an attack against $\mathcal{C}$ would turn into an attack of similar cost against $\mathcal{H}$, or hint of the contrary?  Update: this  is of interest, but I fail to find that it really answers the present question.  Update 2: I am aware that the construction considered is weaker than , and in particular is vulnerable to collision on $\mathcal H$; I stated that, and that it is thus pointless to have the key wider hopeless to target security against some attacks better than half the hash's size. I'm asking exactly what cryptanalytic attack better than finding a collision on $\mathcal H$ there are. There is room for such an attack only by exploiting a weakness in the structure or/and the round function of a concrete $\mathcal H$. Thomson et al. provide a proof that $\lim_{n\rightarrow \infty} \sqrt[n]{n}=1$ in . It has to do with using an inequality that relies on the binomial theorem:  I have an alternative proof that I know (from elsewhere) as follows.  Proof. \begin{align} \lim_{n\rightarrow \infty} \frac{ \log n}{n} = 0 \end{align} Then using this, I can instead prove: \begin{align} \lim_{n\rightarrow \infty} \sqrt[n]{n} &amp;= \lim_{n\rightarrow \infty} \exp{\frac{ \log n}{n}} \newline &amp; = \exp{0} \newline &amp; = 1 \end{align}  On the one hand, it seems like a valid proof to me. On the other hand, I know I should be careful with infinite sequences. The step I'm most unsure of is: \begin{align} \lim_{n\rightarrow \infty} \sqrt[n]{n} = \lim_{n\rightarrow \infty} \exp{\frac{ \log n}{n}} \end{align} I know such an identity would hold for bounded $n$ but I'm not sure I can use this identity when $n\rightarrow \infty$. Question: If I am correct, then would there be any cases where I would be wrong? Specifically, given any sequence $x_n$, can I always assume: \begin{align} \lim_{n\rightarrow \infty} x_n = \lim_{n\rightarrow \infty} \exp(\log x_n) \end{align} Or are there sequences that invalidate that identity?  (Edited to expand the last question) given any sequence $x_n$, can I always assume: \begin{align} \lim_{n\rightarrow \infty} x_n &amp;=  \exp(\log \lim_{n\rightarrow \infty} x_n) \newline &amp;=  \exp(\lim_{n\rightarrow \infty} \log x_n) \newline &amp;=  \lim_{n\rightarrow \infty} \exp( \log x_n) \end{align} Or are there sequences that invalidate any of the above identities? (Edited to repurpose this question). Please also feel free to add different proofs of $\lim_{n\rightarrow \infty} \sqrt[n]{n}=1$. So I have learned in class that light can get red-shifted as it travels through space. As I understand it, space itself expands and stretches out the wavelength of the light. This results in the light having a lower frequency which equates to lowering its energy.  My question is, where does the energy of the light go? Energy must go somewhere!   Does the energy the light had before go into the mechanism that's expanding the space? I'm imagining that light is being stretched out when its being red-shifted. So would this mean that the energy is still there and that it is just spread out over more space? With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time.  Note from foss &amp; Oli: We are making this the master question for all future "Will this work on &lt;insert random tablet/phone/device here&gt;?!" questions I'm interested in the exact barrier of $$\ln(n!)= \Theta(n\ln(n))$$  and if it even exists.  This means, there is a $c_1, c_2$ , so that $$\ln(n!) \le  \Theta(n\ln(n) c_1$$  $$\ln(n!) \ge  \Theta(n\ln(n) c_2$$  or  $$0 \le \lim\limits_{n \to \infty}\frac{\ln(n!)}{n\ln(n)} \ge \infty$$  I could use de l'Hospital for the limit fraction, since it's $\frac{\infty}{\infty}$ but the derivate of $\ln(n!)$ causes problems. Also I don't know how I could prove the two statements above or how to prove them wrong. Any help is appreciated.