Does the noun "structure" require an article in this case?
Are there any simple rules for choosing the definite vs. indefinite (vs. none) article?
I'm more of a math guy than a physics guy so bear with me....  In fractal geometry, fractals are considered to have fractional dimension. For instance an object such as the Koch curve has a fractal dimension of around $1.2$. You can also define a concept called fractal extent (which is the experimental version of hausdorff measure). This extent is a measure of how large a fractal is. It's even been used to more accurately model the distribution of coastline bird nesting.   Even though fractals work as an interpretation of geometrical units, I don't think they would describe things such as $kg^{1/2}$ very well. In addition, I've heard about white Gaussian noise that has square root time units.   What is the physical meaning of fractional units such as the above? (Since it obviously has little geometric meaning) File sync error (AUTH_FAILED) I was trying to solve internet problems, and seem to have made things worse: Now when I start the computer it gets stuck on "Booting system without full network configuration".   Does anyone know how to make it unstuck?   Alternatively: It got messed up when I changed the contents of /etc/network/interfaces, so presumably would work again if I changed it back. How can I edit this file during boot?   I'm using Ubuntu 12.10. If $E$ has Lebesgue measure $0$, must there exist a translate such that $E\cap E+x=\varnothing$? If $y\in E\cap E+x$ then $y=h=h'+x \implies x=h-h'$ for $h,h'\in E$. Likewise, if $x=h-h'$, then $h\in E\cap E+x$. So that $E\cap E+x$ is non empty iff $x=h-h'$ where $h,h'\in E$. Thus, if there exists a real $x$ which cannot be expressed as above, the result is proven. The problem is I cannot prove that such an $x$ must exist. I have tried assuming that all real $x$ are of that form, but that gives me nothing except that $E$ must be uncountable and unbounded. Any hints? Dedicated mouse and keyboard for a virtual machine, is it possible? $-1$ is a quadratic residue modulo $p$ if and only if $p\equiv 1\pmod{4}$ I came across this problem and I believe Lagrange's theorem is the key to its solution.  The question is:     Let $p$ be an odd prime. Prove that there is some integer $x$ such that $x^2 \equiv −1 \pmod p$ if and only if $p \equiv 1 \pmod 4$.   I appreciate any help.  Thanks. "std::endl" vs "\n" Many C++ books contain example code like this...  std::cout &lt;&lt; "Test line" &lt;&lt; std::endl;   ...so I've always done that too. But I've seen a lot of code from working developers like this instead:  std::cout &lt;&lt; "Test line\n";   Is there a technical reason to prefer one over the other, or is it just a matter of coding style? Does the Draconic Bloodline sorcerer's Elemental Affinity feature apply to the spell Dragon's Breath? The  feature Elemental Affinity states:     [When] you cast a spell that deals damage of the type associated with your draconic ancestry, you can add your Charisma modifier to one damage roll of that spell.   The  spell (XGtE, p. 154) incorporates a damage roll, but it is not a direct consequence of the spell:     Until the spell ends, the creature can use an action to exhale energy of the chosen type in a 15-foot cone. Each creature in that area must make a Dexterity saving throw, taking 3d6 damage of the chosen type on a failed save, or half as much damage on a successful one.   Would one of these exhalations qualify for the application of the Elemental Affinity feature? If so, is only one eligible or every one throughout the duration of dragon's breath What GUI applications are there to assist in generating graphics for TeX? String manipulation with & or + in VB.NET Capitalization for a bullet list Is there a picture showing all the lengths used in lists? How do I hide the GRUB menu showing up at the beginning of boot? I stopped dual booting and I don't want to have to choose the OS any more. I want to boot into Ubuntu 12.04 directly without seeing the GRUB menu.  How can I achieve that? How to add texture to fill colors in ggplot2 C++ catching all exceptions "the 90s were the best decade ever" or "the 90s was the best decade ever"  "the 90s" and "decade" are both referring to the same singular period of 10 years, so "was" seems to make more sense. "90s were" rolls off the tongue better though. TikZ rectangular node with different rounded corners How can i get currency symbols from currency code in iphone? Why the Galaxy has 25GB instead of 32GB I just purchased a Samsung Galaxy S3 32GB, when I check the storage I have only 25.5GB. Where is the other 6.5GB? Is there a way to show that $\sqrt{p_{n}} &lt; n$?  In , I show that $f_{2}(x)=\frac{x}{ln(x)} - \sqrt{x}$ is ascending, for $\forall x\geq e^{2}$. As a result, $\forall n \geq 3$ $$\frac{p_{n}}{ln(p_{n})} - \sqrt{p_{n}}\leq \frac{p_{n+1}}{ln(p_{n+1})} - \sqrt{p_{n+1}}$$ Also (and as a result), $\forall n \geq 3$ $$ \frac{p_{n}}{ln(p_{n})} - \sqrt{p_{n}} &gt; 0$$ Or $$ \frac{\pi (p_{n})}{p_{n}/ln(p_{n})} &lt; \frac{\pi (p_{n})}{\sqrt{p_{n}}}$$  According to  $$\displaystyle\smash{\lim_{n \to \infty }}\frac{\pi (p_{n})}{p_{n}/ln(p_{n})}=1$$ Or, $\forall \varepsilon &gt;0$, $\exists N(\varepsilon )$: $\forall n&gt;N(\varepsilon )$ $$1- \varepsilon &lt; \frac{\pi (p_{n})}{p_{n}/ln(p_{n})} &lt; 1+ \varepsilon$$ Or $$1- \varepsilon &lt; \frac{\pi (p_{n})}{p_{n}/ln(p_{n})} &lt; \frac{\pi (p_{n})}{\sqrt{p_{n}}}$$ As a result $\forall \varepsilon &gt;0$, $\exists N(\varepsilon )$: $\forall n&gt;N(\varepsilon )$ $$(1 - \varepsilon ) \cdot  \sqrt{p_{n}} &lt; \pi (p_{n}) = n$$  But this is not enough.  Interestingly,  is true iff function $f_{4}(x)=\pi (x) - \sqrt{x}$ is strictly ascending ($x &lt; y \Rightarrow f(x) &lt; f(y)$) for prime arguments.  If $f_{4}(p_{n}) &lt; f_{4}(p_{n+1})$ then $$\pi (p_{n}) - \sqrt{p_{n}} &lt; \pi (p_{n+1}) - \sqrt{p_{n+1}}$$ Or $$\sqrt{p_{n+1}} - \sqrt{p_{n}} &lt; \pi (p_{n+1}) - \pi (p_{n}) =1$$  And vice-versa, if $$\sqrt{p_{n+1}} - \sqrt{p_{n}} &lt; 1$$ Then $$-\sqrt{p_{n}} &lt; -\sqrt{p_{n+1}} + 1$$ Or $$\pi (p_{n})-\sqrt{p_{n}} &lt; \pi (p_{n}) + 1 -\sqrt{p_{n+1}} = \pi (p_{n+1}) -\sqrt{p_{n+1}}$$  So, if Andrica's conjecture is true then $\forall n \geq 3$ $$\pi (p_{n})-\sqrt{p_{n}} &gt; 0$$ Or $$\sqrt{p_{n}} &lt; \pi (p_{n})= n$$