Assignment 2

Math 150
Harry Christman
MINDSCAPES 2.1

2. In order to estimate the number of balls that can fit in the box, you first have to fill the bottom
of the box with balls, and determine the number that will fit. Then assuming that you know the
height of a ping pong ball you can add up those height to see how many rows of balls will fit in
the box. Assuming a ball height of 1 inch, the following model shows that hypothetically 972 ping
pong balls will fit in the box.

4. You cannot place exactly three CDs on each shelf because there are only 5 shelfs and three
CDs Per shelf is 12 CDs total. There is also no solution that shows three CDs or less,
because again you have 16 total CDs.

8. On each subsequent checkerboard there will be double the amount of the first and each
square after that will be doubled so; 36 x 236 = 2473901162496 pieces of gold, thus the mans
modesty is not quotes so giving the king good reason to execute him.
9. The number 29 is the 7th Lucas number thus making it interesting but not the same at 27.
MINDSCAPES 2.2

1. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377

2. 1.615
4. When you take 2+2/(2+2/2) that equals 8/3 or 2.66 Then you get a similar result when you
take 3+3/(3+3/3) the result is 15/4 or 3.75.
Time In
Months
Number
of Pairs

Start
1

16

32

64

6. To complete the table we just have to double each time.

10. The first two numbers are 2 and 1 so we have 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322,
521, 843, 1364. because you are adding the previous two numbers much like the fibonacci
sequence. The Lucas number approach 1.6180339. The first two numbers determine this
because of there divided relationship. Assuming that we use two different numbers for the start
of this sequence say 6 and 7 we have the sequence 6, 7, 13, 20, 33, 53, 86, 139, 225, 364, 589,
953, 1542, 2494, 4036. We shall call this sequence the Chistman sequence providing there isn't
already one. These number approach 1.61.
14. 5 F(n) = L(n-1) + L(n+1) This is true because we know the numbers in the sequence, so if
we take the starting number and go from there we are left with the above equation.

MINDSCAPES 2.3

1. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47
2. 6 is equal to 2 x 3, so we have 1, 2, 3, 6. 24 is equal to 23 x 3, therefore we have divisors of 1,
2, 3, 4, 6, 8, 12, 24. 27 is equal to 33 so the divisors are 1, 3, 9, 27. 35 is equal to 5 x 7 so its
divisors are 1, 5, 7, 35. 120 is equal to 23 x 3 x 5 so its divisors are 1, 2, 3, 4, 5, 6, 7, 8, 10, 12,
15, 20, 24, 30, 40, 60, 120.
8. First question is no, a prime has two factors 1 and itself, so that cant happen. Second a nonprime and a non-prime Since you are multiplying two numbers, the product will always be
divisible by those 2 numbers and thus is not prime.
12. No, because a prime would have a remainder.
14. The first fifteen even numbers as prime are as follows,
4=2+2
6=3+3
8=3+5
10 = 3 + 7 = 5 + 5
12 = 5 + 7
14 = 3 + 11 = 7 + 7
16 = 3 + 13 = 5 + 11
18 = 5 + 13 = 7 + 11
20 = 3 + 17 = 7 + 13
22 = 3 + 19 = 5 + 17 = 11 + 11
24 = 5 + 19 = 7 + 17 = 11 + 13
26 = 3 + 23 = 7 + 19 = 13 + 13
28 = 5 + 23 = 11 + 17
30 = 7 + 23 = 11 + 19 = 13 + 17
25. To find our missing number we solve for x (x / 91 = 52). So, X = 4732. If we then add 103 to
that number we get 4835 and divide that by 7 we are left with 690.71.
33. A/n will leave the remainder a less than n. B/n will leave b less than n as well. Now, the thing
is that the remainder for (A+B)/n is going to be related to a + b. This is because the whole
number parts have nothing to do with the remainders. The remainder of (A+B)/n is going to be

a+b, unless a+b is greater than or equal to n. However, if a+b is greater than or equal to n, then
the remainder of (A+B)/n will simply be a+b-n, as that will remove the whole number portion of
the addition.
Examples:
A = 9, B = 13, n = 4
a = 1, b = 1, Remainder A + B = 2.
A = 13, B = 18, n = 7
a = 6, b = 4, Remainder A + B = 3

MINDSCAPES 2.4

1. In 12 hours the time will be 3 again, in 24 hours the time will be again be 3 the same is true
for 240 hours. When an elephant sits your watch its time for a new watch!
3. To find 24 mod 7, first divide 24 by 7
24 / 7 = 3.4285... Subtract the integer from your result, in this case 3. You'll be left with a weird
decimal. Multiply that decimal by seven, since you want your answer in mod seven. ((24 / 7) - 37
= 3 So, 24 mod 7 is 3.
4. 7 mod 3 = 1, because 7-3=4, 4-3 = 1
7^2 mod 3 = 1, because 49-(3*16) = 1 (we subtracted the largest multiple of 3
that is less than 49)
(7 mod 3)^2 mod 3 = 1^2 mod 3 = 1 mod 3 = 1
It is easier to compute 7 mod 3 first, then square the result.
To reduce 7^1000 mod 3, we will change it to [(7 mod 3)^1000 mod 3], because
we don't want to compute 7^1000:
1^1000 mod 3 = 1 mod 3 = 1
8. July plus 219 months is October, July plus 120,963 months is also October, 89
months ago from today was August of 2007.
12. The first choice is the correct one
20. Yes it is, I was easy to see verifying against the text book.