[Bas]

well, I did 11!/(5!*6!)....But I'm not sure...

wait...10!/(4!*6!) = 210...

[idomar]

either 666,

or four kajillion,

maths was never my forte, although if you turn it into a maze by colouring in some of the squares a-la fast food restaurant place mats, Ill happily have another stab at it.

[jasonraymondson]

$this->bbcode_second_pass_quote('Bas', 'w')ell, I did 11!/(5!*6!)....But I'm not sure...

wait...10!/(4!*6!) = 210...

[Bas]

well 14!/(10!*4!) = 1001....but that was wrong right?

[dinopello]

$this->bbcode_second_pass_quote('jasonraymondson', '')$this->bbcode_second_pass_quote('SteinarN', '1')001

[jasonraymondson]

$this->bbcode_second_pass_quote('dinopello', '')$this->bbcode_second_pass_quote('jasonraymondson', '')$this->bbcode_second_pass_quote('SteinarN', '1')001

[jasonraymondson]

$this->bbcode_second_pass_quote('Bas', 'w')ell 14!/(10!*4!) = 1001....but that was wrong right?

[dinopello]

$this->bbcode_second_pass_quote('', 'T')his is only college algebra level stuff

[Bas]

$this->bbcode_second_pass_quote('jasonraymondson', '')$this->bbcode_second_pass_quote('Bas', 'w')ell 14!/(10!*4!) = 1001....but that was wrong right?

[jasonraymondson]

Does everyone give up, or would you like more time. It is going to make you sick to see how close you were to the problem if I tell you.

[Andrew_S]

Why not wait until later, even tomorrow, to give others a chance?

[MD]

2nd hint:

There is one path that leaves 40 squares below the line.
There is one path that leaves 39 squares below the line.
there are two paths that leave 38 squares below the line.

....

There is one path that leave 40 squares above the line.

[MD]

it's not linear

[jasonraymondson]

$this->bbcode_second_pass_quote('MD', '2')nd hint:

There is one path that leaves 40 squares below the line.
There is one path that leaves 39 squares below the line.
there are two paths that leave 38 squares below the line.

....

There is one path that leave 40 squares above the line.

[SteinarN]

I'm pretty sure the right answer is 1001. I havent found a formula to get the answer, but i made a table. In the right upper corner there is only one alternative route, hence the numper one. In the field to the left from the right upper corner you have to go down to field 4 to have another path. From there it is 4 different paths to the lover left. In the field one mor to the left there is 10 different paths to the end. And so forth.
286+220+165+120+84+56+35+20+10+4+1=1001


_____________________________________________________
I1001_I_____I_____I_____I____I____I____I____I____I____I__1_I
I_286_I_220_I_165_I_120_I_84_I_56_I_35_I_20_I_10_I__4_I____I
I__66_I__55_I__45_I__36_I_28_I_21_I_15_I_10_I__6_I__3_I____I
I__11_I__10_I___9_I___8_I__7_I__6_I__5_I__4_I__3_I__2_I____I
I___1_I___1_I___1_I___1_I__1_I__1_I__1_I__1_I__1_I__1_I____I

[dinopello]

$this->bbcode_second_pass_quote('SteinarN', 'I')'m pretty sure the right answer is 1001. I havent found a formula to get the answer, but i made a table. In the right upper corner there is only one alternative route, hence the numper one. In the field to the left from the right upper corner you have to go down to field 4 to have another path. From there it is 4 different paths to the lover left. In the field one mor to the left there is 20 different paths to the end. And so forth.
286+220+165+120+84+56+35+20+10+4+1=1001


_____________________________________________________
I1001_I_____I_____I_____I____I____I____I____I____I____I__1_I
I_286_I_220_I_165_I_120_I_84_I_56_I_35_I_20_I_10_I__4_I____I
I__66_I__55_I__45_I__36_I_28_I_21_I_15_I_10_I__6_I__3_I____I
I__11_I__10_I___9_I___8_I__7_I__6_I__5_I__4_I__3_I__2_I____I
I___1_I___1_I___1_I___1_I__1_I__1_I__1_I__1_I__1_I__1_I____I

[Andrew_S]

I get 1001 with this C program:

$this->bbcode_second_pass_quote('', '/')* villageidiot1.c */

#include <stdio.h>
#include <stdlib.h>

int h, i, j, k;

int
main()
{
int num = 0;

for(h = 1;h <= 11;h++){
for(i = h;i <= 11;i++){
for(j = i;j <= 11;j++){
for(k = j;k <= 11;k++){
num += 1;
}
}
}
}
printf("%d", num);
return 0;
}

[Andrew_S]

$this->bbcode_second_pass_quote('dinopello', '')$this->bbcode_second_pass_quote('SteinarN', 'I')'m pretty sure the right answer is 1001. I havent found a formula to get the answer, but i made a table. In the right upper corner there is only one alternative route, hence the numper one. In the field to the left from the right upper corner you have to go down to field 4 to have another path. From there it is 4 different paths to the lover left. In the field one mor to the left there is 20 different paths to the end. And so forth.
286+220+165+120+84+56+35+20+10+4+1=1001


_____________________________________________________
I1001_I_____I_____I_____I____I____I____I____I____I____I__1_I
I_286_I_220_I_165_I_120_I_84_I_56_I_35_I_20_I_10_I__4_I____I
I__66_I__55_I__45_I__36_I_28_I_21_I_15_I_10_I__6_I__3_I____I
I__11_I__10_I___9_I___8_I__7_I__6_I__5_I__4_I__3_I__2_I____I
I___1_I___1_I___1_I___1_I__1_I__1_I__1_I__1_I__1_I__1_I____I

[Bas]

there's no equation; you have to use combinatoral mathematics for the easiest way to get to the answer:

14!/(10!*4!) = 1001

I also believe 1001 is the correct answer.

[inculcated]

Must be a trick question....