How can I display a string like ]]> in XML ? I tried using normal XML and CDATA, but in XML it doesn't show anything while in CDATA it gives an error.
I was wondering if there is any way to escape a CDATA end token (]]&gt;) within a CDATA section in an xml document. Or, more generally, if there is some escape sequence for using within a CDATA (but if it exists, I guess it'd probably only make sense to escape begin or end tokens, anyway).   Basically, can you have a begin or end token embedded in a CDATA and tell the parser not to interpret it but to treat it as just another character sequence.  Probably, you should just refactor your xml structure or your code if you find yourself trying to do that, but even though I've been working with xml on a daily basis for the last 3 years or so and I have never had this problem, I was wondering if it was possible. Just out of curiosity.  Edit:  Other than using html encoding...
Here's an example question from the :     On the last day of a one-week sale, customers numbered 149 through 201 were waited on. How many customers were waited on that day?   Possible answers: 51, 52, 53, 152, 153.   The correct answer here is 53, which is the result of (201-149) + 1 = 53.  What's the reasoning in adding the +1? Note: This is intended to become a canonical post.  I got a dedicated graphics card of type XXX and it claims I need at least a YYY Watt PSU.   How big does my PSU really need to be? How can I disable the "Open File Security Warning" when I want to run downloaded executable files? A fair coin is tossed $10$ times. What is the probability that no two   consecutive tosses are heads?   Possibilities are (dont mind the number of terms):  $H TTTTTTH$, $HTHTHTHTHTHTHT$.  But except for those,  let $y(n)$ be the number of sequences that start with $T$  $T _$, there are two options, $T$ and $H$ so,  $y(n) = y(n - 1) + x(n-1) = y(n - 1) + y(n - 2)$  Let $x(n)$ be the number of sequences that start with $H$,   $H _$ the next option is only $T$ hence,  $x(n) = y(n - 1)$   The total number of sequences $F(n)$ is:  $$F(n) = y(n) + x(n) = 2y(n - 1) + y(n - 2)$$  We are after $F(10)$,  $$F(10) = 2y(9) + y(8)$$  $$F(3) = 2y(2) + y(1) = 1 + 4 = 5$$  $$F(4) = 2y(3) + y(2) = 6 + 2 = 8$$  But I'm not quite sure where this will take me though. If I have an object implementing the Map interface in Java and I wish to iterate over every pair contained within it,  what is the most efficient way of going through the map?  Will the ordering of elements depend on the specific map implementation that I have for the interface? Proving that if $ad-bc = \pm 1$, then $\gcd(x,y) = \gcd(ax +by, cx + dy)$ I'm having issues figuring out how to approach this problem:     Conclude that if $ad-bc = \pm 1$, then   $$\gcd(x,y) = \gcd(ax +by, cx + dy)$$   The fact that $\gcd(x,y) = \gcd(x+ky, y)$ is a very special case of this exercise   I believe there is a property that if $a = bq_1 + 0$ where 0 is r, then b divides a, and $b=\gcd(a,b)$  Is that at all relevant in this case? This is a question that keeps bothering me: much of mathematics was created by extending rules to new domains e.g. negative numbers were created by consistently extending arithmetic beyond positive integers. However, with number bases it seems impossible to do this. Number bases are integers, but could they be rational numbers? I've had previous discussions about this, see . One problem can be seen with this example: in base 2.5, 0.22 is greater than one. That's not what we want! What, if anything, can be done about this?  EDIT: To put it another way - if every positional number is less than any digit to its left, why doesn't this apply to fractional base positional numbers? I know how to CALCULATE dot product, but still don't understand MEANING of it.  I mean, If I have to explain vector addition I would say that "Sum of two vectors give you the third vector that has the same effect as other two combined"  But I don't know how to explain dot product. For example we have two vectors: v=(3,1) and w=(2,4). Dot product of these two is 3*2 + 1*4 = 10. What does this result (10) tell us? Proof of $\sin nx=2^{n-1}\prod_{k=0}^{n-1} \sin\left( x + \frac{k\pi}{n} \right)$ I have seen this identity on Wolfram mathworld and in a comment to another similar trigonometric proof:    I can't seem to find a proof to this identity online anywhere. What method is used to prove this? $TT^*=T^2$, show that $T$ is self-adjoint Let $V$ be an inner product space, finitely generated over $\mathbb{C}$, $T\in \operatorname{End}(V)$ that satisfies $TT^*=T^2$, show that $T$ is self-adjoint.    I know that $TT^*$ is positive so has positive square-root, thus the square root is positive definite. But I don't feel like this is a proof. Can anyone prove it without considering square root? Given a polynomial $f(x)$ with integral coefficients and $f(x) = 37$ has 5 distinct integral roots, find the number of integral roots of $f(x) = 41$?  My Approach: Say $f(x) = (x-r_1)(x-r_2)(x-r_3)(x-r_4)(x-r_5)g(x) + 37$, where $r_i$ are the distinct integers.   Now for $f(x) = 41$ we have $(x-r_1)(x-r_2)(x-r_3)(x-r_4)(x-r_5)g(x) = 4$, so the factors can be $\pm 1, \pm2$ or $\pm 4$. Given $r_i$ are distinct at most two of them will give $\pm1$, then there can be both of $\pm 2$ or one of $\pm 4$. This is where I get lost, since even if I use all of $\pm1, \pm2$, I will be still be left with one $x-r_i$ factor. What about that? Does it matter that 37 and 41 are primes, or is it just a coincidence?  Thanks in advance. Discrepency in unanswered questions counts On , I notice that if I use the lower &quot;unanswered&quot; tab (the one in line with &quot;All Questions&quot;), the count is 1,432 questions. If I use the upper &quot;Unanswered&quot; tab (in line with the site title), I get 1,383 &quot;questions with no upvoted or accepted answers&quot;.  This changes the options in the lower tab, one of which is &quot;no answers&quot;.  Clicking here, I now get 1,083 &quot;questions with no answers&quot;. If I run select Id from Posts where PostTypeId=1 and AnswerCount=0;  in the , I get 1158 rows back. Which of these is correct, and why is the first one (1,432) so much higher than the others?  I understand that the numbers may only be updated periodically, but that difference in particular seems much too great for this to be the reason. To clarify:  1,432 is the number of &quot;unanswered questions&quot;. 1,383 is the number of &quot;questions with no upvoted or accepted answers&quot;. 1,083 is the number of &quot;questions with no answer&quot; 1,158 is the number of questions with no answer in the data explorer.  This is not live data, but that means it should be smaller, not larger, than 1,083.  I promise we did not offset this with answers to the tune of 80 questions this week.  The first three are obviously live because they fluctuate. The difference between the first two is ~50, implying they actually don't refer to the same thing, and the difference between the last two seems too great (and in the wrong direction) to be explained by the a live vs. data explorer source. Why does "Object reference not set to an instance of an object" not refer the variable name or column? $\sum_{i=1}^n(a_i)\sum_{i=1}^n(\frac{1}{a_i})\ge n^2$ is what I want to prove, where $a_i&gt;0$ and I need to showwhen equality holds.  I have tried using Cauchy-Schwarz, where inside the sums I multiply each value by 1 to do it but it doesn't work out.  I have also done  $\sum_{i=1}^n(a_i)\sum_{i=1}^n(\frac{1}{a_i})=\sum_{i=1}^n \sum_{i=1}^n(\frac{a_i}{a_i})=\sum_{i=1}^n\sum_{i=1}^n(1)=\sum_{i=1}^n(n)=n^2$, but this proves an equality.  Am I not allowed to do the first step I did in my work? The particle number on my settings appear in gray, I don't think i'm able to change the number even thought i need it, how can i make it white again? Converting GeoPDF to vector format like CAD or shapefile? I want to convert a GeoPDF that has vectors entity in it to a vector format and preserve the real coordinates of these vectors. The GeoPDF has been exported from ArcMap and has layers in it.  I have try GDAL, but it rasterize the PDF before exporting it. Which is not good for me. Also I don't want a solution that would convert this image back to vectors, too complicated for the data I have.  Is someone aware of any tool that can do that? The resulting format can be a CAD file or a shapefile or anything that is a vector format. Do accepted answers still serve a useful purpose? In the Stack Exchange voting system, we have two classes of votes: standard up / down votes that anyone can cast, and special  that only the asker can.   Although accepting an answer does not always pin it at the top of the answer list, that green check mark does  about the correctness of the answer. This gives a single person much greater weight than the rest of the community. That green check mark can seem confusing to visitors, who see  or  answers marked as being correct. I've heard this from several friends recently who were surprised when they came across factually wrong answers that had been downvoted, yet still had that check mark next to them.  Moderators regularly field flags from even more experienced users who demand that the accepted answer be changed from one that is incorrect or even harmful to another. We decline these, because we're not supposed to be making technical judgments like that and because we have no way of accepting answers on behalf of the asker. However, these flags do show that some people have problems with the presentation of accepted answers vs. the community voting on all the others.  There's also all the fun that came with arguments over accept rate, and people badgering askers to accept their answers.   Questions on the Stack Exchange network are intended to be broadly useful, to help out many others in the future beyond the person asking the question. If that's our goal, why should the person asking the question have any more say than the rest of the world? If it's a broadly applicable question, why should one person be able to highlight something as correct simply because they asked it first?  I guess what I'm asking is: if we did away with accepted answers, converting them to upvotes where appropriate, and only let community voting sort out the best answers, would we lose something important? I thought I'd ask after reading  to , because I wasn't sure how I felt about accepted answers anymore. Looking for a powershell script that can pull a file from a set of PC's and FTP I'm looking to write a script (preferably powershell) that will essentially copy a file from a bunch of PC's and FTP it to a server.   So the structure of the environment is that we have a file on multiple PC's (around 50 or so) that need to placed on a server. Sometimes one of the PC's may be turned off so the script would first need to ensure the PC is up and running (maybe a ping result), then it would need to go into a directory on that PC, pull a file off of it, rename the file, place into a source directory, then remove the file. Naming convention doesn't matter, but date/time stamp would be easiest. Ideally, it would be best to first move all the files to a source directory to save on FTP bandwidth, but since the files will be named the same, the files must be renamed during the move process. Move not copy because the directory needs to be empty so the file can be re-created the next day. So once moved to the source directory, now all the files need to be FTP'd to a server for processing.   After all of this, we need to know which PC's on the list did not respond so we can manually retrieve the file so the script should output a file (txt is fine) that will show which PC's were offline.   Everything is one domain and script will be run from an server with admin creds.   Thank you! Remote Linux server to remote linux server dir copy. How? What is the best way to copy a directory (with sub-dirs and files) from one remote Linux server to another remote Linux server? I have connected to both using SSH client (like Putty). I have root access to both. Perl - Package/Module Issues