Reclaiming value out of a car needing expensive repair
Get tax deduction for expensive car expense
How long do seasons last? In the Kittens Game, how long (in real life minutes) do seasons last? I (think) that I've configured a static IP address in /etc/network/interfaces:  # The primary network interface  auto eth0  iface eth0 inet static     address 10.1.1.2     netmask 255.255.255.0     network 10.1.1.0     broadcast 10.1.1.255     gateway 10.1.1.1   And I change the file /etc/resolv.conf to include the desired nameservers.   Then I restart networking sudo /etc/init.d/networking restart  But after some hours resolv.conf always reverts back to the DHCP nameserver.   I should also say that this is Ubuntu Server with only l0 and eth0 interfaces. How can I make a special file that executes code when read from Most files on a Linux system are normal files, i.e. they are saved on disk and reading from them just reads from a specified chunk of memory on the disk.  How can I make something that behaves like a file in terms of being able to read from it as one would a normal file, but is actually returning programmatically generated data instead?  As a concrete example, a file that downloads the current google.com and returns it, such that cat ~/myspecialfile would output the contents of google.com to stdout? How did humans and vulcans communicate in Star Trek: First Contact? Factorial identity $n!=1+(1-1/1!)n+(1-1/1!+1/2!)n(n-1)+\cdots$ Show that $\displaystyle{n!=1+\left(1-\frac1{1!}\right)n+\left(1-\frac1{1!}+\frac1{2!}\right)n(n-1)+\cdots}$. I can't figure out how this can be solved. I tried to use the binomial theorem but I couldn't prove it. Any help will be greatly appreciated. Url rewriting in Amazon S3 I have a webapp hosted in Amazon S3, the webapp is build with jQuery Mobile and I use changePage lo navigate between pages, I'm not using the hash operator(#) when I change the page.  I'm having problems when the user copy the url and paste it in a new tab  For example:    loads the page page1.html that is in amazon s3 with only the jquery page structure...  The behavior that I want is that load index.html and with js read the url, detect the page and load the correct page.  With Apache I solve this with URL Rewriting... but for Amazon S3 I didn't find any similar...  NOTE: I know that if I activate the hash operator (#) in my urls the problem is solved but I need clean urls without #. How do I efficiently filter computed values within a Python list comprehension? The Python list comprehension syntax makes it easy to filter values within a comprehension.  For example:  result = [x**2 for x in mylist if type(x) is int]   Will return a list of the squares of integers in mylist.  However, what if the test involves some (costly) computation and you want to filter on the result?  One option is:  result = [expensive(x) for x in mylist if expensive(x)]   This will result in a list of non-"false" expensive(x) values, however expensive() is called twice for each x.  Is there a comprehension syntax that allows you to do this test while only calling expensive once per x? Converse of mean value theorem I am wondering if the following converse (or modification) of the mean value theorem holds. Suppose $f(\cdot)$ is continuously differentiable on $[a,b]$. Then for all $c \in (a,b)$ there exists $x$ and $y$ such that $$ f'(c)=\frac{f(y)-f(x)}{y-x} $$ So I get a square matrix $A$ is idempotent when $A^2 = A$.  How can you prove that if $A$ is an $n \times n$ matrix that is idempotent and invertible, then  $A = I$??  I'm quite confused on this.  Any help much appreciated, Thanks. Need to delete a directory with name '~' created accidentally If a product of relatively prime integers is an $n$th power, then each is an $n$th power What does "cpu MHz" field mean in the /proc/cpuinfo of a hyper-threading cpu? The CPU is a i7-3770@3.40GHz. It has 4 cores and each core has 2 threads. Here is the dmidecode output:  # dmidecode -t 4 # dmidecode 2.9 SMBIOS 2.7 present.  Handle 0x0042, DMI type 4, 42 bytes Processor Information     Socket Designation: SOCKET 0     Type: Central Processor     Family: &lt;OUT OF SPEC&gt;     Manufacturer: Intel(R) Corporation     ID: A9 06 03 00 FF FB EB BF     Version: Intel(R) Core(TM) i7-3770 CPU @ 3.40GHz     Voltage: 1.1 V     External Clock: 100 MHz     Max Speed: 3800 MHz     Current Speed: 3400 MHz     Status: Populated, Enabled     Upgrade: &lt;OUT OF SPEC&gt;     L1 Cache Handle: 0x003F     L2 Cache Handle: 0x003E     L3 Cache Handle: 0x0040     Serial Number: Not Specified     Asset Tag: Fill By OEM     Part Number: Fill By OEM     Core Count: 4     Core Enabled: 4     Thread Count: 8     Characteristics:         64-bit capable   It will be 8 logic core in a system, like what shows in /proc/cpuinfo. But can any one tell why the cpu MHz of a core is 1600MHz? I guess there is 2 threads in a core, so a hw thread freq may be about the half of the core's? How this number is calculated?  processor   : 7 vendor_id   : GenuineIntel cpu family  : 6 model       : 58 model name  : Intel(R) Core(TM) i7-3770 CPU @ 3.40GHz stepping    : 9 cpu MHz     : 1600.000 cache size  : 8192 KB physical id : 0 siblings    : 8 core id     : 3 cpu cores   : 4 apicid      : 7 initial apicid  : 7 fpu     : yes fpu_exception   : yes cpuid level : 13 wp      : yes flags       : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni pclmulqdq dtes64 monitor ds_cpl vmx smx est tm2 ssse3 cx16 xtpr pdcm sse4_1 sse4_2 x2apic popcnt aes xsave avx lahf_lm ida arat tpr_shadow vnmi flexpriority ept vpid bogomips    : 7013.49 clflush size    : 64 cache_alignment : 64 address sizes   : 36 bits physical, 48 bits virtual power management:   Also, here is the output of lshw and lscpu command. There are also 1600MHz mentioned.   lshw info:  #lshw -class processor   *-cpu                           description: CPU        product: Intel(R) Core(TM) i7-3770 CPU @ 3.40GHz        vendor: Intel Corp.        physical id: 42        bus info: cpu@0        version: Intel(R) Core(TM) i7-3770 CPU @ 3.40GHz        slot: SOCKET 0        size: 1600MHz        capacity: 3800MHz        width: 64 bits        clock: 100MHz        capabilities: fpu fpu_exception wp vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp x86-64 constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni pclmulqdq dtes64 monitor ds_cpl vmx smx est tm2 ssse3 cx16 xtpr pdcm sse4_1 sse4_2 x2apic popcnt aes xsave avx lahf_lm ida arat tpr_shadow vnmi flexpriority ept vpid cpufreq   lscpu info:  #lscpu Architecture:          x86_64 CPU op-mode(s):        32-bit, 64-bit CPU(s):                8 Thread(s) per core:    2 Core(s) per socket:    4 CPU socket(s):         1 NUMA node(s):          1 Vendor ID:             GenuineIntel CPU family:            6 Model:                 58 Stepping:              9 CPU MHz:               1600.000 Virtualization:        VT-x L1d cache:             32K L1i cache:             32K L2 cache:              256K L3 cache:              8192K Piping for loop output prevents local variable modification I'm trying to write a simple bash function that takes, as its arguments, a number of files and/or directories. It should:   Fully qualify the filenames. Sort them. Remove duplicates. Print all that actually exist. Return the number of non-existent files.   I have a script that almost does what I want, but falls down on the sorting. The return value of the script as it stands is correct, but the output is not (unsorted and duplicates). If I uncomment the | sort -u statement as indicated, the output is correct but the return value is always 0.  N.B. Simpler solutions to solve the problem are welcome but the question is really about why is this occurring in the code I have. That is, why does adding the pipe seemingly stop the script incrementing the variable r?  Here's the script:  function uniqfile {     local r=0       for arg in "$@"     do           readlink -e "$arg" || (( ++r ))      done #| sort -u    ## remove that comment      return $r } How is the notation $X\sim N(\mu,\sigma^2)$ read? Is it $X$ follows a normal distribution? Or $X$ is a normal distribution? Or perhaps $X$ is approximately normal..  What if there are several variables that follow (or whatever the words is) the same distribution? How is it written? I'm using the listings package with this \begin command:  \begin{lstlisting}[caption=blabla, label=amb]   This yields a nice code listing with a caption like "Listing 1.1 blabla". Is there a way to change the caption and have something like "Code 1.1 blabla"?  I saw the title command but it doesn't use a numbering system. Any hint will be greatly appreciated! Applying for tourist visa for US in country other than your own Possible Duplicate:          Can British passport holders apply for a B2 USA visa from other countries, if they are living there? Or do they have to go back to Britain to apply for it? Why does the One Ring make the wearer's clothes invisible? The One Ring turns invisible the person wearing it.  Is there an explanation for how it does this? It seems that direct contact with the skin activates the Ring's invisibility effects;  why would it also affect the person's clothing, weapons, etc, as well? The Invisible Man's clothing is visible, so why aren't Frodo's clothes visible?  The Hobbit makes it clear that Bilbo's clothing is invisible, since Smaug doesn't see it.  Is there any possiblity that this varies from character to character? How to encrypt a file or directory in Linux? What's the most popular command to do such things as encrypting a file or directory in terminal in Linux? How to prove this $\pi$ formula? I am hoping to find out where the formula  $$\frac{\pi}{2}=\sum_{k=0}^{\infty}\frac{k!}{\left(2k+1\right)!!}$$ comes from. I can't see how one could begin to prove it. Show that the boundary of a set equals the boundary of its complement $\newcommand{\bdy}{\operatorname{bdy}}$  I'm trying to show that $\bdy(A) = \bdy(A^c)$.  I know that $\bdy(A) = \operatorname{closure} A \setminus \operatorname{int}(A) = (\operatorname{int}(A^c))^c \setminus \operatorname{int}(A)$, but I don't know where to go from there.  Any help or hints would be very much appreciated.