My T-SQL query generates following result set  ID        Date 756 2011-08-29 756 2011-08-31 756 2011-09-01 756 2011-09-02   How can I convert like this  ID                Date 756 2011-08-29, 2011-08-31, 2011-09-01, 2011-09-02   Any suggestion would be appreciated.
Consider a database table holding names, with three rows:  Peter Paul Mary   Is there an easy way to turn this into a single string of Peter, Paul, Mary?
How to prove that $\lim\limits_{h \to 0} \frac{a^h - 1}{h} = \ln a$ In order to find the derivative of a exponential function, on its general form $a^x$ by the definition, I used limits.  $\begin{align*} \frac{d}{dx} a^x &amp; = \lim_{h \to 0} \left [ \frac{a^{x+h}-a^x}{h} \right ]\\  \\ &amp; =\lim_{h \to 0} \left [ \frac{a^x \cdot a^h-a^x}{h} \right ] \\  \\  &amp;=\lim_{h \to 0} \left [ \frac{a^x \cdot (a^h-1)}{h} \right ] \\  \\ &amp;=a^x \cdot \lim_{h \to 0} \left [\frac {a^h-1}{h} \right ] \end{align*}$  I know that this last limit is equal to $\ln(a)$ but how can I prove it by using basic Algebra and Exponential and Logarithms properties? Thanks Proof that the set of all possible curves is of cardinality $\aleph_2$? I am reading George Gamow's book  and a certain assertion Gamow makes seems a little startling considering what I already know of the subject of infinite cardinality.     But the number of all geometrical points, though larger than the number of integer and fractional numbers, is not the largest one known to mathematicians. In fact it was found the variety of all possible curves, including those of the most unusual shapes, has a larger membership than the collection of all geometric points, and thus has to be described by the third number in the infinite sequence. [Gamow, 22]   He later does explicitly say the number of all possible curves is $\aleph_2$. But nowhere else can I find reference to this being true, nor does he provide any sort of reasoning to its validity.  My question is how can you prove the set of all possible curves is of cardinality $\aleph_2$ and not $\aleph_1$ or $\aleph_0$? how to change my hostname? My hostname is localhost, reported by hostname command, and terminal prompt root@localhost:~#.  How can i change it to mismis.com with mismis alias? and what is the proper configuration.  I confused after reading some articles on web.  My /etc/hosts:  127.0.0.1       localhost 127.0.1.1       srv345.myweb.com      srv345 178.162.231.61  janstone.mismis.com    janstone # The following lines are desirable for IPv6 capable hosts ::1     localhost ip6-localhost ip6-loopback fe00::0 ip6-localnet ff00::0 ip6-mcastprefix ff02::1 ip6-allnodes ff02::2 ip6-allrouters I'm writing a java app using eclipse which references a few external jars and requires some config files to be user accessable.   What is the best way to package it up for deployment? My understanding is that you cant put Jars inside another jar file, is this correct? Can I keep my config files out of the jars and still reference them in the code? Or should the path to the config file be a command line argument? Are there any third party plugins for eclipse to help make this easier? I'm using an ant build file at the moment but I'm not sure I know what I'm doing. Is there an equivelent of the deployment projects in Visual studio, that will figure out everything you need and just make an installer? I've used install4j before, and it was powerful if no where near as automated as  .Net deployment projects.   Cheers. Beamer Presentation: Figure has no number? I am giving a presentation and therefore I am using the  class. I have included some figures and it works, but there is no number after "Figure".  My code:  \documentclass{beamer}  \usepackage{graphicx} \usepackage[latin1]{inputenc} \usepackage[T1]{fontenc} \usepackage[english]{babel} \usepackage{listings} \usepackage{xcolor} \usepackage{eso-pic} \usepackage{mathrsfs} \usepackage{url} \usepackage{amssymb} \usepackage{amsmath} \usepackage{multirow} \usepackage{hyperref} \usepackage{booktabs} \usepackage{wallpaper} \usepackage{bbm} \usepackage{cooltooltips} \usepackage{eso-pic} \usepackage{everyshi} \usepackage{calc} \usepackage{graphicx} \usepackage{ifthen} \usepackage{graphicx} \usepackage{wrapfig} \usepackage{animate} \usepackage[singlespacing]{setspace} \usepackage[absolute,overlay]{textpos} \usepackage{enumerate} \usepackage{hyperref} \newenvironment{changemargin}[2]{%   \begin{list}{}{%     \setlength{\topsep}{0pt}%     \setlength{\leftmargin}{#1}%     \setlength{\rightmargin}{#2}%     \setlength{\listparindent}{\parindent}%     \setlength{\itemindent}{\parindent}%     \setlength{\parsep}{\parskip}%   }%   \item[]}{\end{list}}  \setbeamercolor{frametitle}{fg=red,bg=white}  \hypersetup{pdfpagemode=FullScreen} \renewcommand*{\UrlFont}{\normalfont}  \usetheme{Goettingen} \useinnertheme{circles} \beamertemplatenavigationsymbolsempty  \setbeamerfont{page number in head/foot}{size=\large} \setbeamertemplate{footline}[frame number]   %%% \begin{document}  \frame[plain]{ \titlepage }  \setbeamertemplate{background canvas}[default]  \frame{ \frametitle{}  \begin{figure} \begin{center} \includegraphics[scale=0.2]{varweakness} \caption{VaR as a quantile} \end{center} \end{figure}  }   \end{document}   Which gives the following frame with the figure:    (I am not sure what is causing the problem, therefore I did not delete any package.)  How can I get a number, e.g. Figure 1:? Trisect a quadrilateral into a $9$-grid; the middle has $1/9$ the area Trisect sides of a quadrilateral and connect the points to have nine quadrilaterals, as can be seen in the figure. Prove that the middle quadrilateral area is one ninth of the whole area. Making an MFC application international I've got several large MFC applications here, and converting them into any other format is out of the question.  We're expanding into other markets, and would like to make the apps work in other languages and cultures.  So far, I've found occasional references as to what to do with Visual C++ version 6, with one mention that later versions of MFC have additional relevant features.  Searching MSDN gives me instructions on how to convert the apps to Unicode, which we already did.  I found nothing on MSDN on how to make languages multilingual once they're in Unicode, only a few older things using Google, and one book about internationalization using VC++6.  (We're using Visual Studio 2008 now, on XP and Vista.)    I make no claims for the strength of my Google-fu, and would be happy to be directed to things I've missed.  Is it reasonable to use the methods of VC++6, or should I use later features?  If I should use features later than that, where can I find some reference to them?  Is there something I should worry about other than setting the locale, converting all strings to resources, and duplicating resources in different languages?  I can find more things about .NET internationalization, but I'm inexperienced in .NET.  What will I find there that's applicable to VC++ and MFC?  Edit:  I just ran into difficulties trying to put Unicode strings into the String Table resource.  (As far as I can tell, Unicode strings need to be entered into the .rc file with a text editor, in L"0x0034" form.  I haven't found a resource editor way to do that.)  Any tips on that?  Any other resource I can use in VS2008 using VC++ and MFC?  Edit:  Somebody on a Microsoft forum suggested that I open the offending .rc file in Notepad, and save it in Unicode.  Unfortunately, this doesn't seem to fix the dialogs, although the stringtable seems to be working in Japanese. Every once in a while, someone comes to Meta to report a bug about something not working and it turns out that person is visiting one of the network sites over HTTPS/SSL. The problem has been growing since browsers started to outright block mixed content instead of showing a warning.  The usual answer is that HTTPS is not yet fully supported, and the person should try again using HTTP. Sometimes things get fixed, improving the situation a bit.  Is there a roadmap for full support? Partial support has been there for  now.  Is this actively being worked on? If not, what are the reasons to partially support it instead of disabling it completely to avoid these problems? For which positive integer values of $n$ does $a|mn-b?$ I am taking a number theory class, and I was not able to solve this homework problem.   Let $a,$ $b,$ and $m$ be constant positive integers. For which positive integer values of $n$ does $a|mn-b?$   I tried this out for a couple of values, and the values of $n$ satisfying this expression seem to occur in a cycle.  (For example, let $m=2019,$ $a=20,$ $b=19.$ The values of $n$ that work are $1,21,41,61,....$) However, I am not able to show that this always happens. I have a midterm coming up and on the past exams the hard question(s) usually involve some form of $\lim_{x\to0^{+}} x \ln x$. However, we're not allowed to use l'Hopital's rule, on this year's exam anyways.  So how can I evaluate said limit without l'Hopital's rule? I got somewhere with another approach, don't know if it's useful:   $\lim_{x\to0^{+}} x \ln x = \lim_{x\to0^{+}} x^2 \ln (x^2) = L$ $= (\lim_{x\to0^{+}} 2x)(\lim_{x\to0^{+}} x \ln x)$ $= 0 * L$   Then I just need to prove that L is finite/exists (which means it must be 0) How do I add new wallpapers? I have Ubuntu 11.10 installed and want to download and install additional wallpapers on my desktop.   How do I do this? I was using the amspset document class for generating exam practice problems. I had wanted to add some referencing to the problems so I started a new counter like this (adapted from some Tex Exchange post)  \newcounter{P} \newcommand{\plb}[1]{\refstepcounter{P}\label{#1} \textbf{P-\ref{#1}.}}  \begin{problem} \plb{p1} A parallel-wire transmission line is constructed of \#6 AWG copper wire (diameter $d=0.162$ in., conductivity $\sigma_c=5.8\times 10^7$ S/m) with a 12-inch separation in air. Assuming no leakage between the two wires, find $R'$, $L'$, $G'$, and $C'$. Assume a working frequency of 1 MHz. \end{problem}  \begin{solution} Using Table.~\ref{tab:tlparam} and Fig.~\ref{fig:tlempl},  \[ Rs = \sqrt{\pi f \mu_c/\sigma_c} = 2.61\times10^{-4}~ \Omega\] \[ R' = \frac{2R_s}{\pi d} = 4.04\times10^{-2} ~\Omega\text{/m} \] \[ L' = \frac{\mu_0}{\pi} \ln{\frac{2D}{d}}=2.0~\mu \text{H/m} \] \[ C' = \frac{\pi \epsilon}{\displaystyle\ln{\frac{2D}{d}}}=5.56 ~\text{pF/m} \] $G'=0$ because the problem states that there is no leakage between the two wires. \end{solution}  \begin{figure}[ht] \begin{centering}     \includegraphics{fig24}     \caption{(Fig.2-4 from FAE) A few examples of transmission lines.} \end{centering} \label{fig:tlempl} \end{figure}  \begin{table}[ht] \caption{(Table 2-1 from FAE)Transmission-line parameters $R'$, $L'$, $G'$, and $C'$ for three types of lines.}     \begin{tabular}{c}         \hspace{3cm}\includegraphics{tb21}     \end{tabular} \label{tab:tlparam} \end{table} ... and more   Now all the figure references stop working, I get "Fig. " instead of "Fig. 1". The table references are alright though. Any idea what the problem could be? How do I Enqueue styles/scripts on Certain /wp-admin Pages? I have two simple functions that load stuff using  and , something like these:  function admin_custom_css() { wp_enqueue_style( 'stylesheet_name', 'stylesheet.css') };   function admin_custom_js  { wp_enqueue_script( 'javascript_file', 'script.js') };   ... and a few admin pages, created with  and   function my_menu() {    add_menu_page('Page 1', 'bar', 'something', 'else', 'foo');    add_submenu_page( 'theme_menu', 'Subpage 1', 'Subpage', 'something', 'else', 'foo');  } add_action('admin_menu', 'my_menu');    How do I load my two functions only on these pages?  Right now I'm using:  add_action('admin_init', 'admin_custom_css' );  add_action('admin_init', 'admin_custom_js' );     But it loads my files on every admin page, which is not nice at all.  Can I do this via one simple line in functions.php or have to enqueue them within my pages separately (I prefer the first option strongly, since I'd have to edit a lot of admin-page-creating-functions).  Thanks! .NET How to check if path is a file and not a directory? I have a path and I need to determine if it is a directory or file.    Is this the best way to determine if the path is a file?  string file = @"C:\Test\foo.txt";  bool isFile = !System.IO.Directory.Exists(file) &amp;&amp;                           System.IO.File.Exists(file);   For a directory I would reverse the logic.  string directory = @"C:\Test";  bool isDirectory = System.IO.Directory.Exists(directory) &amp;&amp;                              !System.IO.File.Exists(directory);   If both don't exists that then I won't go do either branch.  So assume they both do exists. Dynamic date range query I'm trying to create two cells that will update my query: A >= date"A1" and A &lt;= date "B1".  My goal is to create a search page for the data, where the end user could insert a date or the =today() function and it would update the query. I am currently getting a formula parse error from:  =QUERY(Data!6:1397,"SELECT A,B,C,D,E,F,G,H,I,J,K,L WHERE A &gt;= date"A1"and  A &lt;= date"B1"") Numerical partial derivative What do I call someone who marries or has a sexual relationship with someone much younger than themselves? Their partner is someone who is at least 18 years old.    The term paedophile is not the correct word, because it refers to minors. No internet connection after ubuntu server 20.04 install, ifconfig not available I recently installed Ubuntu Server 20.04 LTS on my desktop, and found out there was no internet connection even though I had the LAN cable connected. ifconfig and iwconfig failed saying the corresponding packages net-tools and wireless-tools were not installed.   EDIT  Here is the info requested. Please find the image I came across a combinatorial proof of the Fermat's Little Theorem which states that    If $p$ is a prime number then the number ($a$$p$-$a$) is a multiple of $p$ for any natural number $a$.  Let me write down the proof.    PROOF  We have pearls of $a$ colours . From these we make necklaces of exactly $p$ pearls .   First,we make a string of pearls . There are $a$$p$ different strings.If we throw away  the $a$ one one -coloured pearls  ($a$$p$-$a$) strings will remain.We connect the ends of each string to get necklaces.We find that two strings that differ only by a cyclic permutation of its pearls result in indistinguishable necklaces.But there are $p$ cyclic permutations of $p$ pearls on a string . Hence the number of distinct necklaces is    [($a$$p$-$a$)/$p$].  Because of this interpretation this is an integer.Thus ($a$$p$-$a$) is a multiple of $p$ for any natural number $a$. [HENCE PROVED]     MY CONFUSIONS    What is the use of the fact that $p$ is a prime in this proof?  If this proof is true then why is this not true for every positve integer $p$? How do I implement a retro-style password-based "savegame" system?