Alright..Story problem consists of building a path of blocks 1 ft. by 2 ft. The ending path should be 20 feet long, but with the rectangular blocks, [may need to draw picture] you can put them widthwise (makes path 1 foot longer, while still being 2 feet wide) OR lengthwise (two blocks together, also making the path 2 feet wide, but is now 2 feet long.) The goal is to see how many different combinations you can make for 20 ft. path. You make a X,Y table, (X rep. the length of the path in feet, and Y is the number of combos you can make with the blocks) So..X: 1,2,3,4,5,6,7..etc. While Y:1,2,3,5,8,13,21,55,76 (you can se the pattern is adding the first 2 y values to get the third EX 1+2=3; 3+5=8 ..ETC.) Now the hard part is finding a working formula where you can take ANY X value and plug it in to get the correct value of Y...So far all i've seen is that the area of the path is 2(x) and that the X value is the number of blocks used in the combination..any ideas for a FORMULA? THANK YOU!
2006-11-25 17:45:12 · 1 answers · asked by Anonymous in Science & Mathematics ➔ Mathematics
Looks somewhat like a Diophantine problem...
A Diophantine equation is an equation in which only integer solutions are allowed.
2006-11-25 17:52:34 · answer #1 · answered by modulo_function 7 · 0⤊ 0⤋