How to add an empty folder inside an already existing repository? Github
How can I add an empty directory to a Git repository?
I would like to grant the  app write access to external storage in Marshmallow.  The app does not request it explicitly (unlike other apps that seem to use the Storage Access Framework to do so).    In the app permissions screen, there is no permission listed for external storage, only for 'storage' (which seems to mean internal storage).  So there does not seem to be any direct way to grant this permission.   My phone is rooted and I could just run Syncthing as root - but this option creates many problems and sometimes results in the app hanging indefinitely.    Is there any other way around this problem? How do I run executable scripts in Nautilus? I have 2 hard disks, on first I have installed win xp. I boot into xp and run setup of win7 and installed it on second hard disk. Now the problem is that win7 bootloader is installed on first harddisk, so if I remove the first harddisk, I cannot boot into win7.   How I can move / install bootloader of win7 on second hard disk? Prove $p_n(x) \rightarrow \sqrt{x}$ uniformly as $n \rightarrow \infty$ Define $(p_n)_n$ recursively by $p_0(x) = 0$ and $p_{n+1}(x) = p_n(x) + \frac{1}{2}(x - p_n(x)^2)$.  Prove that $p_n(x) \rightarrow \sqrt{x}$ uniformly for $0 \leq x \leq 1$ as $n \rightarrow \infty$.  I'm not sure where to go with this.  I can show inductively that $\forall n,\  0 \leq p_n(x) \leq 1$ for $0 \leq x \leq 1$, and I think that $p_n(x)$ is increasing with $n$, but I have no idea whether this helps me.  I know that I need to show that $\forall \epsilon&gt;0: \exists N \in \mathbb{N}: \forall n \geq N: \forall x\in [0,1]: \big|p_n(x) - \sqrt{x}\big| &lt; \epsilon$ Edit:  I just had a thought.  I'm given a version of Dini's theorem that reads  Let $X$ be a compact metric space, $(f_n)_n$ a sequence of real-valued continuous functions on $X$, $f$ a continuous function on $X$ such that: (i) $f_n \rightarrow f$ pointwise on $X$, and (ii) $f_n(x) \geq f_{n+1}(x) $ for all $x \in X, n \in \mathbb{N}$. Then: $f_n \rightarrow f$ uniformly on $X$.  Obviously, (ii) is not true for my sequence, but what if I took $f_n(x) = -p_n(x)$ and $f(x) = - \sqrt{x}$?  Then I could prove (ii) to be true, I know that $[0,1]$ is compact, and $f_n(x)$ is real-valued.  The only part I would need to prove is (i), which is where I get confused.  Correct me if I'm wrong, but after that I could say that since $(-p_n)_n \rightarrow -\sqrt{x}$, then $(p_n)_n \rightarrow \sqrt{x}$.  Any advice? This came up in proving non-regularity of a certain language (powers of 2 over the ternary alphabet). Any clue to the above equation could help me move forward.  Edit: Of course, $x = 1, y = 1$ is a solution. I am looking for non-trivial solutions. Two independent Poisson process question What is a disputed flag? In my flagging summary under the statistics, there is 1 flag listed as "disputed".  This is the first time I've ever seen a disputed flag in my summary, so I'm just curious, what is a disputed flag? How would you even dispute a flag? Is this the same as voting a flag as invalid? What is the difference between a synchronized method and synchronized block in Java? I want to append some data to a layer in my PostGIS DB using a shapefile, but when I use the Import layer/file tool in QGIS, it doesn't allow me to choose the append option.  Why is this and how do I get it to allow me to append? How can I specify the default save directory for gnome-screenshot? Are there any sort of configuration options for specifying the default save location for gnome-screenshot, or is this hard-coded into the source code? It used to be ~/Desktop, which seems to have changed to ~/Pictures (in 12.04). The only possible solution I've seen is about  (as it includes time stamp information now instead of simply 'Screenshot#'), but that solution doesn't really seem ideal to me. Also,  post suggested that the last save location is remembered the next time you take a screenshot, but in my experience, this doesn't seem to be the case. And in any case, following on from that, that entry in gconf-editor doesn't even seem to accurately reflect the last location, so more than likely an entry related to an older version of gnome-screenshot. Table of contents: I'm seeing an odd character like a very flat U, where there should be a space, with the listings package. See example below. Does anyone have any idea why this is happening, or how to get rid or work around it?  \documentclass{standalone} \usepackage{underscore} \usepackage{listings} \usepackage[usenames,dvipsnames, rgb, svgnames, x11names]{xcolor} % Text layout \topmargin 0.0cm \oddsidemargin 0.5cm \evensidemargin 0.5cm \textwidth 16cm \textheight 21cm  \lstnewenvironment{cmd}[1][]{%   \lstset{language=sh, backgroundcolor=\color{LightSteelBlue1}, #1}} {}  \begin{document} \begin{cmd}[caption=Configuration file section including filters] [affy6] [...]     [[hapmap]]     phenofiles = "data/Hapmap6.0/Pheno/hapmappheno_909.csv",     genofile = "/data/snppy/Hapmap6.0/Geno/birdseed-v2.calls.txt"     anno_filter = "chromosome = 5"     idlink_filter = "studyid = 'CEU'"     some_other_stuff = "foo = bar" \end{cmd} \end{document} Hi I make this class A amplifier but how to replace R5 (10 ohm/10 W) with transistor because its getting really hot and how to achieve up to 10 Watt with +/- supply. I have +/-25v with 4A please help Show that $\lim _{r \to 0} \|T_rf−f\|_{L_p} =0.$ I am having a hard time with the following real analysis qual problem.  Any help would be awesome.  Suppose that $f \in L^p(\mathbb{R})$, where $1\leq p&lt; + \infty$. Let $T_r(f)(t)=f(t−r)$. Show that $\lim_{r \to 0} \|T_rf−f\|_{L_p} =0$, that is $$ \lim_{r\to 0} \left( \int_{\mathbb R} |f(t-r) - f(t)|^p \mathrm d t\right)^{1/p} =0.$$ Zero visibility while editing a message in a chat room I think I remember reading somewhere that the Baire Category Theorem is supposedly quite powerful. Whether that is true or not, it's my favourite theorem (so far) and I'd love to see some applications that confirm its neatness and/or power.  Here's the theorem (with proof) and two applications:    (Baire) A non-empty complete metric space $X$ is not a countable union of nowhere dense sets.  Proof: Let $X = \bigcup U_i$ where $\mathring{\overline{U_i}} = \varnothing$. We construct a Cauchy sequence as follows: Let $x_1$ be any point in $(\overline{U_1})^c$. We can find such a point because $(\overline{U_1})^c \subset X$ and $X$ contains at least one non-empty open set (if nothing else, itself) but $\mathring{\overline{U_1}} = \varnothing$ which is the same as saying that $\overline{U_1}$ does not contain any open sets hence the open set contained in $X$ is contained in $\overline{U_1}^c$. Hence we can pick $x_1$ and $\varepsilon_1 &gt; 0$ such that $B(x_1, \varepsilon_1) \subset (\overline{U_1})^c \subset U_1^c$.   Next we make a similar observation about $U_2$ so that we can find $x_2$ and $\varepsilon_2 &gt; 0$ such that $B(x_2, \varepsilon_2) \subset \overline{U_2}^c \cap B(x_1, \frac{\varepsilon_1}{2})$. We repeat this process to get a sequence of balls such that $B_{k+1} \subset B_k$ and a sequence $(x_k)$ that is Cauchy. By completeness of $X$, $\lim x_k =: x$ is in $X$. But $x$ is in $B_k$ for every $k$ hence not in any of the $U_i$ and hence not in $\bigcup U_i = X$. Contradiction. $\Box$    Here is one application (taken from ):  Claim: $[0,1]$ contains uncountably many elements.  Proof: Assume that it contains countably many. Then $[0,1] = \bigcup_{x \in (0,1)} \{x\}$ and since $\{x\}$ are nowhere dense sets, $X$ is a countable union of nowhere dense sets. But $[0,1]$ is complete, so we have a contradiction. Hence $X$ has to be uncountable.     And here is another one (taken from ):  Claim: The linear space of all polynomials in one variable is not a Banach space in any norm.  Proof: "The subspace of polynomials of degree $\leq n$ is closed in any norm because it is finite-dimensional. Hence the space of all polynomials can be written as countable union of closed nowhere dense sets. If there were a complete norm this would contradict the Baire Category Theorem." Does the concept of infinity have any practical applications? I know what you're thinking: "of course it has, for example, it can be used to tell you how many times you can go around a circle". But that isn't really true, now is it? You'd be dead or the world would go under long before an infinite amount of loops had been reached.  Are there any practical applications for the concept of infinity? Is it a useful concept in maths at all?  I know that Donald E. Knuth has argued that for all practical purposes, a very, very large number has the same effect as infinity, in his book "Things a Computer Scientist Rarely Talks About" (can't remember the exact quote, nor find it online, unfortunately).  Examples are appreciated. What's the difference between !, %, and @ in replacement tokens? Get rid of the question ban on Meta; suspend actively harmful users manually appears to have been question banned because of two unpopular Meta suggestions. (He says so in )  Look at the two contributions that appear to have gotten him banned. Like those of many others, they may not be of perfect quality, but they are not actively harmful to the site, either. As it stands, you can get question blocked on Meta simply for asking questions that aren't popular with the Meta crowd.  Why does the team insist on keeping the question ban active on Meta?  Why can't real problem users be dealt with through manual moderator action? Don't tell me it's a problem of scale; as far as I can see, actually toxic users are very rare on Meta.  People will frequently complain that Meta actively discourages the expression of unpopular viewpoints and suggestions. With the threat of question bans in place, I find those complaints difficult to refute. I hate that. Change bookmark depth I want all bookmarks after "Anhang" (appendix) to be a level deeper, but I need them to be \chapter{} for the right numbering.  I write a scrbook document and that's what I got:    Is it possible to change the depth of the chapter to act like a section in the bookmarks?  UPDATE  MWE:  \documentclass[12pt,a4paper,oneside]{scrbook}  \usepackage[ngerman]{babel}     % deutsche Worttrennung \usepackage[T1]{fontenc}        % Ausgabe von Sonderzeichen und Akzenten in PDF verbessert \usepackage[utf8]{inputenc}         % Eingabe von Sonderzeichen möglich \usepackage{lipsum}  \setcounter{secnumdepth}{3}     % subsubsections nummerieren \setcounter{tocdepth}{3}        % subsubsections in TOC  \usepackage[ %     pdfproducer={Texmaker},     %      pdfcreator={pdfLaTeX},      %      hidelinks,          % versteckt die Boxen um die Links in der PDF     bookmarksnumbered,      % nummereiert Lesezeichen     ]{hyperref}         % PDF Metainformationen hinzufügen   \begin{document}  \appendix \pagenumbering{alph}  \thispagestyle{empty}  \vspace*{3em} \begin{center} \begin{Huge} \textbf{\textsf{Anhang}} \pdfbookmark{Anhang}{Anhang} \end{Huge} \end{center}  \chapter{Appendix 1}  \chapter{Appendix 2}  \section{Appendix 2.1}  \section{Appendix 2.2}  \chapter{Appendix 3}  \end{document} How to check if an object is nullable? How do I check if a given object is nullable in other words how to implement the following method... bool IsNullableValueType(object o) {     ... }  I am looking for nullable value types. I didn't have reference types in mind. //Note: This is just a sample. The code has been simplified  //to fit in a post.  public class BoolContainer {     bool? myBool = true; }  var bc = new BoolContainer();  const BindingFlags bindingFlags = BindingFlags.Public                         | BindingFlags.NonPublic                         | BindingFlags.Instance                         ;   object obj; object o = (object)bc;  foreach (var fieldInfo in o.GetType().GetFields(bindingFlags)) {     obj = (object)fieldInfo.GetValue(o); }  obj now refers to an object of type bool (System.Boolean) with value equal to true. What I really wanted was an object of type Nullable&lt;bool&gt; So now as a work around I decided to check if o is nullable and create a nullable wrapper around obj.