Unique Canonicals for related product Webpages
Should I use a canonical link which refers to the current URL with pagination?
In HP-UX server, grep -r option is not working In unix server grep -r option is not working. OS is HP-UX.  If grep -r is not working any alternative way to do recursive search without -r option? Is there a way to disable file:/// protocol in google chrome?  Is there some option, or some switches that can disable this feature?  Please help I'm looking for a quick start or template, or something, to get a web site's basic layout done quickly and looking fairly professional, and then let me do the coding.  I don't want a CMS, as this is for a highly customised reporting application, but I need something like frame header and two columns and frame footer.  I can design the pretty reports for the wide right hand column myself, as the left hand column menu. I want to burn Ubuntu Minimal CD ISO to an old, 1 GB USB thumbdrive. Regular ISO doesn't fit. I already tried Startup Disk Creator and Unetbootin but both failed. I tried installing GRUB and pointing it to boot like this:  insmod part_msdos linux /linux initrd /initrd.gz   but it doesn't work. I also tried dd but I ended up with not bootable drive.  Rufus worked on Windows with the same thumbdrive but I no longer use Windows.  What else can I do? In SF1, Stop refreshing the embedded vf page on a layout Below is my VF page which is embedded on a layout. In SF1 mobile app, it's getting refreshed whenever we touch on it. How can I avoid refreshing the VF page while touching it on the screen? In Desktop it's working fine. Please provide your inputs. &lt;apex:page standardController=&quot;PremiseObj__c&quot; lightningStylesheets=&quot;true&quot;&gt; &lt;apex:includeLightning /&gt; &lt;apex:slds /&gt; &lt;div id=&quot;premiseServDetails&quot;&gt; &lt;/div&gt; &lt;script&gt; window.onload = function (){     $Lightning.use(&quot;c:PremiseObjUpdateApp&quot;, function() {         $Lightning.createComponent(&quot;c:PremiseObjUpdatecmp&quot;,                                    {                                         recordId : &quot;{!Premiserecord__c.Id}&quot;                                     },                                    &quot;premiseServDetails&quot;,                                    function(cmp,event) {                                        setTimeout(function() {                                            //document.getElementById('loading').style.display = 'none';                                        }, 3000);                                    });     }); } &lt;/script&gt; &lt;/apex:page&gt; I generally defrost meat on the kitchen counter. A friend of mine suggested that this was dangerous and suggested that I defrost meat in the refrigerator. I am no biologist but it seems to me that as long as the meat doesn't get warm defrosting it on the counter should be safe.  Generally, I remove the frozen items from the freezer and place them on a plate on the counter in the packaging they were frozen in. When they are mostly / completely thawed I place the meat in the refrigerator.  Am I wrong and should I be defrosting in the refrigerator? How do I prevent the blank screensaver when using keyboard shortcut to lock the computer? In the current era of cricket, we see batsmen using switch hits to play a ball. That is, while playing a ball they change their batting side (left to right handed and vice versa) just before the ball comes to them.  My question is, can a bowler bowl a switch ball? Meaning, can a left hand bowler bowl right handed to a batsman? If it is not permitted, then is it not unfair to the bowlers that batsmen can change their batting style but not the bowlers? Or are there are any rules against a switch hit? Let $(X, \mathcal{T})$ be a metrizable space. Prove that $X$ Lindelöf   implies that $X$ is separable.   My attempt:  Let $d$ be the metric that induces the topology $\mathcal{T}$.   For every $n \geq 1$, consider the open cover: $$\{B_X(x,1/n)\mid x \in X\}$$  Because the space is Lindelöf, this implies that for every $n \geq 1$, there is a countable (or finite) subcover given by $$\mathcal{B}_n:= \{B_X(x,1/n) \mid x \in I_n, |I_n| \leq |\mathbb{N}|\}$$  Now, define $D:= \bigcup_{n\geq 1} I_n$. Let $y \in X$. Let $\epsilon &gt; 0$. Choose $m$ a positive integer so large that $1/m &lt; \epsilon$.  Because $y\in X =\bigcup\mathcal{B}_m$, it follows that there exists $x \in D$ such that $y \in B_X(x,1/m)$, meaning that $d(x,y) &lt; 1/m &lt; \epsilon$, such that $x \in B_X(y, \epsilon) \cap D$. Hence, $y \in \overline{D}$ and it follows that $D$ is a dense countable set in $X$, such that $X$ is separable.  Is this correct? What is the standard interpretation of the order of operations for an expression involving some combination of grouping symbols, exponentiation, radicals, multiplication, division, addition, and subtraction? Yes,  but there must be a canonical or most efficient or most concise way. I'll add answers I know of and see what percolates to the top.  To be clear, the question is how best to read the contents of a file into a string. One solution per answer. Cloning an SD card onto a larger SD card I'm using Ubuntu 12.04. I have an old 4GB SD card, and have just bought a new 16GB SD card. I would like to copy everything from my old 4GB SD card onto the new 16GB SD card. I was afraid that the usual copy-and-paste trick would miss out something, so I wanted to clone the old 4GB SD card onto the 16GB SD card. I used the dd command in a shell, following instructions in .  This worked with one small caveat. The new SD card now appeared to be 4GB. I later found out this is because the primary partition on the 16GB SD card has now shrunk to 4GB. I have solved this problem, and I think I understand it. However, my question now is, how do I clone my old 4GB SD card onto my new 16GB SD card without making the primary partition on the 16GB SD card shrink to 4GB? Proof of convergence of sequences Problem: Show that if $x_n\to 5$ then $\dfrac{x_n +1}{\sqrt{x_n -1}} \to 3$.  So I know $|x-5|&lt;\epsilon$ and I need to show that $\left|\dfrac{x_n +1}{\sqrt{x_n -1}} -3\right| &lt; \epsilon$.  I tried applying the triangle inequality (and a bit of algebra) to get $$\left|\frac{x_n +1}{\sqrt{x_n -1}} -3\right| \leq |x_n -5| \left |\frac{1}{\sqrt{x_n -1}}\right| + \left|\frac{6}{\sqrt{x_n-1}} -3\right|.$$  From this I know that $|x_n -5| &lt;\epsilon$ and can show that $\left |\dfrac{1}{\sqrt{x_n -1}}\right|&lt;1$. So my only problem is the second part of the sum. I have no idea what to do with it to get everything to be less than $\epsilon$. How to make the space under footnotes disappear? How do I make the space under footnotes disappear? And to space over the footnote's bar?    Code:  \documentclass[12pt,french]{report} \usepackage{mathptmx} \usepackage{helvet} \usepackage{courier} \usepackage[T1]{fontenc} \usepackage[cp1250]{inputenc} \usepackage[a4paper]{geometry} \geometry{verbose,margin=1in,headheight=12pt,headsep=25pt} \usepackage{fancyhdr} \pagestyle{fancy} \setlength{\parskip}{\medskipamount} \setlength{\parindent}{0pt} \usepackage{babel} \makeatletter \addto\extrasfrench{%    \providecommand{\og}{\leavevmode\flqq~}%    \providecommand{\fg}{\ifdim\lastskip&gt;\z@\unskip\fi~\frqq}% } \makeatother \usepackage{latexsym} \usepackage{pifont} \usepackage{color} \usepackage{float} \usepackage{textcomp} \usepackage{graphicx} \usepackage{setspace} \usepackage[unicode=true,  bookmarks=true,bookmarksnumbered=true,bookmarksopen=false,  breaklinks=true,pdfborder={0 0 0},backref=false,colorlinks=false]  {hyperref} \hypersetup{pdftitle={tito},  pdfauthor={abc},  pdfkeywords={kiko}} \usepackage{lipsum}  \makeatletter \usepackage{multicol} \usepackage{fancyhdr} \usepackage{multirow} \usepackage{longtable} \setcounter{secnumdepth}{4} \setcounter{tocdepth}{4} \usepackage{array} \newcommand{\ts}{\textsuperscript} \renewcommand\theparagraph{\alph{paragraph}.} \renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%                                     {3.25ex \@plus1ex \@minus.2ex}%                                     {0.5ex \@plus .2ex}%                                     {\normalfont\normalsize\bfseries}} \renewcommand*\l@paragraph{\@dottedtocline{4}{10em}{2em}}  \def\thickhrulefill{\leavevmode \leaders \hrule height 1ex \hfill \kern \z@}  \def\@makechapterhead#1{% \vspace*{10\p@}% {\parindent \z@ {\reset@font \usefont{OT1}{phv}{m}{n} \LARGE Chapitre \thechapter\par\nobreak}% \par\nobreak \vspace*{30\p@} \interlinepenalty\@M \usefont{OT1}{ptm}{b}{n} {\raggedright \Huge #1}% \par\nobreak \vskip 20\p@ \hrule height 1pt \par\nobreak \vskip 45\p@ }}  \def\@makeschapterhead#1{% \vspace*{10\p@}% {\parindent \z@ {\raggedleft \reset@font \scshape \vphantom{\@chapapp{} \thechapter} \par\nobreak}% \par\nobreak \vspace*{30\p@} \interlinepenalty\@M \usefont{OT1}{ptm}{b}{n} {\raggedright \Huge #1}% \par\nobreak \par\nobreak \vskip 45\p@ }}  \lhead{\nouppercase\leftmark} \chead{} \rhead{} \lfoot{} \cfoot{\thepage} \rfoot{} \renewcommand{\footrulewidth}{0.4pt}  \pretolerance=10000 \hyphenpenalty=10000 \exhyphenpenalty=10000  \AtBeginDocument{   \def\labelitemi{\Pisymbol{psy}{183}}   \def\labelitemii{\(\rhd\)}   \def\labelitemiii{\(\rhd\)}   \def\labelitemiv{\(\ast\)} } \makeatother  \begin{document} \chapter{Chap} \lipsum[1]\footnote{\lipsum[1]} \lipsum[1-8] \end{document} Change system date programmatically How can I change the local system's date &amp; time programmatically with C#? What is $1^k+2^k+\cdots+ (p-1)^k$ modulo $p$? (From Ireland and Rosen). I've been working through a bit of Ireland and Rosen's Number Theory for fun. Problem 4.11 of Ireland and Rosen asks     Prove that $1^k+2^k+\cdots+(p-1)^k\equiv 0\pmod{p}$ if $p-1\nmid k$, and $-1\pmod{p}$ if $p-1\mid k$.    My work is leading where I didn't expect to go. Here I assume $p$ id odd. First, if $p-1\mid k$, then we can wrike $k=(p-1)j$ for some $j$. But then $$ 1^k+\cdots+(p-1)^k\equiv 1^{(p-1)j}+\cdots+(p-1)^{(p-1)j}\equiv \underbrace{1+\cdots+1}_{p-1\text{ times}}=\frac{(p-1)p}{2}\equiv 0\pmod{p} $$ since $p-1$ is even.   Secondly, I suppose $p-1\nmid k$. WLOG, I can assume $0&lt;k&lt;p-1$, Since if $k=(p-1)j+r$ with $0&lt;r&lt;p-1$, then  $$ a^k\equiv a^{(p-1)j+r}\equiv a^r\pmod{p}. $$  Then if $g$ is a primitive root, $$ 1^k+\cdots+(p-1)^k=\sum_{i=1}^{p-1}(g^k)^i=\frac{g^k(1-g^{k(p-1)})}{1-g^k}. $$ Since $g$ is primitive, $p\nmid 1-g^k$, but $p\mid 1-g^{k(p-1)}$, so the above sum is again congruent to $0\pmod{p}$.  So in all cases, I get the sum is congruent to $0$ regardless. Have I messed up, or is there a typo? Thanks. How to test a confirm dialog with Cucumber? Not enough free disk space when upgrading Filter log file entries based on date range Does $x^2 - y^2 = 12345678$ (x,y are integers) have any solutions?