Python code:
all = 0
greencanad = 0
for a in range(1, 100001):
if a % 8 == 0 and a % 12 == 0:
if a % 9 == 0:
all += 1
else:
greencanad += 1
print "all = ", all
print "greencanad = ", greencanad
gives 1388 pizzas with all the toppings and 2778 with canadian bacon & green pepper.
All 3 = 1388
Just the 2 - 2778
Every 24th pizza has the 2 toppings, but every 72 pizza has all 3.
THere will be 2 more times at the end for the 2 toppingsh
1- We have have to take the LCM (Least Common multiple) of 8, 9 ,12 which happens to be 72. So every 72nd pizza has all the toppings. So total no. of pizzas equals 100,000 divided by 72 which is 1388.89. Therfore 1388 pizzas will be made.
2- Again we begin by taking the LCM of 8 and 12 which is 24. Every 24th pizza has both canadanian bacon and green pepers but to avoid pineapple we have to remove 72 and its multiples because only there pineapples would come.
100,000 divided by 24= 4166.66 pizzas. Now we have to subtract the no. of pizzas where pineapple was there which is 1388. Therefore answer is 2778 pizzas.
Python code:
all = 0
greencanad = 0
for a in range(1, 100001):
if a % 8 == 0 and a % 12 == 0:
if a % 9 == 0:
all += 1
else:
greencanad += 1
print "all = ", all
print "greencanad = ", greencanad
gives 1388 pizzas with all the toppings and 2778 with canadian bacon & green pepper.
the answer is correct.
i think that it's maths puzzel forum so please use maths to solve puzzel rather than using code
i think that it's maths puzzel forum so please use maths to solve puzzel rather than using code
I don't agree with you, computers can very well be used for mathematics.
For example, prove that:
'given any separation of a plane into contiguous regions, called a map, the regions can be colored using at most four colors so that no two adjacent regions have the same color'
This was the first major theorem that had a computer-assisted proof, as stated on wikipedia: http://en.wikipedia.org/wiki/Four_color_theorem
I agree with Snail as well
I have a problem For You no calculators or coumputers for this one.
Consider this sequence of numbers:
S0= 10pi
S1= S0-(10^3pi^3)/3!
S2= S1+(10^5pi^5)/5!
S3= S2-(10^7pi^7)/7!
S4= S3+(10^9pi^9)/9!
if we continue this pattern indefinitely, the numbers on the right converge to:
a) 0
b) a large positive number
c) a large negative number
d) the numbers don't converge
also give a reason why.
A machine processing pizzas in a factory puts the following ingredients on top of the pizza in this order.
canadanian bacon to every 8th pizza,
pieces of pineapple on every 9th pizza,
and green pepers to every 12th pizza.
Since it was turned on at the beginning of the week, the machine has processed 100,000 pizzas.
(1)How many pizzas have all the toppings?
(2)How many pizzas have the toppings of canadanion bacon and green pepers without pineapple pieces?
Very basic, solve and post.
first person to solve (WITH EQUESTION) will get a fun trofhy of his or her choice.