Linnéniversitetet

Institutionen för Datavetenskap, Fysik och Matematik

Examination in Basic
Mathematics 1MA101

Thursday March 25, 2010, time 8.00-13.00

Permitted tools: No ones.

The answers shall be carefully motivated and in readable style. It is not allow
to have access to any mobile phone during the examination. It is not allowed
to leave any papers to any places but to the examination guard. Also be careful
that all used papers during the examination are signed by names and swedish
fiscal number of the person performing the examination.

The examination consists of a problem part (Part A) with eight computa-

tional problems, and a theory part (Part B) with three theoretical problems.
Each problem on Part A give up to 5 credits, if nothing else is stated. If
all problems on Part B are correctly solved, then 5 additional credits on the
total score is added.
It requires 20 credits from Part A, and a completely correct problem on
Part B to pass the examination. It requires 32 credits (including possible
additional credits from Part B) to receive the note ”high pass”.

A. Computation part
1. Compute all x which satisfy
3
sin3 x = sin x.
4
Next page.
2. What x solve the equation
ln(7x + 2)
= 2?
ln(x + 2)

1 25

3
3. Determine the constant term in 2x − 2 .
2x

4. Determine all integers x and y such that

13x + 9y = 87.

5. How many integers x are there which satisfy 1000 < x ≤ 100000, and
where each digit is at most 6?

6. Solve the equation

x4 + 2x3 − 9x2 − 2x + 8 = 0

7. Show by induction
n
X k 2+n
k
=2− n .
k=1
2 2

8. The complex numbers zk , k = 1, 2, . . . , n satisfy zkn = 1 for all k, and

n
X
zk = 0.
k=1

Let w be an arbitrary complex number. Compute

n
X
|zk − w|2 .
k=1

Next page
B. Theory part
T1. Show that there are infinitely many primes.

T2. Prove the factor theorem, i.e. if α is a given complex number and p(x)
is a polynomial, then

p(α) = 0 ⇐⇒ (x − α)p(x).


T3. Prove that cos(s − t) = cos s cos t + sin s sin t.

 Solutions
3
1. Let t = sin x. Then
√ it follows that t = 3t/4, which has the solutions
t = 0 and t = ± 3/2. That is
√ √
3 3
sin x = 0 , sin x = or sin x = − . (*)
2 2
π
This gives x = nπ (first equality in (*)), x = + n2π or
3
π 2π π
x = π − + n2π = + n2π (second equality in (*)), or x = − + n2π
3  3 3
π 4π
or x = π − − + n2π = + n2π (third equality in (*)), where n
3 3
π
is an integer. Totally we have x = n , where n is an integer.
3

2. We have
ln(7x + 2)
=2 ⇐⇒ ln(7x + 2) = 2 ln(x + 2)
ln(x + 2)
⇐⇒ ln(7x + 2) = ln(x + 2)2
⇐⇒ 7x + 2 = (x + 2)2 = x2 + 4x + 4
⇐⇒ x2 − 3x + 2 = 0
r
3 9 3 1
⇐⇒ x= ± −2= ±
2 4 2 2
⇐⇒ x=1 or x = 2.

Control: bothe of these values satisfy the original equation. Hence:

Answer: x = 1 and x = 2 are the solutions to the given equation.

3. General term in the binaomial expansion is:

   
25  1 k 25 25−k 3 25−k
3 25−k
(2x ) − 2 = 2 (x ) (−1)k 2−k (x2 )−k
k 2x k
   
25 k 25−2k 75−3k −2k 25
= (−1) 2 x x = (−1)k 225−2k x75−5k .
k k
 The constant term appears when the exxponent to x is zero, i.e. when
75 − 5k = 0. This gives k = 15. Hence, the searched term is
 
25 −5
− 2 .
15

4. Euclidean algorithm gives

13 = 1 · 9 + 4, 9 = 2 · 4 + 1,

which gives SGD(13, 9) = 1, and that the Diofantean equation has

solutions. Euklidean algorithm backwards now gives:

1 = 9 − 2 · 4 = 9 − 2 · (13 − 9) = 3 · 9 − 2 · 13.

Hence, x0 = −2 and y0 = 3 is a solution to the help equation

13x0 + 9y0 = 1.

A solution to the given equation

13x + 9y = 87

now appears by letting x = 87x0 = −174 and y = 87y0 = 261. The

general solution is now

x = −174 + 9n, y = 261 − 13n,

where n is an integer.

5. The number of non negative integers ≤ 99999 with digits at most 6

is 75 (for each digit, the choices 0, 1, 2, 3, 4, 5, 6 are possible). Hence,
the numbers of non-negative integers ≤ 100000 with digits at most 6 is
75 + 1.
In the same way it follows that the numbers of non negative integers
≤ 1000 with digits at most 6 is given by 73 +1. The number of searched
numbers are therefore

(75 + 1) − (73 − 1) = 75 − 73 = 73 (72 − 1) = 343 · 48 = 15864.

6. By a proposition we know that possible rational solutions are ±1, ±2,
±4 och ±8. By inserting these possibliities into the equation it follows
that x = ±1, x = 2 och x = −4 solves the equation. Since we have
found 4 solutions to an equation of fourth degree, it follows that there
are no more solutions. Hence:

Answer: The solutions are x = ±1, x = 2 and x = −4.

n
X k 2+n
7. Let VL(n) = k
and HL(n) = 2 − n .
k=1
2 2

1 1 2+1 1
Case 1: n = 1. VL(1) = = and HL(1) = 2 − = . This
21 2 21 2
gives VL(1) = HL(1) and the statement is true forn = 1.

Case 2: Suppose that the statement is true for n = j ≥ 1, and prove

it for n = j + 1. That is, we assume that VL(j) = HL(j) is true, and
shall prove VL(j + 1) = HL(j + 1). By straight-forward computations
we get
j+1 j
X k X k j+1 j+1
VL(j + 1) = k
= k
+ j+1
= VL(j) + j+1
.
k=1
2 k=1
2 2 2

Because of the induction assumptions we get that the right-hand side

j+1
is HL(j) + j+1 , which gives
2

j+1 2+j j+1 2(2 + j) − (j + 1)

VL(j+1) = HL(j)+ j+1
= 2− j + j+1 = 2−
2 2 2 2j+1
3+j 2 + (j + 1)
=2− j+1
=2− = HL(j + 1).
2 2j+1
Consequently, we have proved that VL(j) = HL(j) gives VL(j + 1) =
HL(j + 1).

The induction principle now gives that the statement holds for all in-
tegers n ≥ 1.
8. First we consider zkn = 1. For its modulus we have |zk |n = |zkn | = |1| =
1. This gives |zk | = 1. By straight-forward computations we get:
n
X n
X n
X
2
|zk − w| = (zk − w)(zk − w) = (zk zk − wzk − zk w + ww)
k=1 k=1 k=1
n
X n
X n
X n
X
2
= |zk | − wzk − zk w + |w|2
k=1 k=1 k=1 k=1

n
X n
X n
X
= 1−w zk − w zk + n|w|2
k=1 k=1 k=1

= n − w · 0 − w · 0 + n|w|2 = n(1 + |w|2 ).

Hence:

n
X
Answer: |zk − w|2 = n(1 + |w|2 ).
k=1