I get the advice to move the discussion to the chat, but one of the users in the discussion has no chat privileges yet. So I think it's a bug to advice a user without chat privileges to move the discussion to the chat area.
Simple request, really.  Can we add a detection for the     Please avoid extended discussions in   comments. Would you like to   automatically move this discussion to   chat?   prompt, so that if one of the users in the "extended discussion" has under 20 rep it doesn't appear?  I think a lot of the users this apply to will have low rep and it may take some back and forth to get good info out of them.  New suggestion: how about if a sufficiently high-rep user is clicking on the link, the low-rep user gets a field promotion sufficient to chat? Low-rep users are particularly prone to post questions to lead in this direction of needing to move to chat.
How to prompt for user input and read command-line arguments Export nodes from Drupal 4? Of Half-elven and mortal life Present perfect for past action with present effect Why Was It 'Essential' That Voldemort Kill Harry Potter? What is CTAN.org now? I got some new hard discs and would like to set my PC up in the following way:   Ubuntu is currently installed on one drive I want to put Windows on a second drive I would like a third drive for shared content (music and stuff) that both OSes can access     What I need to know is what format should the content drive be?  How should I configure the drive order in my bios for GRUB to be boot manager and how to configure GRUB for multi-HDD booting? $X$ is Hausdorff if and only if the diagonal of $X\times X$ is closed Let $X$ be a topological space. The diagonal of $X \times X$ is the subset $$D = \{(x,x)\in X\times X\mid x \in X\}.$$   Show that $X$ is Hausdorff if and only if $D$ is closed in $X \times X$.   First, I tried to show that $X \times X \setminus D$ is open using the fact that $X \times X$ is Hausdorff (because $X$ is Hausdorff), but I couldn't find an open set that contains a point outside $D$ and is disjoint to it... $_SERVER["REMOTE_ADDR"] gives server IP rather than visitor IP Solidify thickness doesn't correspond to specified scale I'm Having trouble with setting the thickness applied by solidify. The selected block is 15 by 28 cm (single mesh sides) and the thickness of solidify is set to 3mm (pointing inwards). Checking off even thickness makes it even worse. I was using the function in a different object earlier today and it worked just fine. Is there something I'm missing or is this just a bug?   Feel free to treat me like an idiot, I've literally started using blender yesterday :) Test the convergence of the series For $a&gt;0$, test the convergence of the infinite series: $$\sum a^{\ln(n)}$$ Which test should be better to use here? I tried the D'Alembert's ratio test. $$\lim_{n\to \infty} {\frac{a^{\ln(n)}}{a^{\ln(n+1)}}}= \lim_{n\to \infty}a^{ln{\frac{n}{n+1}}}=a^0=1$$ So the test failed.  UPDATE: I observed that $${a^{\ln(n)}}=e^{{\ln(a)}{\ln(n)}}={n^{\ln(a)}}={{1\over n^{ln({1\over a})}} }$$Further by test of auxiliary series $$\sum \frac{1}{n^p}$$ we know that criterion for convergence is $p&gt;1$. Here $p=ln({1\over a})$.Hence the series will be convergent when $ln(a)&lt;-1$ i.e. when $0&lt;a&lt;1/e$, since $a&gt;0$ is already given.Finally this solved my question. ReadList can't read from file containing high-precision Reals Define the content of a polynomial (over an arbitrary commutative ring $A$) to be the ideal generated by its coefficients, denoted $c(f)$. I want to show that   $$c(fg) = c(f)c(g).$$      (I was told this is true.)    What I was able to show was that $c(fg) \subseteq c(f)c(g)$ (this is obvious), and that their radicals are the same. My reasoning for the latter was as follows: let $f = a_0 + \dotsb + a_nx^n,$ $g = b_0 + \cdots + a_mx^m,$ and consider the matrix  $$ \begin{pmatrix}  a_0 b_0 &amp; \cdots &amp; a_0b_m\\ \vdots &amp; \ddots &amp; \vdots\\ a_nb_0 &amp; \cdots &amp; a_nb_m \end{pmatrix} .$$  Then $c(f)c(g)$ is generated by the entries of this matrix, while $c(fg)$ is generated by the sums along the diagonals. Let $\mathfrak p$ be a prime ideal of $A$ not containing $c(f)$ or $c(g)$, and let $i,\,j$ be minimal such that $a_i,\, b_j \notin \mathfrak p$.  Then all the terms in the generator of $c(fg)$ corresponding to the coefficient of $x^{i+j}$ are in $\mathfrak p$ except for $a_ib_j$, so that $c(fg) \not\subset\mathfrak p$. It follows that $c(fg) \subseteq \mathfrak p \Longleftrightarrow c(f)c(g) \subseteq\mathfrak p$, and hence $\sqrt{c(fg)} = \sqrt{c(f)c(g)}$.     Can I go all the way and show that in fact $c(fg) = c(f) c(g)$? Extruding Vector Files in Blender I am sure this has been discussed quite a few times, but I found a tutorial recently doing the exact same thing as I did, but in my case my logo is messing up!  Here is the link to the workflow:   This is what it looks like after adding the solidify modifier:   I already recalced the normals of my spline, but besides that it messes up my spline shape, it had no effect.  Any suggestions on how to fix it? Which X-Men movies should I watch before Deadpool? I want to watch Deadpool, but I have heard the character has appeared in X-Men series too. My question is, if I watch X-Men before Deadpool, will it enhance my interest in the Deadpool character? $$A=\begin{array}{ccc} 0 &amp; 1/2 &amp; 0 &amp; \cdots &amp; 0 \\ 1/2 &amp; 0 &amp; 1/2 &amp;\cdots&amp; 0\\ 0 &amp; 1/2 &amp; 0 &amp; \cdots &amp; 0\\ \vdots &amp; \vdots &amp; \vdots &amp;\ddots &amp; 1/2\\ 0 &amp; 0 &amp; 0 &amp; 1/2 &amp; 0 \end{array}$$  I need to know the spectral radius of $A$ in function of the dimension of the matrix $n$. I know only one way to know the spectral radius, using the definition I find all eigenvalues and then find the maximum. but it very hard if $n$ is changing. Some help please!  I did some iteration by   $$det(\lambda I-A)$$  $$n=2 \quad r=\frac{\sqrt{1}}{2}$$ $$n=3 \quad r=\frac{\sqrt{2}}{2}$$  for $n=2$ and $n=3$ are correct.  and if we take this rule, for   $$n=5\quad \quad r=\frac{\sqrt{4}}{2}$$  but this isn´t true since I know radius for this matrix should be $&lt; 1$ and if we take this rule  for $n=5$ we have  $$\frac{\sqrt4}{2}=1$$   Some hint? What are some scenarios where FTL information transfer would violate causality? I've always heard people saying, "Faster than light information transfer can't happen because it would violate causality!  Effects can precede their causes!"  However, I'm trying to think of a situation where this would happen.  I'm sure it has something to do with relativity or something like that.  I sort of understand that people going faster perceive time slower.  Can someone help illuminate this for me by showing a scenario where causality is clearly violated due to FTL information transfer? What can you use Python generator functions for? I'm starting to learn Python and I've come across generator functions, those that have a yield statement in them.  I want to know what types of problems that these functions are really good at solving. Mobile web refresher, part 3 I'm new to Delphi, and I've been running some tests to see what object variables and stack variables are initialized to by default:  TInstanceVariables = class   fBoolean: boolean; // always starts off as false   fInteger: integer; // always starts off as zero   fObject: TObject; // always starts off as nil end;   This is the behaviour I'm used to from other languages, but I'm wondering if it's safe to rely on it in Delphi?  For example, I'm wondering if it might depend on a compiler setting, or perhaps work differently on different machines.  Is it normal to rely on default initialized values for objects, or do you explicitly set all instance variables in the constructor?  As for stack (procedure-level) variables, my tests are showing that unitialized booleans are true, unitialized integers are 2129993264, and uninialized objects are just invalid pointers (i.e. not nil).  I'm guessing the norm is to always set procedure-level variables before accessing them?