I need an OS that I can install on older XP computers. I do not understand computer slang, brain is too aged. I do print instructions that use words identical to what is found in the OS.  So I need to BUY a plug &amp; play option with simple settings. I am limited to dialup, long downloads fail because of telemarketer intrusions.  The OS needs to be proven &amp; current &amp; available in Ontario Canada. Can someone help this senior get out of the failing XP?
I need to upgrade my existing Ubuntu system, and I also want to install Ubuntu on a new laptop.  I would like to have an installation CD or DVD to do both of these.  Where exactly I can order or request an Ubuntu installation CD/DVD/USB?
How can I recover photo files from a memory card with a corrupt filesystem? This is problem 6.2 from the 3rd edition of Principles of Mathematical Analysis.      Problem 6.2: Suppose $f\geq 0$, f is continuous on $[a, b]$, and $\int_a^b f(x) \, dx = 0$. Prove that $f(x)=0$ for all $x \in [a, b]$.   I'm looking for a critique of my proof. It's a pretty easy problem, but I am always wary of making too bold of assumptions, especially on these low level/fundamental proofs. I'll be using Rudin's notation and refer to theorems from the text (If I should include the text of each theorem, feel free to leave a comment... I'm lazy but could probably use the TeX practice :p)  Proof: Assume, for contradiction, that $f&gt;0$. Then, for any partition $P$ we have the Lower Riemann Sum: $L(P, f)=\sum_{i=1}^n m_i \, \Delta x_i$. At least one $\Delta x_i$ must be positive, since $a &lt; b$, and each $m_i$ must be positive since we have $f&gt;0$ by assumption, so certainly $\sup f &gt; 0$. That means $L(P, f)&gt;0$. Thus, we have: $$0 = 0(b-a) &lt; L(P,f)\leq \sup L(P, f) = \inf U(P,f) =L$$ where the last string of equalities holds because our function is continuous on a compact interval, so is integrable by theorems 6.8 and 6.6. So our integral has value $L&gt;0$. This is in contradiction to our given assumption that $\int_a^b f(x) \, dx = 0$, so we must have that $f=0$ on $[a, b]$. $\Box$  So, I am wondering if my proof is correct (and is presented well). Also if someone could enlighten me as to what Rudin means when he say "Compare this with exercise 1," I'd be appreciative. Is it a hint or is there something else he expects you to notice? there are a lot of things I could compare :)...  Exercise 6.1: Suppose $\alpha$ increases on $[a, b]$, $a \leq x_0 \leq b$, $\alpha$ is continuous at $x_0$, $f(x_0)=1$, and $f(x)=0$ if $x\neq x_0$. Prove that $f$ is Riemann-Stieltjes Integrable and that $\int f \, d\alpha = 0$ How do you redirect to a page using the POST verb? When you call RedirectToAction within a controller, it automatically redirects using an HTTP GET.  How do I explicitly tell it to use an HTTP POST?  I have an action that accepts both GET and POST requests, and I want to be able to RedirectToAction using  POST and send it some values.  Like this:  this.RedirectToAction(     "actionname",     new RouteValueDictionary(new { someValue = 2, anotherValue = "text" }) );   I want the someValue and anotherValue values to be sent using an HTTP POST instead of a GET. Does anyone know how to do this? Parsing Command Prompt Output I am retrieving disk information via JavaScript with the wmic statement, wmic logicaldisk get freespace,name,size,volumename, which produces the following output, but in a single string.    "FreeSpace      Name  Size           VolumeName  " "560232755200   C:    999526756352   System      " "999369699328   D:    999558213632   SSD         " "1511570386944  E:    8001545039872  Get         " "4620751712256  F:    8001545039872  BR          " "788449492992   G:    4000650883072  Seen        " "2296009408512  H:    4000768323584  Seen 2      " "3594248679424  I:    8001545039872  2160        " "3507750227968  J:    8001545039872  1080        " "945300619264   K:    999625322496   Trailers    "   I parse the above output with the following JavaScript.  window.onload = function(){   const cp = require('child_process')   let drives   cp.exec('wmic logicaldisk get freespace,name,size,volumename', (error, stdout)=&gt;{     drives = stdout.trim().split('\r\r\n')       .map(value =&gt; value.trim().split(/\s{2,0}/))       .slice(1)   }) }   That JavaScript already produces my desired output. It produces an array of nested arrays. Each row of information in the command prompt output corresponds to a nested array. Each nested array has four values that correspond to the originally queried data points.  [   ["560232439808",  "C:", "999526756352",  "System"  ]   ["999369699328",  "D:", "999558213632",  "SSD"     ]   ["1511570386944", "E:", "8001545039872", "Get"     ]   ["4620751712256", "F:", "8001545039872", "BR"      ]   ["788449492992",  "G:", "4000650883072", "Seen"    ]   ["2296009408512", "H:", "4000768323584", "Seen 2"  ]   ["3594248679424", "I:", "8001545039872", "2160"    ]   ["3507750227968", "J:", "8001545039872", "1080"    ]   ["945300619264",  "K:", "999625322496",  "Trailer" ] ]   I am wondering whether or not there is a way to similarly parse the information, but with command prompt instead? $\mathbb R$ has the same cardinality of any interval When do I apply Significant figures in physics calculations? I'm a little confused as to when to use  for my physics class. For example, I'm asked to find the average speed of a race car that travels around a circular track with a radius of $500~\mathrm{m}$ in $50~\mathrm{s}$.  Would I need to apply the rules of significant figures to this step of the problem? $$ C = 2\pi (1000~\mathrm{m}) = 6283.19 $$  Or do I just need to apply significant figures at this step? $$ \text{Average speed} = \frac{6283.19~\mathrm{m}}{50~\mathrm{s}} = 125.664~\mathrm{m}/\mathrm{s} $$  Should I round $125.664~\mathrm{m}/\mathrm{s}$  to  $130~\mathrm{m}/\mathrm{s}$ since the number with the least amount of significant figures is two? How do you find out which program is using too much memory? Ubuntu has been crashing on me recently. I think its because it runs out of memory so I ran the free -m command and found that my memory usage was really high. So then, i ran top to find the culprit, but the displayed processes were using less than 1.5% of memory. How do I know which program is making ubuntu crash/run out of memory? Below is the output:  shafee@shafee-pc:~$ free -m              total       used       free     shared    buffers     cached Mem:          3824       3714        110          0        978       1954 -/+ buffers/cache:        780       3044 Swap:           99          0         99  shafee@shafee-pc:~$ top top - 02:12:14 up  1:24,  2 users,  load average: 0.16, 0.42, 1.49 Tasks: 182 total,   1 running, 181 sleeping,   0 stopped,   0 zombie Cpu(s):  2.9%us,  1.9%sy,  0.3%ni, 79.3%id, 15.5%wa,  0.0%hi,  0.2%si,  0.0%st Mem:   3916708k total,  3803848k used,   112860k free,  1002308k buffers Swap:   102396k total,        0k used,   102396k free,  2001852k cached    PID USER      PR  NI  VIRT  RES  SHR S %CPU %MEM    TIME+  COMMAND              4200 root      20   0  289m  53m  38m S    2  1.4   1:06.45 Xorg                 5590 shafee    20   0 19348 1368  956 R    2  0.0   0:00.01 top                     1 root      20   0 24124 2136 1264 S    0  0.1   0:02.05 init                    2 root      20   0     0    0    0 S    0  0.0   0:00.00 kthreadd                3 root      20   0     0    0    0 S    0  0.0   0:24.23 ksoftirqd/0             6 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/0             7 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/1             9 root      20   0     0    0    0 S    0  0.0   0:00.11 ksoftirqd/1            11 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/2            13 root      20   0     0    0    0 S    0  0.0   0:03.89 ksoftirqd/2            14 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/3            16 root      20   0     0    0    0 S    0  0.0   0:00.16 ksoftirqd/3            17 root       0 -20     0    0    0 S    0  0.0   0:00.00 cpuset                 18 root       0 -20     0    0    0 S    0  0.0   0:00.00 khelper                19 root       0 -20     0    0    0 S    0  0.0   0:00.00 netns                  21 root      20   0     0    0    0 S    0  0.0   0:00.01 sync_supers         shafee@shafee-pc:~$   Or is it normal to have 110mb of free memory and is my issue related to something else? Sort Order on Close Vote Queue The Close-Vote queue is large and growing. I searched for definitive information on how that queue is sorted for reviewers, and the nearest I could find is that it is randomized - but that post was some years old.  Would it be possible to sort on order of votes already received? That is, all questions with 4 votes to close are surfaced first (in random order) to reviewers? Questions with 3 votes would come up before ones with 2, etc. In that manner a given question gets out of 'will it close?' limbo faster.   This feature request would, in my opinion, be supportable if the majority of reviewer votes were going to single-vote questions. I cannot (I think) actually find these numbers. If this is the case, the majority of the work is going to an ever-increasing queue, and proportionally fewer votes are being resolved.  Note there are other distributions that could help get in this direction without being a strict ordering, like weighting the chance a given question is surfaced to a reviewer by the number of votes. However, for discussion purposes I thought I'd keep it simple.  Usual apology if this has actually been addressed. Search is sad-making. I am trying to prove the following statement.     If a field $K$ is not algebraically closed, then any $K$-variety $V\subset\mathbb{A}^n$ can be written as the zero set of a single polynomial in $K[X_1,X_2,...,X_n].$     Suppose $V=V(f_1,f_2,...,f_n)$, and I would want to find a polynomial $g\in K[X_1,X_2,...,X_n]$ such that $V=V(g)$.  I know that if I can find a polynomial $\phi\in K[X_1,X_2,...,X_n]$ whose only zero is $(0,0,...,0)$, then it is done, since we could take $g=\phi(f_1,f_2,...,f_n)$.  For $n=1$, then I would just choose $\phi=X$, but I do not even know how to proceed to the case $n=2$. Maybe we could choose an irreducible polynomial of degree $&gt;1$.  Any help will be appreciated. In thinking about Sturm-Liouville theory a bit I see I have no actual idea what is going on.  The first issue I have is that my book began with the statement that given  $$L[y] = a(x)y'' + b(x)y' + c(x)y = f(x)$$  the problem $L[y] \ = \ f$ can be re-cast in the form $L[y] \ = \ \lambda y$.  Now it could be a typo on their part but I see no justification for the way you can just do that!  More importantly though is the motivation for Sturm-Liouville theory in the first place. The story as I know it is as follows:  Given a linear second order ode   $$F(x,y,y',y'') = L[y] = a(x)y'' + b(x)y' + c(x)y = f(x)$$  it is an exact equation if it is derivable from a differential equation of one order lower, i.e.  $$F(x,y,y',y'') = \frac{d}{dx}g(x,y,y').$$  The equation is exact iff  $$a''(x) - b'(x) + c(x) = 0. $$  If $F$ is not exact it can be made exact on multiplication by a suitable integrating factor $\alpha(x)$.  This equation is exact iff  $$(\alpha(x)a(x))'' - (\alpha(x)b(x))' + \alpha(x)c(x) = 0 $$  If you expand this out you get the Adjoint operator  $$L^*[\alpha(x)] \ = \ (\alpha(x)a(x))'' \ - \ (\alpha(x)b(x))' \ + \ \alpha(x)c(x) \ = 0 $$  If you expand $L^*$ you see that we can satisfy $L \ = \ L^*$ if $a'(x) \ = \ b(x)$ &amp; $a''(x) \ = \ b'(x)$ which then turns $L[y]$ into something of the form  $$L[y] \ = \ \frac{d}{dx}[a(x)y'] \ + \ c(x)y \ = \ f(x).$$  Thus we seek an integratiing factor $\alpha(x)$ so that we can satisfy this &amp; the condition this will hold is that $\alpha(x) \ = \ \frac{1}{a(x)}e^{\int\frac{b(x)}{a(x)}dx}$  Then we're dealing with:  $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ \alpha(x)c(x)y \ = \ \alpha(x)f(x)$$  But again, by what my book said they magically re-cast this problem as  $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ \alpha(x)c(x)y \ = \ \lambda \alpha(x) y(x)$$  Then calling  $$\frac{d}{dx}[\alpha(x)a(x)y'] \ + \ ( \alpha(x)c(x)y \ - \ \lambda \alpha(x) )y(x) \ = \ 0$$  a Sturm-Liouville problem.  My question is, how can I make sense of everything I wrote above? How can I clean it up &amp; interpret it, like at one stage I thought we were turning our 2nd order ode into something so that it reduces to the derivative of a first order ode so we can easily find first integrals then the next moment we're pulling out eigenvalues &amp; finding full solutions - what's going on? I want to be able to look at $a(x)y'' \ + \ b(x)y' \ + \ c(x)y \ = \ f(x)$ &amp; know how &amp; why we're turning this into a Sturm-Liouville problem in a way that makes sense of exactness &amp; integrating factors, thanks for reading! We roll a die until each side appears at least once, then we stop.     What is the probability of rolling exactly $n$ dice?   I guess the answer is  $$6-6\left(\dfrac{5}{6}\right)^n\;,$$  but this may be wrong.  In trying to solve this problem, I read , but I couldn't solve the problem. How many triples $(x,y,n)$ are there such that $x^n - y^n = 2^{100}$ Recently when skimming through my physics-text I encountered an interesting definition of Force $$F(x) = -\frac{\mathrm dU(x)}{\mathrm dx}$$  We were taught that some functions are continuous but not differentiable. So for the force to exist $U(x)$ has to be differentiable. So how can we prove that $U(x)$ is differentiable everywhere? How to add coloured line before caption? A simple inequality for floor function Thailand visa exemption: any rule limiting number of entries per year? The only place I am aware of is the . Which is correct: "drive safe" or "drive safely"? When someone is going to drive their car somewhere, I always used to say "drive safely" to them. Recently I was told I should say "drive safe."    (From: )   Which one is correct?  Similarly, is "do good" correct? What is "all" in isset($wp_filter['all']) I'm a newbie in WordPress. I'm trying to understand how it generates the XHTML pages. I guess it's the function of do_action( 'hook-name' ) , but I'm stuck with the understanding of the instruction isset( $wp_filter['all] ) when reading the function do_action because I don't understand what is the meaning of the word all.  Is it a PHP feature or a WordPress one? We have an Always On "cluster" that consists of 2 servers (there will be more), so one is PRIMARY and other(s) is(are) SECONDARY. The idea was to dedicate SECONDARY as a readonly replica, so it would be a somewhat search-server.  I do know how to set ConnectionString in the C# so it will use SECONDARY replica - just add ApplicationIntent=ReadOnly.  But I don't understand how to address the SECONDARY from stored procedure if I'm using distributed query. Is there a way to set some parameters to the query (like WITH statements or something), so query would use only replica and not the PRIMARY node?  The thing is, obviously from the start server1 is PRIMARY and server2 is SECONDARY, but when server1 fails then server2 is PRIMARY and server1 will be SECONDARY after it get fixed. So I cannot just use the static server2's name.  So far I've managed to get current replica's server name as a variable and use it in EXEC:  -- find first available replica DECLARE @replicaServer nvarchar(50)  SELECT TOP 1     @replicaServer = RCS.replica_server_name FROM     sys.availability_groups_cluster AS AGC     INNER JOIN sys.dm_hadr_availability_replica_cluster_states AS RCS           ON RCS.group_id = AGC.group_id     INNER JOIN sys.dm_hadr_availability_replica_states AS ARS           ON ARS.replica_id = RCS.replica_id     INNER JOIN sys.availability_group_listeners AS AGL           ON AGL.group_id = ARS.group_id WHERE ARS.role_desc = 'SECONDARY'       AND connected_state = 1  -- and query it DECLARE @cmd nvarchar(MAX) = 'SELECT * FROM [' + @replicaServer + '].[somebase].[someschema].[sometable]' EXEC (@cmd)   But that's a shame, I guess.