A minimal example of my code is shown. The problem is, first of all, that the space between the title of the example and the description of the problem is too large. So I want to reduce the space, but I cannot figure out how. Secondly, if the example is too long it should continue on the next page, but the command allowframebreaks does not do the job.        \documentclass[10pt, ]{beamer}  \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage[T1]{fontenc}  \usepackage[framemethod=TikZ]{mdframed}  % Example enviroment \newcounter{exm}[section]\setcounter{exm}{0} \renewcommand{\theexm}{\arabic{section}.\arabic{exm}} \newenvironment{exm}[3][]{% \refstepcounter{exm}% \ifstrempty{#1}% {\mdfsetup{% frametitle={% \tikz[baseline=(current bounding box.east),outer sep=0pt] \node[anchor=east,rectangle,fill=white!100] {\strut \small{Eksempel~\theexm: #2}};}} }% {\mdfsetup{% frametitle={% %\tikz[baseline=(current bounding box.east),outer sep=0pt] %\node[anchor=east,rectangle,fill=white!100] {\strut \small{Eksempel~\theexm:~#1: #2}};}}% }% \mdfsetup{innertopmargin=0pt,linecolor=green!80,% skipabove=7pt, skipbelow=0pt, rightline=false, leftline=true, topline=false, bottomline=false, linecolor=green, innerleftmargin=5pt, innerrightmargin=5pt, innertopmargin=0pt, leftmargin=0cm, rightmargin=0cm, linewidth=3pt, innerbottommargin=0pt,% frametitleaboveskip=\dimexpr-\ht\strutbox\relax } \begin{mdframed}[]\relax% \label{exm:#3}}{\end{mdframed}}  \newcommand{\exam}[4]{% \begin{exm}{#1}{#2} \begin{small} \begin{textit} #3   \end{textit} \\[0.2cm] \textbf{Solution:} \\ #4 \end{small} \end{exm} }  \begin{document}  \section{Section Title} \begin{frame}[allowframebreaks]{Frametitle} \exam{Title of the example}{LabelName}{Descibtion of the problem...}{A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.A very long text. A very long text. A very long text. A very long text. A very long text. A very long text.} \end{frame}   \end{document}
The mdframed environment fails to break into several pages (slides) when used in a frame environment from the beamer class.  In the other hand, the boitecoloriee environment from the boites package can be broken into several pages.  Here is a document that demonstrates the issue. It should not be compiled directly into pdf because boitecoloriee uses pstricks.  \documentclass{beamer} \usepackage{xcolor,boites,boites_exemples,pstricks} \usepackage{mdframed} \usepackage{lipsum}  \begin{document}  \begin{frame}[allowframebreaks]{Using \texttt{boitecoloriee}}   \begin{boitecoloriee}     \lipsum[1-2]   \end{boitecoloriee} \end{frame}  \begin{frame}[allowframebreaks]{Using \texttt{mdframed}}   \begin{mdframed}     \lipsum[1-2]   \end{mdframed} \end{frame}  \end{document}   Maybe is there a way to fix mdframed to work in slides too. Any clues?
Show that $\deg f$ is even when $n$ is odd. A map $f:S^n\rightarrow S^n$ satisfying $f(x)=f(-x)$ for all $x\in S^n$ is said to be an even map. Show that if $f:S^n\rightarrow S^n$ is an even map, then $\deg f=0$ when $n$ is even and $\deg f$ is even when $n$ is odd. Moreover show that when $n$ is odd, there exist even maps of any given even degree.   My Try:  So $f=(-I)\circ f$. Then $\deg f=\deg (-I)\times \deg f$. If $n$ is even $\deg (-I)=-1$. Hence, $2\deg f=0$, so $\deg f=0$. But how do I show the results when $n$ is odd. No clue at all. This problem is in Hatchers book (A very complicated text). There is a hint but I do not understand it. Can somebody help me to proceed? Excel 2010 on multi monitor screen How can I find the smallest set of groups of $n$ elements such that every element is in the same group as every other at least once? Background: I'm working on  for , and I've run into a problem with how I'm creating the individual matchups (groups of 4 entries).  Currently, I'm simply generating all combinations of 4 elements (in the combinatoric sense) of entries, but that gets really big really quickly:  $$x \choose 4$$    (from )  Therefore, my question is: How can I choose subsets (of length $n$) of a set such that each element of that set appears in the same subset as every other element at least once, while maintaining a minimal amount of subsets?  I can figure this out for $n = 2$, since the solution is quite intuitive: simply combine the first element with every other element, combine the second element with every other element that comes after it, etc. For a set of length $L$, this yields:  $$\sum_{x=1}^{L-1}(L - x)$$    (from )  which is much smaller and more manageable.  However, I still have not been able to figure out: How can I generalize this to any $n$? Compare 1st column of the 1st file and 2nd column of the 2nd file and matching fontenc changes sans serif bold font in KOMA-script Consider the following MWE:  \documentclass{article} %\usepackage[T1]{fontenc}  \begin{document}  \textbf{\textsf{Some text}}  \end{document}   The output of the above code is     and doesn't change if I uncomment the line  %\usepackage[T1]{fontenc}   Consider now the following MWE with scrartcl class instead of article:  \documentclass{scrartcl} %\usepackage[T1]{fontenc}  \begin{document}  \section{A section} \textsf{Some text} \end{document}      Uncommenting the line  %\usepackage[T1]{fontenc}   you get    As you can see, the sans serif font of the title is less  bold than without fontenc, while the normal text is not changed.  Does fontenc, combined with a KOMA-script class, load a different sans serif font, but only for bold face? This is purely a curiosity, but I'm fascinated by mid-word pluralization, even if the word in question is a compound word.  For example, passersby or standersby.  No others have occurred to me. Can you provide other examples, or a link to a resource that enumerates them?  I'm particularly interested in compounds that do not include spaces or hyphens. Can I travel within the Schengen area without a passport if I have my residency permit card? Are Living Beings Turned Into Horcruxes Suceptible to Age, Disease, or Injury? From the HP books I know that Horcruxes grant a form of immortality. So, it is not possible for someone who created a Horcrux to die from old age or succumb to diseases. I guess the same is true for living beings turned into a Horcrux. But do living Horcruxes age normally? Is it possible to cripple them or sever their limbs, head or something like that, or do they instantly "repair" themselves like inanimate Horcruxes? How to show $n\sum_{i=1}^n {x_i^2} \ge (\sum_{i=1}^n{x_i})^2$ Why does range(start, end) not include end? Number of homomorphisms from $(\mathbb Q^+ , \,\cdot\,)$ to $(\mathbb Z_n , +)$ How many homomorphism are there from $(\mathbb Q^+ , \,\cdot\,)$ to $(\mathbb Z_n , +)$?   Could anyone give a hint how to proceed? I couldn't even start Usually when a word starts with a vowel, we will use "an" before it. But for union, it is "a union" not "an union." It is not explained in the previously mentioned  why union is an exception. It explains how to know exceptions for h like hotels.   Also are there any exceptions for the opposite side, where there should be an "a" but is an "an" instead? (Unfortunately I have no example of a case like this.) Is there a conventional wisdom to what gear a bike should be left in, when used infrequently? Sharepoint 2010 - Deploy webpart as Feature scope = web I want to create and deploy a web part as web-scoped feature.  In Visual Studio 2010, when I make the feature scope=web, I cannot add the webpart to that feature as I am able to do when scope=site. Other types of vector multiplication. As far as I've seen, there are only two types of vector multiplication defined, dot product/inner product which is defined in a vector space of any dimension, even infinite, and cross product, which is only defined in three dimensions. Are there more definitions of vector products? Fast way to find period-n points of a tent map? I need to find a period-3 orbit for a tent map defined by $$T(x)=\begin{cases}2x &amp; 0\le x\le0.5 \\[2ex] 2-2x &amp;0.5 &lt; x \le 1 \end{cases}$$  So, what is a fast and efficient way of finding it? I only know how to do it by guessing-and-checking. For example, I picked a random point, $x = \frac{2}{7}$ and found that $$T\left(\frac{2}{7}\right)=\frac{4}{7}\\[4ex]T\left(\frac{4}{7}\right)=\frac{6}{7}\\[4ex]T\left(\frac{6}{7}\right)=\frac{2}{7}$$ which is a period-3 orbit. Is there any better way of finding a period-3 orbit , more specifically, a period-3 point? Is list::size() really O(n)? Recently, I noticed some people mentioning that std::list::size() has a linear complexity. According to  , this is in fact implementation dependent as the standard doesn't say what the complexity has to be. The comment  says:     Actually, it depends on which STL you   are using. Microsoft Visual Studio V6   implements size() as {return (_Size);   } whereas gcc (at least in versions   3.3.2 and 4.1.0) do it as { return std::distance(begin(), end()); } The   first has constant speed, the second   has o(N) speed    So my guess is that for the VC++ crowd size() has constant complexity as Dinkumware probably won't have changed that fact since VC6. Am I right there? What does it look like currently in gcc? If it is really O(n), why did the developers choose to do so? Excel: I need a formula that will count months between two dates. If it's 1-15 it should be a half month. Any ideas? So I am trying to find a formula for excel. Bascically I have two dates and I need to know the number of months between them. But to add complexity, I need a rule in there that if the earlier date is the 1st to 15th it will be a whole month but if it is 16th to end of the month it will be a half month.  For example: Date 1: April 4, 2012 Date 2: December 31, 2012 Answer: Number of months would be 9 months  If Date 1 was April 16, 2012, with the same Date 2 of December 31, 2012, then the number of months would equal 8.5.  Can anyone help me with this one? You help would be greatly appreciated. many thanks Creating or adding geometry colunm fails even with postgis enabled Answer list only displays first 30 answers The answer list only displays first 30 answers, for questions with lots of answers - no pagination or lazy-loading once you reach the bottom, to view the other answers.  Personally counted every answer twice.