FAT32 change permisssion
How do I change file permissions on a FAT32 drive?
Headless linux install How do you do a headless install of linux? No monitor, no keyboard. Machine has floopy and cd drive. Can I configure a live cd to run sshd with a preconfigured pass or something similar and manage it via that?  Instructions for fedora 8+ would be ace but anything else also welcomed.  Cheers. Use /testfor to make a custom command Basically, I'm trying to recreate the Faction plugins /f map in my single-player without mods as my PC doesn't run them very well. (I know it sounds strange.) I am trying to use the /testfor to test if I have written '/f map' in chat, and if I have, it would show me a custom generated map. I don't know how to word this better xD Essentially what I want is for it to test if I have written a command in chat, and if I have, display something. How do I delete a 'locked' file? On Windows XP, when I try and delete a specific file it says:     Cannot delete blah.blah: Make sure the   disk is not full or write-protected   and that the file is not currently in   use.   How can I go around this warning and delete it anyway? The question is:     Show that there are an infinite number of pairs $(m,n): m, n \in \mathbb{Z}^{+}$, such that: $$\frac{m+1}{n}+\frac{n+1}{m} \in \mathbb{Z}^{+}$$   I started off approaching this problem by examining the fact that whenever the expression was a positive integer, the following must be true:  $$\frac{m+1}{n}+\frac{n+1}{m} - \left\lfloor\frac{m+1}{n}+\frac{n+1}{m}\right\rfloor = 0$$  However, I was unable to do much more with this expression, so I abandoned it and started the problem again from a different angle.  Next I re-arranged the expression to state that:  $$\frac{m^2+m+n^2+n}{mn} \in \mathbb{Z}^{+} \implies \frac{m(m+1) + n(n+1)}{mn} \in \mathbb{Z}^{+}$$  And therefore:  $$mn \mid (m(m+1) + n(n+1))$$  However, I'm unsure how to demonstrate there are infinitely many occurances of $(m, n)$ for which this is true. So I'd appreciate any help.   Thanks in advance Which one of these two statements is correct?     Our staff do ...      Our staff does ...   And is staffs ever correct? What does each SPECIAL stat in Fallout Shelter do? Besides its workplace uses, like Charisma in Living Quarters, Strength in Power Generators, Agility in Diners.   Do we know if Endurance increases HP in the Dwellers, or that strength helps in melee damage / survivability in the wastelands? And Perception? Can we simply rename an app if they are different versions and keep them both? For example, I have Xcode 4.4.1, and now Xcode 4.5 Golden Master (GM) version is available, but it is also called Xcode (when the .dmg is mounted as an disc image, it shows only one app (or folder), called Xcode)  I think the way is just to double click on the .dmg file, and then drag and drop that app into our Applications folder.  But since the current Xcode and Xcode 4.5GM have the same name, can the new one just be renamed and so we can have both versions on our machine?  I was worried that what if the app writes back data to the /Applications/Xcode folder, then the GM version can write unexpected data for the 4.4.1 version.  And will it work with other software, such as Xcode 3.2, Xcode 3.3, or even different versions of Microsoft Office and Adobe Photoshop? Why does adding a DOCTYPE affect my CSS? Why does range(start, end) not include end? What are the fundamental differences between the mainstream *NIX shells? What are the fundamental differences between the mainstream *NIX shells and what scenarios might prompt you to use one over the other?  I understand that some of it probably comes down to user preference but I've only ever used Bash and I'm interested to hear where another shell might be useful. Also, is there an impact on user-written shell scripts when running under one shell or another or is it simply a matter of changing the shell at the top of the file?  My instinct says it's not that easy. Genetically modified humans study insectoid alien miners with super-intelligent hive-mind This is a short story that appeared in a collection. Two genetically-modified humans (corporate anthropologists, basically) travel to a planetoid inhabited by an insect race that is mining the planet in order to study the race. While there, they are practically ignored, as the individual members of the race lack consciousness. The humans determine a type of pheromone is used to control the worker caste, and co-opt several members to create a living area. They make plans to put the mining towards human ends, but before that can happen they are discovered. The presence of the artificial pheromones wakes up a hive-mind, super-intelligent bug, who then bargains with the surviving member of the team (the man) after killing and taking over the female member of the team.  The collection was read at some point between 2000-2005. How do I improve boot speed? I got this question in homework:     Let $\{0,1\}^A$ the set of all functions from A (not necessarily a finite set)       to $\{0,1\}$. Find a correspondence (function) between $\{0,1\}^A$ and       $\mathcal P(A)$ (The power set of $A$).       Prove that this correspondence is one-to-one and onto.   I don't know where to start, so I need a hint. What does it mean to find a correspondence? I'm not really supposed to define a function, right?  I guess once I have the correspondence defined somehow, the proof will be easier.  Any ideas? Thanks! Partial Sums of Geometric Series How to wait in bash for several subprocesses to finish and return exit code !=0 when any subprocess ends with code !=0? How to wait in a bash script for several subprocesses spawned from that script to finish and return exit code !=0 when any of the subprocesses ends with code !=0 ?  Simple script:  #!/bin/bash for i in `seq 0 9`; do   doCalculations $i &amp; done wait   The above script will wait for all 10 spawned subprocesses, but it will always give exit status 0 (see help wait). How can I modify this script so it will discover exit statuses of spawned subprocesses and return exit code 1 when any of subprocesses ends with code !=0?  Is there any better solution for that than collecting PIDs of the subprocesses, wait for them in order and sum exit statuses? I used to be able to go to Accounts and Import → Add another email address you own and add an email account that's only a forwarding address. That is, it's not a mailbox and I don't have SMTP access to it.  Gmail would send me a confirmation email to that address, I'd confirm it's mine, and done. Now it only gives me the option to add SMTP credentials.  Did they stop supporting the previous method? Is there any other way I can get that option back? longtabu and color compatibility Classifying whether a collection of objects is a set I'm wondering whether or not there is a definite criterion for determining whether a collection of objects is a set. In the literature, I've recently encountered some obscure examples (in Riemann Surface Theory, to be precise) of naturally-arising collections of objects which are not sets.   Here is some pseudo-rigor to make the question more precise:   Let $S$ be a collection of objects. Is there some property $P$ so that $S$ is a set iff $S$ has property $P$? How to use more than 10 tab stops in bmatrix or other amsmath matrix environments? How to choose trace width for very high current PCB? I am currently designing a PCB layout for my team's high current, high voltage project and am having trouble with choosing my trace width.  The circuit is composed of 12 inductors placed in series with short traces connecting them together (about 5mm max length). We are feeding 10μs pulses at ~300A/1000V at a maximum rate of 10 pulses per second by discharching capacitor banks into the coils. The capacitors are recharged by an external source.  I have looked for resources on the subject, but nothing I could find applies to the level of current and voltage we are applying.  Is there a rule for determining trace width for very high current pulses?