maths
posted by anonymous .
A dog is standing at the bottom left corner of a grid of 46×46 streets. The dog is trying to get to the top right corner of the grid, where it knows there is some food. As the dog runs, between the corners, it will only ever run up and to the right. Any time the dog runs to the right, it runs at least 4 consecutive blocks to the right, and any time it runs up, it runs at least 12 consecutive blocks up. How many different intersections are unreachable for the dog by following these rules?
Details and assumptions
The last stretch that the dog runs must also satisfy the condition on the minimum number of consecutive blocks.
Respond to this Question
Similar Questions

Physics
At each corner of a square of side script i there are point charges of magnitude Q, nQ, mQ, and 4Q, where n = 3 and m = 3. Determine the force on the charge mQ due to the other three charges. (mQ is on the bottom right corner, nQ is … 
math
John ties the leash of his dog to the corner of the doghouse. The dimensions of the dog house are 8ft x 8ft, and the leash is 10ft long. (hint: the chain is longer than the side of the dog house.) a) About how many square feet can … 
maths
Consider a 25×25 grid of city streets. Let S be the points of intersection of the streets, and let P be the set of paths from the bottom left corner to the top right corner of which consist of only walking to the right and up. A point … 
math
Consider a 25×25 grid of city streets. Let S be the points of intersection of the streets, and let P be the set of paths from the bottom left corner to the top right corner of which consist of only walking to the right and up. A point … 
math
Consider a 25×25 grid of city streets. Let S be the points of intersection of the streets, and let P be the set of paths from the bottom left corner to the top right corner of which consist of only walking to the right and up. A point … 
math
Consider a 25×25 grid of city streets. Let S be the points of intersection of the streets, and let P be the set of paths from the bottom left corner to the top right corner of which consist of only walking to the right and up. A point … 
math
Consider a 25×25 grid of city streets. Let S be the points of intersection of the streets, and let P be the set of paths from the bottom left corner to the top right corner of which consist of only walking to the right and up. A point … 
math
Consider a 25×25 grid of city streets. Let S be the points of intersection of the streets, and let P be the set of paths from the bottom left corner to the top right corner of which consist of only walking to the right and up. A point … 
maths
Consider a 25×25 grid of city streets. Let S be the points of intersection of the streets, and let P be the set of paths from the bottom left corner to the top right corner of which consist of only walking to the right and up. A point … 
math
A dog is standing at the bottom left corner of a grid of 46×46 streets. The dog is trying to get to the top right corner of the grid, where it knows there is some food. As the dog runs, between the corners, it will only ever run up …