When there is a very long line of code in the code section , it does not scroll when you swipe to the left. it will scroll only a tiny amount each time (one character at a time)  For example:  this is a really long line of code that will not properly scroll to the left when viewed on a device that's not wide.
This occurs in the  released recently to the public. When someone posts a code block in their question or answer, the code block is cut off on the right hand side, and I can't scroll to the right to view the rest of it. How can I view these code blocks?
How does HOTP keep in sync? My understanding of  is that each password is unique and based on a counter.    $$PASSWORD = HOTP_1(K,C)$$  Where $C$ is an incremental counter.  What I wish to know, is how you keep the client and server in sync?  Looking at current systems (google authenticator), there appears to be no indication if the actual 'counter' number, but you can generate successive passwords at will.  What happens if, for example, the password you have generated uses $C = 5$, but the server is expecting $C = 3$?  Also, what is the 'integrity check' for?  Google cant seem to come up with a solution. The statement is: $f$ is a real fucntion on $\mathbb R$. Then if $f'(x)=f(x)$ and $f(0)=1$, then $f(x)\neq 0.$ Why don't C++ compilers define operator== and operator!=? I am a big fan of letting the compiler do as much work for you as possible.  When writing a simple class the compiler can give you the following for 'free':   A default (empty) constructor A copy constructor A destructor An assignment operator (operator=)   But it cannot seem to give you any comparison operators - such as operator== or operator!=.  For example:  class foo { public:     std::string str_;     int n_; };  foo f1;        // Works foo f2(f1);    // Works foo f3; f3 = f2;       // Works  if (f3 == f2)  // Fails { }  if (f3 != f2)  // Fails { }   Is there a good reason for this?  Why would performing a member-by-member comparison be a problem?  Obviously if the class allocates memory then you'd want to be careful, but for a simple class surely the compiler could do this for you? Change font size of labels in figures to any font size I want to change the font size of the label of a figure environment to any font size. It's possible to use the package caption with the argument font=Large for example. But I found no way to choose any font size, e.g. fontsize=28pt.  Here an example code:  \documentclass{standalone} \usepackage{anyfontsize}  \usepackage[font=Large]{caption} %\usepackage[fontsize=28pt]{caption} % not implemented   \begin{document} \parbox[t]{20cm}{  \fontsize{28}{30} \selectfont  \begin{figure}     %\includegraphics{figure.eps}     \caption{\label{fig_req_osnr} \fontsize{28}{30} \selectfont My caption.} \end{figure}  }  \end{document}     Do you have any ideas? How to show $\lim_{n \to \infty} \sqrt[n]{a^n+b^n}=\max \{a,b\}$? In a document I'm writing, I'm using the familiar  option for my floating tables, and I  them. I'd like to avoid repeating that every time I'm creating a table. I assume it's easy to add something in my preamble that makes sure that these two options are used every time I begin a new table environment?  \documentclass{article} \begin{document} \begin{table}[hbt] \centering \begin{tabular}{*3{l}} 1 &amp; 2 &amp; 3\\ a &amp; b &amp; c\\ \end{tabular} \end{table} \end{document} Intuition on the Kullback-Leibler (KL) Divergence Is there a good reason to use "printf" instead of "print" in java? Uncountable $\sigma$-algebra I'm stuck on the following problem (Source: Real Analysis for Graduate Students; Exercise 2.6; ):     Suppose $\mathcal A$ is a $\sigma$-algebra with the property that whenever $A \in \mathcal A$, there exists $B, C \in \mathcal A$ with $B \cap C = \emptyset$, $B \cup C = A$, and neither $B$ nor $C$ is empty. Prove that $\mathcal A$ is uncountable.   I think there is the added assumption that this is only true for $A \in \mathcal A$ having at least two elements, so it doesn't hold for singletons and the emptyset?  I tried to show this by way of contradiction and say that $\mathcal A = \{A_k\}$ is countable, but I didn't see how this could get me to a contradiction.  The other approach I tried was to look at $X = B_1 \cup C_1$ where $B_1 \cap C_1 = \emptyset$, then look at $B_1 = B_2 \cup C_2$ where $B_2 \cap C_2 = \emptyset$ and so on. If I look at the $C_k$'s they are pairwise disjoint and I either have a finite number of them or an infinite number of them in which case I've created a countable sequence of pairwise disjoint nonempty elements of $\mathcal A$. This path looked promising, but I couldn't see what to do next. Any ideas?  As a secondary question: I think this result is supposed to be used to show that if $\mathcal A$ is a $\sigma$-algebra with infinitely many elements, then it's uncountable, but I wasn't able to show that the property mentioned above (the one I'm trying to show) was satisfied in this case. I want to use VBScript to catch errors and log them (ie on error "log something") then resume the next line of the script.  For example,   On Error Resume Next 'Do Step 1 'Do Step 2 'Do Step 3   When an error occurs on step 1, I want it to log that error (or perform other custom functions with it) then resume at step 2. Is this possible? and how can I implement it?  EDIT: Can I do something like this?   On Error Resume myErrCatch 'Do step 1 'Do step 2 'Do step 3  myErrCatch: 'log error Resume Next Find a real function $f:\mathbb{R}\to\mathbb{R}$ such that $f(f(x)) = -x$? My storage was not updated I just changed my storage plan for 50 GB for $0.99 per month. When i went on settings>General>Storage and icloud usage, where it said storage above it i didnt have more storage. But the second box, where it said icloud abov it had upgraded to 50 GB. But i dont have any more storage for me to be able to get more apps etc. Centering in the \align* environment Calculations in quotient rings How can I get a command block? I'm using python\pyodbc and would like to access the second result set of a stored procedure. As near as I can tell, pyodbc does not support multiple result sets. Additionally, I can't modify the stored procedure. Are there any options to access the second result set using SQL or some other work-around? Perhaps create a second stored procedure that only returns the second result set of the first? Multiplication principle and permutation Definition of Multiplication principle in Principles and Techniques in combinatorics by Chuan-Chong, Khee-Meng is given as:      Let $$\prod_{i=1}^rA_i=A_1\times\dots\times A_r=\{(a_1,\dots,a_r) | a_i\in A_i, i=1,\dots,r\}$$ denote the cartesian product of the finite sets $A_1,\dots,A_r.$ Then $$\left\vert \prod_{i=1}^r A_i \right\vert=|A_1|\times\dots\times|A_r|.$$   I want to know how this principle is applies in defining $P_r^n=n(n-1)\cdots2\cdot1$, ie, what are sets $A_1,\dots,A_r$ here? How does Linux kernel compare to microkernel architectures? I read once that one advantage of a microkernel architecture is that you can stop/start essential services like networking and filesystems, without needing to restart the whole system. But considering that Linux kernel nowadays (was it always the case?) offers the option to use modules to achieve the same effect, what are the (remaining) advantages of a microkernel? Differences among Doctoral Degrees/titles How can I automatically shutdown the system after a specific time?