Recent content by croxbearer

i have my answer, using your approach: r = 804 y = 201 x = 47 here is the matrix i made: 74 66 49 57 42 33 62 41 55 42 47 56 30 60 43 47

since each of the 5 people in the race aim to win the race, and nice guys always finish last, hence, one of the 3 not nice guys will win the race and one of the 2 nice guys will finish last. anyway, its unimportant who will finish last!

If logarithm is allowed: 93 = 4 x 4! - log(4/.4%)

so it means we only need two 3's instead of three?

Hi Pete, I said a short prayer for your recovery. May God bless you! Chris

...siguro joke lang yan! :smile: :biggrin:

isn't it that if your draw it in a diagram, it would look like a straight line?

yes it is..

... or it can be this way also... nth term = (2*n^3 - 3*n^2 + n)/2 , where n=1,2,3,4,5,... :cool:

i think it would be simpler to express the formula like this: nth term = (2*n^3 + 3*n^2 + n)/2 , where n=0,1,2,3,4,...

i guess the next number is... 165

is it a telephone?

the distance between the two poles is zero. 25 m - 16 m = 9 m (length of half the cable at distance zero) 9 m x 2 = 18 m (length of cable)

>>> I will go to the second barber - the slob one. Since, there are only TWO barbers in town, and it was mentioned that he has a terrible haircut. That means, the well-groomed barber did his haircut. And also maybe, the reason why his shop was dirty is because he has lot of customers, which...

I am sorry. May I rephrase the question with: Could you produce a string containing exactly the characters, MU?