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].”

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

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.

Let $C$ be the standard Cantor middle-third set. As a consequence of the Baire category theorem, there are numbers $r$ such that $C+r$ consists solely of irrational numbers, see here. What would be an explicit example of a number $r$ with this property? Short of an explicit example, are there any references addressing this question? A natural approach would […]

Suppose $M$ is an inner model (of $\mathsf{ZF}$) with the same reals as $V$, and let $A\subseteq \mathbb R$ be a set of reals in $M$. Suppose further that $A$ is determined in $M$. Under these assumptions, $A$ is also determined in $V$. The point is that since winning strategies are coded by reals, and any possible run of the game for $A$ is coded by a real, […]

Yes. This is obvious if there are no such cardinals. (I assume that the natural numbers of the universe of sets are the true natural numbers. Otherwise, the answer is no, and there is not much else to do.) Assume now that there are such cardinals, and that "large cardinal axiom" is something reasonable (so, provably in $\mathsf{ZFC}$, the relevant […]

Please send an email to mathrev@ams.org, explaining the issue. (This is our all-purpose email address; any mistakes you discover, not just regarding references, you can let us know there.) Give us some time, I promise we'll get to it. However, if it seems as if the request somehow fell through the cracks, you can always contact one of your friendly edit […]

The characterization mentioned by Mohammad in his answer really dates back to Lev Bukovský in the early 70s, and, as Ralf and Fabiana recognize in their note, has nothing to do with $L$ or with reals (in their note, they indicate that after proving their result, they realized they had essentially rediscovered Bukovský's theorem). See MR0332477 (48 #1080 […]

I give an example (perhaps the best-known example) below, but let me first discuss equiconsistency rather than straight equivalence. Usually an equiconsistency is really the sort of result you are after anyway: You want to establish that certain statements in the universe where choice holds correspond to determinacy, which implies the failure of choice. The […]

The other answers have correctly identified the issue. Let me highlight the difficulty: it is relatively consistent with the axioms of set theory except for the axiom of choice that there are infinite sets which do not contain a copy of the natural numbers (that is, there are infinite sets $X$ such that there is no injection $f\!:\mathbb N\to X$). This means […]

This is $\aleph_\omega^{\aleph_0}$. First of all, this cardinal is an obvious upper bound. Second, if $A\subseteq\omega$ is infinite, $\prod_{i\in A}\aleph_i$ is clearly at least $\aleph_\omega$. The result follows, by splitting $\omega$ into countably many infinite sets. In general, the rules governing infinite products and exponentials are far from being w […]

If $\lambda$ and $\kappa$ are cardinals, $\lambda^\kappa$ represents the cardinality of the set of functions $f\!:A\to B$ where $A,B$ are fixed sets of cardinality $\kappa,\lambda$ respectively. (One needs to check this is independent of which specific sets $A,B$ we pick, of course.) At least for finite numbers, this is something you may have encountered in […]

R. Solovay proved that the provably $\mathbf\Delta^1_2$ sets are Lebesgue measurable (and have the property of Baire). A set $A$ is provably $\mathbf\Delta^1_2$ iff there is a real $a$, a $\Sigma^1_2$ formula $\phi(x,y)$ and a $\Pi^1_2$ formula $\psi(x,y)$ such that $$A=\{t\mid \phi(t,a)\}=\{t\mid\psi(t,a)\},$$ and $\mathsf{ZFC}$ proves that $\phi$ and $\psi […]