text stringlengths 183 150k | path stringlengths 15 112 | bucket stringclasses 4
values | source stringclasses 14
values | group stringclasses 121
values | spdx stringclasses 11
values | repo_license stringclasses 11
values | commit stringclasses 13
values | lang stringclasses 4
values | def_heavy bool 1
class | comment_ratio float64 0 1 | restricted bool 2
classes | fresh bool 1
class | n_bytes int64 183 150k | n_tokens int64 -1 -1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
\begin{tikzpicture}
\foreach \x in {0,1,2,3,4,5,6}
{
\draw[fill=brown!50] (\x,0) circle (0.25);
}
\draw[very thick] (0.5,0.5) -- (0.5,-0.5);
\draw[very thick] (2.5,0.5) -- (2.5,-0.5);
\draw[very thick] (5.5,0.5) -- (5.5,-0.5);
\begin{scope}[yshift=1.5cm]
\foreach \x in {0,1,2,3,4,5,6}
{
... | discrete-book/source/assets/penny-sticks.tex | math | discrete-book | discrete-book/source/assets | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | doc | false | 0 | true | false | 546 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<exercises xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="exercises_counting-combperm">
<title>Additional Exercises</title>
<!-- The following is now also in combinatorial proof exercises -->
<exercise>
<statement>
<p>
How many triangles are ther... | discrete-book/source/exercises/counting-combperm.ptx | math | discrete-book | discrete-book/source/exercises | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 2,752 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<section xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="sec_addtops-numbth">
<title>Introduction to Number Theory</title>
<idx><h>number theory</h></idx>
<introduction>
<p>
We have used the natural numbers to solve problems.
This was the right set of nu... | discrete-book/source/sec_addtops-numbth.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 47,685 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<chapter xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="ch_counting">
<title>Counting</title>
<idx><h>counting</h></idx>
<idx><h>enumeration</h><see>counting</see></idx>
<introduction>
<p>
One of the first things you learn in mathematics is how to count.
... | discrete-book/source/ch_counting.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 1,516 | -1 |
\begin{tikzpicture}[scale=1.5]
\node[circle, draw] (a1) at (72:1) {\tiny Al};
\node[circle, draw] (a2) at (0:1) {\tiny Bob};
\node[circle, draw] (a3) at (-72:1) {\tiny Cat};
\node[circle, draw] (a4) at (-144:1) {\tiny Dirk};
\node[circle, draw] (a5) at (144:1) {\tiny Eva};
\foreach \i in {1,...,... | discrete-book/source/assets/dir-class-inv-relation.tex | math | discrete-book | discrete-book/source/assets | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | doc | false | 0 | true | false | 669 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<exercises xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="exercises-sec-recurrence">
<title>Additional Exercises</title>
<exercise>
<statement>
<p>
Find the next two terms in <m>(a_n)_{n\ge 0}</m> beginning
<m>3, 5, 11, 21, 43, 85\ldots</m>. Then ... | discrete-book/source/exercises/seq-exponential.ptx | math | discrete-book | discrete-book/source/exercises | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 8,478 | -1 |
\documentclass{standalone}
\usepackage{tikz}
\input{USAmap.tex}
\begin{document}
\begin{tikzpicture}
\tikzset{set state val/.style args={#1/#2}{#1={fill=blue!#2}}}
\tikzset{set state val/.list={CA/100,FL/80,TX/55,NY/20}}
\USA[every state={draw=white, ultra thick, fill=black!10}]
\draw[dashed] (TX.center) -- (CA.... | discrete-book/assets/main.tex | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | doc | false | 0 | true | false | 398 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<worksheet xmlns:xi="http://www.w3.org/2001/XInclude" margin="1in" bottom="1.25cm" xml:id="PA-logic-proofs">
<title>Preview Activity</title>
<introduction>
<p>
Consider the statement:
</p>
<blockquote>
<p>
If <m>a b</m> is an even number,
then <m>a</m> or <m... | discrete-book/source/activities/four-proofs.ptx | math | discrete-book | discrete-book/source/activities | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 2,987 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<section xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="sec_seq-strong-induction">
<title>Strong Induction</title>
<idx>
<h>proof</h>
<h>by strong indcution</h>
</idx>
<idx>
<h>strong induction</h>
</idx>
<objectives>
<introduction>
<p>
After ... | discrete-book/source/sec_seq-strong-induction.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 18,997 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<chapter xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="ch_intro">
<title>Introduction and Preliminaries</title>
<introduction>
<p>
Welcome to Discrete Mathematics.
If this is your first time encountering the subject,
you will probably find discrete ... | discrete-book/source/ch_intro.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 825 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<exercises xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="exercises_seq-induction">
<title>Additional Exercises</title>
<exercise>
<statement>
<p>
On the way to the market,
you exchange your cow for some magic dark chocolate espresso beans.... | discrete-book/source/exercises/seq-induction.ptx | math | discrete-book | discrete-book/source/exercises | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 28,276 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<section xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="sec_seq-arithgeom">
<title>Arithmetic and Geometric Sequences</title>
<introduction>
<investigation xml:id="investigation-seqdots">
<introduction>
<p>
For the patterns of dots below,
draw... | discrete-book/source/sec_seq-arithgeom.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 34,012 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<docinfo xmlns:xi="http://www.w3.org/2001/XInclude">
<brandlogo url="http://discrete.openmathbooks.org/dmoi4.html" source="images/cover4.png" />
<document-id>dmoi-4</document-id>
<blurb shelf="Mathematics">
The 4th edition of Levin's Discrete Mathematics: an Open Intr... | discrete-book/source/bookinfo.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 3,532 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<exercises xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="exercises_gt-relations">
<title>Additional Exercises</title>
<exercise>
<introduction>
<p>
Consider the relation <m>\gt</m> on the set <m>\{1,2,\ldots,8\}</m>.
</p>
</introduction>
... | discrete-book/source/exercises/gt-relations.ptx | math | discrete-book | discrete-book/source/exercises | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 4,327 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<mathbook xmlns:xi="http://www.w3.org/2001/XInclude" xml:lang="en-US">
<xi:include href="./bookinfo.ptx"/>
<book xml:id="exercises">
<title>Discrete Mathematics</title>
<subtitle>An Open Introduction</subtitle>
<chapter>
<title>Introduction and Preliminarie... | discrete-book/source/exercises.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 4,182 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<chapter xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="ch_logic">
<title>Logic and Proofs</title>
<idx><h>self reference</h><see>reference, self</see></idx>
<idx><h>reference, self</h><see>self reference</see></idx>
<introduction>
<p>
Logic is the study of ... | discrete-book/source/ch_logic.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 2,801 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<!--******************************************************************** Copyright 2020 Oscar Levin This file is the "publication file" for producing Runestone html *********************************************************************-->
<publication>
<!-- directories are re... | discrete-book/publication/runestone.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 3,951 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<exercises xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="exercises_intro-statements">
<title>Additional Exercises</title>
<exercise>
<statement>
<p> Suppose <m>P</m> and <m>Q</m> are the statements: <m>P</m>: Jack passed math. <m>Q</m>: Jill passed math. <ol>
... | discrete-book/source/exercises/logic-statements.ptx | math | discrete-book | discrete-book/source/exercises | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 3,657 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<section xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="sec_coloring">
<title>Coloring</title>
<objectives>
<introduction>
<p>
After completing this section, you should be able to do the following.
</p>
</introduction>
<ol>
<li>
<p>
Determ... | discrete-book/source/sec_gt-coloring.ptx | math | discrete-book | discrete-book | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 32,393 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<exercises xmlns:xi="http://www.w3.org/2001/XInclude" xml:id="exercises_multisets">
<title>Additional Exercises</title>
<exercise>
<statement>
<p>
Each of the counting problems below can be solved with sticks and stones.
For each, say what ... | discrete-book/source/exercises/counting-multisets.ptx | math | discrete-book | discrete-book/source/exercises | CC-BY-NC-SA-4.0 | CC-BY-NC-SA-4.0 | 2d28f5dee1370beeed729d3712d53638597885dd | other | false | 0 | true | false | 5,089 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.