Problem Set 1 PDF
Problem Set 1 PDF
December 2, 2019
GED102-A15
Problem Set 1
1. Alice, Ben and Carl collect stamps. They exchange stamps among themselves according to the
following scheme: Alice gives Ben as many stamps as Ben has and Carl as many stamps as Carl has.
After that, Ben gives Alice and Carl as many stamps as each of them has, and then Carl gives Alice and
Ben as many stamps as each has. If each finally has 64 stamps, with how many stamps does Alice start?
Statement 1
“If each finally has 64 stamps”
It is said that they all have 64 stamps at the end. So,
A = 64
B = 64
C = 64
Statement 2
“Carl gives Alice and Ben as many stamps as each has”
If Carl gives them as many stamps as they have, they will have 64 stamps. The trick is, what number must
the giver give and add it to itself to get the amount of 64?
The number is none other than 32.
So, Before Carl gives them the stamps, Alice and Ben has 32 stamps each while Carl has 128. Why 128?
Because, after Carl gives the stamp, he must have 64, giving away 32 to Alice and 32 to Ben, adding them
up 64 + 32 +32 = 128.
After:
Alice (Receiver) = 32 + 32(from Carl) = 64
Ben (Receiver) = 32 + 32(from Carl) = 64
Carl (Giver) = 128 - 32(given to Alice) - 32(given to Ben) = 64
Before:
Alice (Receiver) = 32
Ben (Receiver) = 32
Carl (Giver) = 128
Statement 3.
“Ben gives Alice and Carl as many stamps as each of them has”
After:
Alice (Receiver) = 16 + 16(from Ben) = 32
Ben (Giver) = 112 - 64(given to Carl) - 16(given to Alice) = 32
Carl (Receiver) = 64 + 64(from Ben) = 128
Before:
Alice (Receiver) = 16
Ben (Giver) = 112
Carl (Receiver) = 64
Statement 4
“Alice gives Ben as many stamps as Ben has and Carl as many stamps as Carl has”
After:
Alice (Give) = 104 - 56(given to Ben) - 32(given to Carl) = 16
Ben (Receiver) = 56 + 56(from Alice) = 112
Carl (Receiver) = 32 + 32(from Alice) = 64
Before:
Alice (Give) = 104
Ben (Receiver) = 56
Carl (Receiver) = 32
2. Solve the following cryptarithms. In each problem, letters represent a single digit only.
a. (HE)2 = SHE
602 = 3600
b. WRONG 123456
+ WRONG + 123456
------------------ ---------------
RIGHT 246912
3. How many squares of all sizes are in an 8x8 checkerboard?
4. In order to encourage his son in the study of algebra, a father promised the son P8 for every problem
solved correctly and to fine him P5 for each incorrect solution. After 26 problems, neither owed anything
to the other. How many problems did the boy solve correctly?
Let x - cs of correct solution
y - ws of wrong solution
8x - 5y = 0
x + y = 26
8(26 - y) - 5y = 0
208 - 8y - 5y = 0
13y = 208
y = 16
x = 10
• A sphere with a radius of 2.1851 units, the surface area equals 60 square
units.
6. If a pup is worth a pooch and a mutt, and a pup and a pooch are worth one bird dog, and two bird dogs
are worth three mutts, how many pooches is a pup worth?
a=b+c
d=a+b
2d=3c
Then:
b=a-c
d=a+a-c
2(a+a-c)=3c
4a-2c=3c
4a=5c
c=4a/5
a=b+4a/5
5a=5b+4a
a=5b
24 x 60 = 1440 minutes/day
143,999,999,995 + 5 = 144,000,000,000
8. Find the units digit for the sum 13^25 + 4^81 +5^411.
→ 4^81
The units digit is “4”
4 follows a powers cycle with a period of 2:
4 → 6 → 4 → 6…
Since 81 = 1 (mod 2) the units digit of 4^81 will be 4 (the same as 4^1).
→ 5^411
The units digit is “5”
The unit digit in the power cycle of 5 has a period of 1, meaning it is always the same digit no matter
what power it’s raised to. → 5.
So now we just add The units digits of these three terms to find 3+4+5 = 12.
12 has a units digit of 2.
Therefore, the units digit for the sum 13^25 + 4^81 +5^411 is 2.
9. Mang Ruben has only an 11-liter can and a 5-liter can. How can he measure out exactly 7 liters of
water?
Steps Involved: A is the 5 L can and B is the 11 L can.
1. Empty A and fill B to 11 L.
2. Transfer 5L to A and remaining 6 L in B.
3. Empty A and remaining 6L in B.
4. Fill A to 5L from B. Remaining in B is 1 L.
5. Empty A with B still 1 L.
6. Transfer 1L from B ro A and 0 L in B.
7. Fill B to 11 L with 1 L still in A.
8. Add 4L to A to fill it to 5L. B now has 7 L
The steps are summarized in a tabular form below:
STEPS 1 2 3 4 5 6 7 8
A 0 5 0 5 0 1 1 5
B 11 6 6 1 1 0 11 7
10. An egg vendor broke all the eggs that he was delivering to a local store. He could not remember how
many eggs there were in all. However, he did remember that when he tried to pack them into packages of
2, 3, 4, 5 and 6 he had one left over each time. When he packed them into packages of 7, he had none left
over. What is the smallest number of eggs he could have had in the shipment?
X mod 2 = 1
X mod 3 = 1
X mod 5 = 1
X mod 4 = 1
X mod 6 = 1
X mod 7 = 0
Therefore, 301 is the smallest number of eggs he could have had in the shipment.