Documente Academic
Documente Profesional
Documente Cultură
2.4.26 For each of these lists of integers, provide a simple formula or rule that
generates the terms of an integer sequence that begins with the given
list. Assuming that your formula or rule is correct, determine the next
three terms of the sequence. We will refer to the terms as a1 , a2 , a3 , ...
a) 3, 6, 11, 18, 27, 38, 51, 66, 83, 102, ...
The pattern is an+1 = an + 2n + 1. The next three terms are
123, 146, 171.
b) 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, ...
The pattern is an+1 = an + 4 (which gives the formula an =
4n + 3). The next three terms are 47, 51, 55.
c) 1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, ...
The pattern is running through all binary strings in order. (Equivalently: it is the sequence of natural numbers, written in binary.)
The next three terms are 1100, 1101, 1110.
d) 1, 2, 2, 2, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, ...
This sequence is made up of Fibonacci numbers, starting with one
1, then three 2s then five 3s, and so on, increasing the number
of copies by two each time. The next three terms are 8, 8, 8.
e) 0, 2, 8, 26, 80, 242, 728, 2186, 6560, 19682, ...
The pattern is an+1 = 3an + 2. The next three terms are 59048,
177146, and 531440.
f) 1, 3, 15, 105, 945, 10395, 135135, 2027025, ...
The pattern is an+1 = (2n + 1) an (which gives the formula
an = (2n 1) (2n 3) ... 5 3 1). The next three terms are
34459425, 654729075, 13749310575.
1
g) 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, ...
The pattern is one 1, two 0s, three 1s, four 0s, and so on. The
next three terms are 0, 0, 0.
h) 2, 4, 16, 256, 65536, 4294967296, ... The pattern is an+1 = a2n . The
next three terms are
18446744073709551616
340282366920938463463374607431768211456
115792089237316195423570985008687907853269984665640564039457584007913129639936
2.4.32 Compute the value of each of these sums.
a)
8
X
(1 + (1)j ) =1 + 0 + 1 + 0 + 1 + 0 + 1 + 0 + 1 = 5
j=0
b)
8
X
8
8
X
X
(3j 2j ) =
3j
2j
j=0
j=0
j=0
39 1 29 1
31
21
=9330.
=
c)
8
X
8
8
X
X
(2 3j + 3 2j ) =2
3j + 3
2j
j=0
j=0
39
j=0
29
1
1
+3
31
21
=21215.
=2
d)
2 X
3
X
ij =
i=0 j=1
2
X
i (1 + 2 + 3)
i=0
2
X
6i
i=0
=6 (0 + 1 + 2)
=18.
2.4.34 Compute each of these double sums.
a)
3 X
2
3
X
X
(i j) =
((i 1) + (i 2))
i=1 j=1
i=1
i=0
3
X
(9i + 6)
i=0
=9 0 + 6 + 9 1 + 6 + 9 2 + 6 + 9 3 + 6
=81.
c)
3 X
2
X
3
X
j=
(0 + 1 + 2)
i=1 j=0
i=1
3
X
i=1
=3 + 3 + 3 = 9.
3
d)
2 X
3
X
i2 j 3 =
i=0 j=0
2
X
i2 (03 + 13 + 23 + 33 )
i=0
2
X
36i2
i=0
=36(02 + 12 + 22 ) = 180.
2.4.46 Find
Q4
j=0 j!.
4
Y
j! = 0! 1! 2! 3! 4! = 1 1 2 6 24 = 288.
j=0
mod m.
a) 17 mod 2 = 1 since 17 = 9 2 + 1.
b) 144 mod 7 = 4 since 144 = 20 7 + 4.
c) 101 mod 13 = 3 since 101 = 8 13 + 3.
d) 199 mod 19 = 9 since 199 = 10 19 + 9.
() 4.1.40 Prove that if n is an odd positive integer, then n2 1( mod 8).
Proof. Write n = 2k + 1, where k Z. We have
n2 = (2k + 1)2 = 4k 2 + 4k + 1 = 4k(k + 1) + 1.
Either k is even, or k + 1 is even. In either case, 4k(k + 1) is divisible
by 8. Thus we have
n2 = 4k(k + 1) + 1 1
mod 8.
4.3.12 Prove that for every positive integer n, there are n consecutive composite integers.
f) gcd(11111, 111111)
111111 =10 11111 + 1
11111 =11111 1 + 0
By the Euclidean algorithm, gcd(11111, 111111) = 1.
4.3.44 Use the extended Euclidean algorithm to express gcd(1001, 100001) as
a linear combination of 1001, 100001.
Solution. First well perform the standard Euclidean algorithm.
100001 =99 1001 + 902
1001 =1 902 + 99
902 =9 99 + 11
99 =9 11 + 0
So gcd(1001, 100001) = 11. We wish to write 11 as a linear combination of 100001.
11 =902 9 99
=902 9 (1001 902)
=10 902 9 1001
=10 (100001 99 1001) 9 1001
=10 100001 999 1001.
4.3.52 Prove or disprove that p1 p2 ...pn + 1 is prime for ever positive integer
n, where p1 , p2 , ..., pn are the n smallest prime numbers.
Disproof. This claim is true for n 5. However, for n = 6, we have
2 3 5 7 11 13 + 1 = 30, 031 = 59 509.