• Keine Ergebnisse gefunden

Topics in Discrete Mathematics/Number theory

N/A
N/A
Protected

Academic year: 2022

Aktie "Topics in Discrete Mathematics/Number theory"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

1

Exercise Sheet 2

Topics in Discrete Mathematics/Number theory

2016 C. Elsholtz

Ex. 1

Let A and B be non-empty sets of integers. Suppose that |A+B|= |A|+

|B| −1. Prove that both Aand B are arithmetic progressions with the same distance.

Ex. 2 (Nathanson)

The subset sum of a finite setA0of integers is defined bys(A0) = P

a∈A0a. For any finite set A of positive integers, define S(A) ={s(A0)|A0 ⊆A, A0 6=∅}.

Prove that if A is a set of k positive integers, then

|S(A)| ≥

k+ 1 2

.

Let A be a set of k ≥ 3 positive integers such that |S(A)| = k+12

. Prove that there exists a positive integer m such that

A={m,2m,3m, .., km}.

Does this also hold for k = 2?

Ex. 3 (Nathanson)

Let A be a finite subset of the abelian groupG, and let B be a finite subset of the abelian groupH. The mapφ :A→B is a Freiman isomorphism ifφis a one-to-one correspondence between A and B and if the map Φ : 2A→2B defined by

Φ(a1+a2) =φ(a1) +φ(a2)}

is well-defined and a one-to-one correspondence. Fix r >5, and let A ={0,1,2, r, r+ 1,2r} ⊂Z.

Show that |2A|= 3|A| −3 = 15. Let

B ={(0,0),(1,0),(2,0),(0,1),(1,1),(2,0)} ⊆Z2.

Show that |2B|= 3|B| −3 = 15. Construct a Freiman isomorphism between A and B.

(2)

2 Ex. 4

Read the paper “Adding distinct congruence classes modulo a prime” by Alon, Nathanson and Ruzsa. American Mathematical Monthly Volume 102, Number 3, March, 1995, pages 250-255 (available on “jstor” (logged in to TU with vpn) or Noga Alon’s webpage).

Hand in solutions to problems 1-3 this coming Monday.

If you find typos or errors on the problem sheet please send me an email.

Referenzen

ÄHNLICHE DOKUMENTE

[r]

[r]

[r]

[r]

since the other ideals are obtained from this one by applying the automorphisms of the

Find (online or in library) various proofs of a Theorem of Fermat that there do not exist four squares in arithmetic progression, i.e. not all four values a, a +d, a + 2d, a + 3d can

May’s main result is: A group decision function is the method of simple majority decision if and only if it is always decisive, egalitarian, neutral, and positively responsive,

by Noga Alon (Combinatorics, Probability and Computing, 8, January 1999, 7-29, available on the Cambridge university press webpage (logged into TU with vpn) or Noga Alon’s