I've been working my way through the Javascript development track on Treehouse and am struggling with for in loops. I have been unable to locate any explanation of this loop in everyday language and am subsequently getting confused. What does for in actually do, and why would you use this loop as oppose to another loop? Is it basically just a way to assign a common label to each individual property of an object?
Do you think there is a big difference in for...in and for loops? What kind of "for" do you prefer to use and why?  Let's say we have an array of associative arrays:  var myArray = [{'key': 'value'}, {'key': 'value1'}];   So we can iterate:  for (var i = 0; i &lt; myArray.length; i++)   And:  for (var i in myArray)   I don't see a big difference. Are there any performance issues?
A field extension of prime degree Suppose that $E$ is an extension of $F$ of prime degree. Show that $~~\forall~ a \in E : ~ F(a)=F$ or $F(a)=E$   Attempt: Suppose that $E$ is an extension of a field $F$ of prime degree, $p$. Therefore $p = [E :F] = [E : F(a)][F(a) : F]$. Since $p$ is a prime number, we see that either $[E : F(a)] = 1$ or $[F(a) : F] = 1$.   Now, $[E : F(a)] = 1 \implies $ there is only one element $x \in E$ which forms a basis and every element in $E$ is generated by $x$ i.e. $E = \{x~c~|~ c \in F(a)\}$  $[F(a) : F] = 1 \implies $ there is only one element $y \in F(a)$ which forms a basis and every element in $F(a)$ is generated by $y$ i.e. $F(a) = \{y~d~|~ d \in F\}$  Have I inferred it correctly? How do I move ahead?  Thank you for your help. I have just downloaded "ubuntu-14.04.1-desktop-amd64.iso" and "ubuntu-14.04.1-server-amd64.iso" through "".   Please can someone confirm the maximum RAM that is supported.  According to many sites, Maximum RAM supported by the OS  ubuntu-14.04.1-desktop : " 2^64 bytes " -- Kindly confirm  ubuntu-14.04.1-server : " 2^64 bytes " -- Kindly confirm Combine and Minify Multiple CSS / JS Files Search window not opening in ArcMap? How can I remove all duplicates so that NONE are left in a data frame? I am writing a document for which I need the margin to be exactly as follows: left, right, top and bottom text margin all equal to 1in, distance from bottom of the paper to page number equal to 0.75in (I don't have any footnote or header to set).  I tried to use the fullpage package in LaTeX but it does not give me the 0.75in to the page number. Is there a way to force that? I tried to set manually the margins for a 8.5x11 paper but I am not succeeding.    I tried but after writing:  \documentclass[PhD]{class_file} \usepackage[margin=1in,footskip=0.25in]{geometry}   I get the error message \paperwidth (0.0pt) too short.  I don't see the \paperwidth is set to 0.0pt anywhere though..  Also it seems to me that depending on which machine I use to compile my tex file, I get different margins, even when I set them up manually (without using geometry). Is it possible?    Using the geometry package things seem to work a bit better now (I changed machine and the problem with the paper width previously mentioned disappeared).   \usepackage[margin=1in,footskip=0.25in]{geometry}   gives me without problem upper, right and left margin of 1in. But the lower margin is 1.2in and I can't change it to be 1in even by using bottom=1in or bottom=0.8in. I really don't see how this can happen. Maybe a problem with the spacing between lines? The class files I am using can be fund at   I erased the margin settings of uclath12.clo as the margin I need are different from the ones that this file gives. Thank you. How to list all installed packages I'd like to output a list of all installed packages into a text file so that I can review it and bulk-install on another system.  How would I do this? Disk brakes severely reduced in power after replacing bearings Choosing between $z$-test and $t$-test Background: I'm giving a presentation to colleagues at work on hypothesis testing, and understand most of it fine but there's one aspect that I'm tying myself up in knots trying to understand as well as explain it to others.  This is what I think I know (please correct if wrong!)   Statistics that would be normal if variance was known, follow a $t$-distribution if the variance is unknown CLT (Central Limit Theorem): The sampling distribution of the sample mean is approximately normal for sufficiently large $n$ (could be $30$, could be up to $300$ for highly skewed distributions) The $t$-distribution can be considered Normal for degrees of freedom $&gt; 30$   You use the $z$-test if:   Population normal and variance known (for any sample size) Population normal, variance unknown and $n&gt;30$ (due to CLT) Population binomial, $np&gt;10$, $nq&gt;10$   You use the $t$-test if:   Population normal, variance unknown and $n&lt;30$ No knowledge about population or variance and $n&lt;30$, but sample data looks normal / passes tests etc so population can be assumed normal   So I'm left with:    For samples $&gt;30$ and $&lt;\approx 300$(?), no knowledge about population and variance known / unknown.   So my questions are:   At what sample size can you assume (where no knowledge about population distribution or variance) that the sampling distribution of the mean is normal (i.e. CLT has kicked in) when the sampling distribution looks non-normal? I know that some distributions need $n&gt;300$, but some resources seem to say use the $z$-test whenever $n&gt;30$... For the cases I'm unsure about, I presume I look at the data for normality. Now, if the sample data does looks normal do I use the $z$-test (since assume population normal, and since $n&gt;30$)? What about where the sample data for cases I'm uncertain about don't look normal? Are there any circumstances where you'd still use a $t$-test or $z$-test or do you always look to transform / use non-parametric tests? I know that, due to CLT, at some value of $n$ the sampling distribution of the mean will approximate to normal but the sample data won't tell me what that value of $n$ is; the sample data could be non-normal whilst the sample mean follows a normal / $t$.  Are there cases where you'd be transforming / using a non-parametric test when in fact the sampling distribution of the mean was normal / $t$ but you couldn't tell? Why did Dumbledore 'put on' the Resurrection Stone (Ring)? What are bitwise operators? If sup A $\lt$ sup B show that an element of $B$ is an upper bound of $A$ (a) If sup A &lt; sup B, show that there exists an element of $b \in B$ that is an upper bound for $A$.  I have argued that if sup A $\lt$ sup B, then choose an $\epsilon&gt;0$ such that sup A +$\epsilon \in B$. Since $a \le $ sup A for all $a \in A$, it follows $a \lt $ sup A + $\epsilon$ hence sup A + $\epsilon $ is an upper bound of A as well as an element of B.  (b) Give an example to show that this is not always the case if we only assume sup A $\le$ sup B.  I am having trouble extending my argument into an example which makes me think that it may not be correct.   Question: Is my argument for (a) correct? If not how would one show this fact? Can you give an example asked for in (b)? Thanks in advance.  I need to understand how I am assuming what I am supposed to prove in my approach. Can someone elaborate on that please? The other question doesn't really address this issue. I have a very large folder that I am trying to create a tar archive of. The issue is I don't have enough extra free space to store the entire archive so I want to create say 100-200GB chunks of the archive at a time and transfer those individually to cloud storage. I need to be able to control when new chunks are created so my HDD doesn't fill up but all of the commands i've found to create split tarballs always create it all at once, in the same directory. The closest solution I found was from  but all the responses base the archives on number of files, not size which is important for my use case as my file sizes are unevenly distributed. opengl storing multiple indices into indices buffer After parsing collada files I found out that we have to load two(or more) indices each pointing to say a vertex or normal etc. like this (&lt;p>3 0 2 0 0 0&lt;/p>)  Is there a way to load (and use)these indices to indices buffer(ELEMENT_ARRAY_BUFFER) like this (vnvnvn...) ; where v is vertex pointer, n is normal pointer from the above. with vertices loaded to VBO1 like (vvvv...) and in VBO2 like (nnnn...). So that we dont have to repeat the normals in VBO2.  VBO like (vnvnvn...) is also ok. (and not something like this ), I'm not trying to use multiple indices buffer. I'm trying to put all the given indices into one index buffer and use them alternately.  (If I wasnt clear i will try for more clarification.) Mail App keeps popping up in the background in Mac OS Mojave When I am doing some work on my macbook pro, Mail app's main window keeps popping up in the background, it even pops up when I watch movies by interrupting full screen. This is so frustrating, I can't find out solution to this, googled and went to many discussion forums, no luck, suggestions that I found are very old and outdated. Has anyone faced similar issues or does anyone knows solution to this? What do you call the functions that make a composite function.  Example : $e^{\sin x} $ is made up of $\sin x$ in the argument of $e^x$  So what are $\sin x$ and $e^x$ called here in this context? Basic functions or something?   (Please don't tell me the former is trig and latter is exponential function, I know that, but that's not what I'm asking here, please try to understand)  Hope I made myself clear. What is the value of $\sum\limits_{i=1}^\infty\dfrac{1}{p_{p_i}}$ where $p_n$ is the nth prime (and so $p_{p_n}$ is the $k$th prime, where $k$ is the $n$th prime) ?  Thus $\frac{1}{3}+\frac{1}{5}+\frac{1}{11}+...=$ ??  How do I efficiently decide if $\sum_{i=1}^\infty\dfrac{1}{p_{p_i}}\gt1$ is true without using a computer ?  I assume this infinite sum is an irrational number. Has this already been proven ? Calling 32bit Code from 64bit Process I have an application that we're trying to migrate to 64bit from 32bit.  It's .NET, compiled using the x64 flags.  However, we have a large number of DLLs written in FORTRAN 90 compiled for 32bit.  The functions in the FORTRAN DLLs are fairly simple:  you put data in, you pull data out; no state of any sort.  We also don't spend a lot of time there, a total of maybe 3%, but the calculation logic it performs is invaluable.  Can I somehow call the 32bit DLLs from 64bit code?  MSDN suggests that I can't, period.  I've done some simple hacking and verified this.  Everything throws an invalid entry point exception.  The only possible solution i've found so far is to create COM+ wrappers for all of the 32bit DLL functions and invoke COM from the 64bit process.  This seems like quite a headache.  We can also run the process in WoW emulation, but then the memory ceiling wouldn't be increased, capping at around 1.6gb.  Is there any other way to call the 32bit DLLs from a 64bit CLR process? I'm having a hard time understanding how changing space means changing time. In books I've read people are saying "space and time" or "" but never explain what the difference is between the two concepts or how they are related.  How are the concepts of space, time, and space-time related? Tag suggestions are empty