Problem 1 asks to determine (with brief justifications) the truth value of the following statements about integers:

1. is False. To show this we provide a counterexample: Specific integers such that For example,

2. is False. To show this we need to exhibit for each integer an integer such that For example, Note that, although is a fixed integer once we know we are not giving a fixed value of that serves as a simultaneous counterexample for all values of

3. is True. To show this we exhibit for each integer a specific integer such that For example: Note that, although is a fixed integer once we know we are not giving a fixed value of that works simultaneously for all

4. is True. To show this, we exhibit specific values of such that For example:

Problem 2 asks to show by contradiction that no integer can be both odd and even. Here is the proof: Suppose otherwise, i.e., there is an integer, let’s call it such that is both odd and even. This means that there are integers such that (since is odd) and (since is even).

Then we have that or But this is impossible, since 1 is not divisible by 2. We have reached a contradiction, and therefore our assumption that there is such an integer ought to be false. This means that no integer can be both odd and even, which is what we wanted to show.

Note that we have not shown that every integer is either odd or even. We will use mathematical induction to do this.

Problem 3 asks for symbolic formulas stating Goldbach’s conjecture and the twin primes conjecture (both are famous open problems in number theory).

Goldbach’s conjecture asserts that every even integer larger than 2 is sum of two primes:

Here, is the formula asserting that is even, namely, and is the formula (given in the quiz) asserting that is prime. Note we had to add existential quantifiers in order to be able to refer to the two prime numbers that add up to

The twin primes conjecture asserts that there are infinitely many primes such that is also prime.

The difficulty here is in saying “there are infinitely many,” since the quantifier only allows us to mention one integer at a time, and writing something of infinite length such as is not allowed.

We follow the suggestion given in the quiz, and represent “there are infinitely many with [some property]” by saying “for all there is a larger with [some property].”

This entry was posted on Friday, February 26th, 2010 at 1:24 pm and is filed under 187: Discrete mathematics. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

As suggested by Gerald, the notion was first introduced for groups. Given a directed system of groups, their direct limit was defined as a quotient of their direct product (which was referred to as their "weak product"). The general notion is a clear generalization, although the original reference only deals with groups. As mentioned by Cameron Zwa […]

A database of number fields, by Jürgen Klüners and Gunter Malle. (Note this is not the same as the one mentioned in this answer.) The site also provides links to similar databases.

As the other answer indicates, the yes answer to your question is known as the De Bruijn-Erdős theorem. This holds regardless of the size of the graph. The De Bruijn–Erdős theorem is a particular instance of what in combinatorics we call a compactness argument or Rado's selection principle, and its truth can be seen as a consequence of the topological c […]

Every $P_c$ has the size of the reals. For instance, suppose $\sum_n a_n=c$ and start by writing $\mathbb N=A\cup B$ where $\sum_{n\in A}a_n$ converges absolutely (to $a$, say). This is possible because $a_n\to 0$: Let $m_0

Consider a subset $\Omega$ of $\mathbb R$ of size $\aleph_1$ and ordered in type $\omega_1$. (This uses the axiom of choice.) Let $\mathcal F$ be the $\sigma$-algebra generated by the initial segments of $\Omega$ under the well-ordering (so all sets in $\mathcal F$ are countable or co-countable), with the measure that assigns $0$ to the countable sets and $1 […]

Sure. A large class of examples comes from the partition calculus. A simple result of the kind I have in mind is the following: Any infinite graph contains either a copy of the complete graph on countably many vertices or of the independent graph on countably many vertices. However, if we want to find an uncountable complete or independent graph, it is not e […]

I think that, from a modern point of view, there is a misunderstanding in the position that you suggest in your question. Really, "set theory" should be understood as an umbrella term that covers a whole hierarchy of ZFC-related theories. Perhaps one of the most significant advances in foundations is the identification of the consistency strength h […]

I'll only discuss the first question. As pointed out by Asaf, the argument is not correct, but something interesting can be said anyway. There are a couple of issues. A key problem is with the idea of an "explicitly constructed" set. Indeed, for instance, there are explicitly constructed sets of reals that are uncountable and of size continuum […]

The question seems to be: Assume that there is a Vitali set $V$. Is there an explicit bijection between $V$ and $\mathbb R$? The answer is yes, by an application of the Cantor-Schröder-Bernstein theorem: there is an explicit injection from $\mathbb R$ into $\mathbb R/\mathbb Q$ (provably in ZF, this requires some thought, or see the answers to this question) […]

If a set $X$ is well-founded (essentially, if it contains no infinite $\in$-descending chains), then indeed $\emptyset$ belongs to its transitive closure, that is, either $X=\emptyset$ or $\emptyset\in\bigcup X$ or $\emptyset\in\bigcup\bigcup X$ or... However, this does not mean that there is some $n$ such that the result of iterating the union operation $n$ […]