Access to the stack-exchange data dump
Is there a problem with the ClearBits data dump?
If $R$ is a local ring and $M$ and $N$ are finitely generated $R$-modules such that $M\otimes N=0$ then how does it follow from Nakayama's lemma that either $M=0$ or $N=0$?    This is an exercise in Atiyah and Macdonald. The part I could not show in the hints is $({M{\otimes}_R N)}_{k}=0$ implies $M_{k}{\otimes }_{k} N_{k}=0$, where $k=R/\mathfrak m$ and $\mathfrak m$ is the maximal ideal of $R$. Where can I get more favourable exchange rate, in general?changing baht to Canadian dollars in Thailand or Canada or make a bank transfer to my Canadian account Lately it's happening to me this:  After completing one or more "First Posts" reviews, I go back to the Review Section main page:   And the post counter shows that there are still posts to review. I click the link to review them, but there is nothing.  Refreshing the page doesn't solve the issue: it shows the wrong number again. I'm new to Ubuntu. I installed it today, but the first thing I encounter is that I can only connect to the Internet through wifi.  Can someone help me?   iwconfig result :  eth0      no wireless extensions.  lo        no wireless extensions.   lspci:  00:00.0 Host bridge: Intel Corporation 3rd Gen Core processor DRAM     Controller (rev 09) 00:01.0 PCI bridge: Intel Corporation Xeon E3-1200 v2/3rd Gen Core processor PCI Express Root Port (rev 09) 00:02.0 VGA compatible controller: Intel Corporation 3rd Gen Core processor Graphics Controller (rev 09) 00:14.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB xHCI Host Controller (rev 04) 00:16.0 Communication controller: Intel Corporation 7 Series/C210 Series Chipset Family MEI Controller #1 (rev 04) 00:1a.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB Enhanced Host Controller #2 (rev 04) 00:1b.0 Audio device: Intel Corporation 7 Series/C210 Series Chipset Family High Definition Audio Controller (rev 04) 00:1c.0 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 1 (rev c4) 00:1c.1 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 2 (rev c4) 00:1c.3 PCI bridge: Intel Corporation 7 Series/C210 Series Chipset Family PCI Express Root Port 4 (rev c4) 00:1d.0 USB controller: Intel Corporation 7 Series/C210 Series Chipset Family USB Enhanced Host Controller #1 (rev 04) 00:1f.0 ISA bridge: Intel Corporation HM76 Express Chipset LPC Controller (rev 04) 00:1f.2 SATA controller: Intel Corporation 7 Series Chipset Family 6-port SATA Controller [AHCI mode] (rev 04) 00:1f.3 SMBus: Intel Corporation 7 Series/C210 Series Chipset Family SMBus Controller (rev 04) 01:00.0 3D controller: NVIDIA Corporation GF117M [GeForce 610M/710M/820M / GT 620M/625M/630M/720M] (rev a1) 03:00.0 Network controller: MEDIATEK Corp. MT7630e 802.11bgn Wireless Network Adapter 04:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. Device 5289 (rev 01) 04:00.2 Ethernet controller: Realtek Semiconductor Co., Ltd. RTL8111/8168/8411 PCI Express Gigabit Ethernet Controller (rev 0a)   lspci -nnk | grep 0280 -A2:  03:00.0 Network controller [0280]: MEDIATEK Corp. MT7630e 802.11bgn Wireless Network Adapter [14c3:7630]     Subsystem: Foxconn International, Inc. Device [105b:e074] 04:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. Device [10ec:5289] (rev 01) TeXstudio not large enough to use on a 4k display Will there be data loss if I upgrade? Let $A\in M_{n\times n}(\Bbb R)$ so that $I\notin span(A,A^2,...,A^n)$. Prove that $\det(A)=0$.   I was thinking of showing $A$ is not invertible, meaning it has an eigenvalue of $0$. Since no matter the power you give to $A$, it is still not the identity, you can deduce that at least one eigenvalue is indeed $0$. However this doesn't work if you have different eigenvalues in the Matrix, so I got stuck.  Help will be most appreciated. Expected Number of coin flips for 2 consecutive heads for first time. I was working on problems on expectation and found this one as a question from a well-known exam  Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for the first time is.  (A)4  (B)3  (C)6  (D)10  (E)5  I worked up like Let N be the number of tosses required untill 2 consecutive heads are obtained for the first time.  Let the probability of obtaining heads be p and tails be q and for a coin p=q=1-p=1-q.  For N=2, the probability will be $p^2$  For N=3, the probability will be $p^2.q$  For N=4, the probability will be $q^2.p^2$  For N=5, the probability will be $q^3.p^2$  and so on...  Now, $E[N]=2(p^2)+3(p^2.q)+4(q^2.p^2)+5(q^3.p^2)+......$  and this comes out to be $\frac{3}{2}$ but it matches with none of the options.  Please tell me where I am wrong and what should I do to reach the correct solution? Smaug first appeared in TA 2770 as a mature Fire-drake. I'm not sure if there are canonical sources which say his age or maturity, but he must have been quite large and quite old at the time in order to destroy the city of Dale and capture Erebor.  Since it is safe to assume that Smaug would have been attacking towns and stealing all of the gold and jewels he could get his claws on for most of his life, then he must have amassed a huge fortune prior to taking residence at Erebor. How did he transport his existing horde to Erebor? It seems unlikely that he would have simply abandoned all of his treasure that he had previously accumulated.  EDIT: It has been established that Smaug was not a mature drake at the time of his appearance. However, he may have already had a small horde (compared to Erebor). How do the bonus perks from the Advanced Warfare Center work? How to NOT show keyboard layout chooser popup when changing language in GNOME 3 Title of 80's movie: future-era timetraveling humans go extinct and rescue/kidnap todays air crash victims What is the title of a 80's (i believe?) movie where humans in the far future are going extinct, and are aquiring new humans by going back in time to todays world, kidnapping air travelers that are known to have died that day, from the flying passenger aircraft just before its crashing.  A key visual:    Inside a hangar, a time portal opened, and a tail of a (flying) passenger aircraft extruded into the hangar where a stairs provided access to the back door of the aircraft.  The kidnappers made sure the surviving passengers remain seated and would forget about the whole ordeal. Kidnapped humans got replaced by lookalike dummies, including things they had on them. They tried hard not to alter the timeline. Does anyone know of a simple Image Editor, with functionality comparable to ,  for Ubuntu?  I've always found GIMP to be overkill and too complicated for what I want to do. How to successfully put a bibliography in a report on TexShop? I'm trying to put a bibliography in my LaTeX document, but I get various errors when I run it in BibTeX (saying no \citation found etc.), and no bibliography is printed in the PDF when I typeset it in LaTeX. My code reads as follows:  \documentclass[12pt]{report} ... \usepackage{biblatex} \addbibresource{SUSYBib.bib} ... \begin{document} ...\cite{1}... ...\cite{2}... \nocite{*} \printbibliography \end{document}   And my .bib file reads as  @book{1, title={The Schrödinger Equation}, author={F. A. Berezin, M. A. Shubin}, year={1983}, publisher={Moscow State University, Moscow}, pages={57-59} } @book{2, title={An Introduction to Measure Theory}, author={Terence Tao}, year={2011}, publisher={American Mathematical Society}, pages={91} } PHP: running scheduled jobs (cron jobs) I have a site on my webhotel I would like to run some scheduled tasks on. What methods of achieving this would you recommend?  What I’ve thought out so far is having a script included in the top of every page and then let this script check whether it’s time to run this job or not.  This is just a quick example of what I was thinking about:  if ($alreadyDone == 0 &amp;&amp; time() &gt; $timeToRunMaintainance) {    runTask();    $timeToRunMaintainance = time() + $interval; }    Anything else I should take into consideration or is there a better method than this? I have knowledge about 'Kile' more or less. Now  I am using 'Texmaker'. But  there is a problem in it. In Kile when we write \begin{env} it automatically write \end{env} from the following :  Settings => Configure Kile => LaTeX => Environments => making tick mark on "Automatically complete \begin{env} with \end{env}" we can set it. But in 'Texmaker' automatic environment is not working. How can I do so. In the Harry Potter universe, there is a spell that unlocks things. In the books and movies, there are many occasions where the main characters use this spell to open doors in wizard buildings (such as the door leading to where the Philosopher's Stone is hidden, or a door in the Magical Congress Of USA headquarters). Hermione knows the spell in her first year, which seems to indicate it's pretty easy to learn/cast, especially for the average adult wizard.   What I'm wondering, then, is why do wizards lock their doors when it's so easy to unlock them? And if it's so easy to unlock locked doors, why aren't there more doors locked with enchantments? Better favourites organisation I don't know about anyone else, but I have a reasonable list of favourites now, and it can be rather difficult to find the relevant ones at any given time. Sometimes, I have a specific one in mind, others I just want to see all favourites relating to a specific topic. It would be nice if there were a way to organise my favourites by tag, or OP, or possibly just search them.  How can we improve the favourites feature?  Please post your ideas on how we might improve the favourites feature of the Stack&nbsp;Exchange sites. Try to keep each answer to one idea so that the votes reflect the popularity of a single idea. I have a one-dimensional array of strings in JavaScript that I'd like to turn into a comma-separated list. Is there a simple way in garden-variety JavaScript (or jQuery) to turn that into a comma-separated list? (I know how to iterate through the array and build the string myself by concatenation if that's the only way.) Prove that n is divisible by 4 in a cylic sum with variables which have only two possible values