In Python, why does itertools.cycle require additional memory?
Why does Python's itertools.cycle need to create a copy of the iterable?
prove or disprove: For a prime number p, there is a positive integer n such that $p+1 $= $n^2$ if and only if $ p = 3.$ Prove or disprove: For a prime number p, there is a positive integer n such that $p+1 $= $n^2$ if and only if $ p = 3.$  first im trying to proof if p is prime number there is positive integer n such that $p+1=n^2$ implies $p=3$  suppose there is positive n integer such that $p+1=n^2$ and prove that $p=3$. $p=n^2-1=(n+1)(n-1)$ since $p$ is prime $n-1=1$,$ n = 2 $ $p+1=4$ $p=3$ hence it is proved that $p=3$  now if $p=3$ implies there is positive integer n such that $p+1=n^2 $  $p=3$ and p is prime  $p+1=n^2$, $4=n^2$, $n2$ or $n=-2$ hence it is proved that there is positive integer $n$ such that $p+1=n^2 $  is my proof correct? and also for prime number can i write $n+1=1$ instead $n-1=1$? Difference between "while" and "whilst" Possible Duplicate:          In terms of construction of sentences, can the two words while and whilst be used interchangeably? FAQ: Migrations What are the rules on migrations:   Migrations in general Migrations to public betas Migrations to private betas I use my computer for scientific programming. It has a healthy 8GB of RAM and 12GB of swap space. Often, as my problems have gotten larger, I exceed all of the available RAM. Rather than crashing (which would be preferred), it seems Ubuntu starts loading everything into swap, including Unity and any open terminals. If I don't catch a run-away program in time, there is nothing I can do but wait - it takes 4-5 minutes to switch to a command prompt eg. Ctrl-Alt-F2 where I can kill the offending process.  Since my own stupidity is out of scope of this forum, how can I prevent Ubuntu from crashing via thrashing when I use up all of the available memory from a single offending program?  At-home experiment*!  Open a terminal, launch python and if you have numpy installed try this:  &gt;&gt;&gt; import numpy &gt;&gt;&gt; [numpy.zeros((10**4, 10**4)) for _ in xrange(50)]   * Warning: may have adverse effects, monitor the process via iotop or top to kill it in time. If not, I'll see you after your reboot. Storing C++ template function definitions in a .CPP file What is the difference between "Have you seen this?" and "Did you see this?" What's the difference between these two phrases? Suppose that, for a real application, I have ended up with a sorted list A = {$a_1, a_2, ..., a_{|A|}$} of elements of a certain kind (say, Type-A), and another sorted list B = {$b_1, b_2, ..., b_{|B|}$} of elements of a different kind (Type-B), such that Type-A elements are only comparable with Type-A elements, and likewise for Type-B.  At this point I seek to count the following: in how many ways can I merge both lists together, in such a way that the relative ordering of Type-A and Type-B elements, respectively, is preserved? (i.e. that if $P_M(x)$ represents the position of an element of A or B in the merged list, then $P_M(a_i)&lt;P_M(a_j)$ and $P_M(b_i)&lt;P_M(b_j)$ for all $i&lt;j$)  I've tried to figure this out constructively by starting with an empty merged list and inserting elements of A or B one at a time, counting in how many ways each insertion can be done, but since this depends on the placement of previous elements of the same type, I've had little luck so far. I also tried explicitly counting all possibilities for different (small) lengths of A and B, but I've been unable to extract any potential general principle in this way. How can I undo "always allow" in keychain item How can I generate isometric sprite sheets from 3D animations? Can anyone explain how we choose one sock from each of finitely many pairs without the axiom of choice?  I mean : To choose one sock from each of infinitely many pairs of socks requires the Axiom of Choice, but for shoes the Axiom is not needed.  The idea is that the two socks in a pair are identical in appearance, and so we must make an arbitrary choice if we wish to choose one of them. For shoes, we can use an explicit algorithm -- e.g., "always choose the left shoe." Why does Russell's statement mention infinitely many pairs? Well, if we only have finitely many pairs of socks, then AC is not needed -- we can choose one member of each pair using the definition of "nonempty," and we can repeat an operation finitely many times using the rules of formal logic (not discussed here). Word for giving animal characteristics (esp. physical ones) to humans I am writing a paper about Art Spiegelman's Maus, specifically the metaphor that Spiegelman creates by depicting his obviously quite human characters with the heads of various animals, or a couple times animal masks. The metaphor is used at times to bestialize/animalize the acts of the Nazis and, in some cases, to show the arbitrary nature of the classes/groups/divisions they and others applied to human beings.  I considered "chremamorphism," but this describes the attribution of the characteristics of an object to, or the objectification of, a human. I also considered "animalize" and "bestialize," but those describe some of the effects that can be produced by Spiegelman's metaphor, not the metaphor itself - in many scenes in the book, the characters are extremely human, and I think that the negative or degrading connotations of these words makes them inappropriate for this use. Nor do "anthropomorphism" or "personification" fit, because Spiegelman is not applying human characteristics to animals but the other way around. None of the words that I can think of quite fit.  What is a word that accurately describes Art Spiegelman's depiction of obviously human characters as having animal body parts or wearing animal masks in the comic book Maus? The junction has a stop sign on each of the four entrances.   The junction has a stop sign on each of the 4 entrances.   The first is preferred, for some reason, by many English texts. Why? I haven't seen this phenomenon in other languages. Why is $(2, 1+\sqrt{-5})$ not principal? Why is $(2, 1+\sqrt{-5})$ not principal in $\mathbb{Z}[\sqrt{-5}]$?   Say $(2,1+\sqrt{-5})=(\alpha)$, then since $2\in(2,1+\sqrt{-5})$ we have $2\in (\alpha)$, so $\alpha\mid2$ in $\mathbb Z[\sqrt{-5}]$. Writing $2=\alpha\beta$ in $\mathbb Z[\sqrt{-5}]$ and taking norms, $4=N(\alpha)N(\beta)$ in $\mathbb Z$, so $N(\alpha)\mid4$ in $\mathbb Z$. Similarly, since $\sqrt{-5}\in(\alpha)$ we get $N(\alpha)\mid5$, thus $N(\alpha)$ is a common divisor of $4$ and $5$, therefore $N(\alpha)=(1)$, so $\alpha$ is a unit. But that means $1\in (2,1+\sqrt{-5})=(\alpha)$, so it must be the whole ring, but it cannot to reach a contradiction, so how can I find an element, which is not in $(2, 1+\sqrt{-5})$.  Or is there a simpler method ? (Maybe not UFD would imply not PID) Steady-State Current I am in the process of completing some homework and have come across a question that says: "What is the steady-state current?" It is asking in reference to a circuit that includes two capacitors in parrallel and a DC source of 24V and an AC source given by $\epsilon = 20 \cos(120 \pi t)\ \text{V}$, where $t$ is in seconds. I assume that it is asking when the current is constant. Because naturally the current is not constant due to the AC source, would I just consider the DC source for this? Seeing through objects in Game engine Let $\{E_n\}_{n\in\mathbb{N}}$ be a sequence of countable sets and let $S=E_1\times\cdots\times E_n\times\cdots $. Show $S$ is uncountable. Prove that the same statement holds if each $E_n=\{0,1\}$.  By the definition of Cartesian product of sets,   $$\displaystyle S=\Pi_{n\in\mathbb{N}} \{f\colon\mathbb{N}\rightarrow\cup_{n\in\mathbb{N}}E_n\mid\forall n, f(n)\in E_n\}$$  If $E_n=\{ 0,1\}$, then  $$\displaystyle S_{01}=\Pi_{n\in\mathbb{N}}\{0,1\}=E^{\mathbb{N}}$$, where $E=\{0,1\}$.  By a theorem, $\cup_{n\in\mathbb{N}} E_n$ is countable since the sequence is countable.  I'm not sure how to go on from here to show $S$ is uncountable. Can we say anything about the function $f$ that maps a countable $\mathbb{N}$ to another countable union of sequence of countable sets? Is there a safe way to determine how powerful an opponent is? Difference between SQL batch, statement and RPC? What is the difference between SQL batch, T-SQL statement and Remote Procedure Call? How can I tell if part of the T-SQL code is a batch or statement? How do I invoke a Java method when given the method name as a string? This is in Windows, but answers for other operating systems can be handy to others.  Most guides say something to the effect of "hold down the Alt key and type in the code on the keypad".  This works fine for decimal codes (like 65 for 'A'), but not for  codes (like  for 'A').  Some applicatons provide other facilities that will allow hexadecimal Unicode character codes to be typed and then transformed.  Word allows you to type the code (such as 200f) and then convert it to Unicode by typing Alt-X.  I'm looking for a general method of doing this that will work with the standard input.