Project Euler 8 Mystery Cache

Acknowledgements

This cache was inspired by Project Euler.

General notes

• To solve Project Euler puzzles, you will probably have to write a computer program.
• Many of the containers are small, and contain neither pen nor pencil.
• There are explicit finding notes in each geochecker.

The Puzzle

Consider this 1,000 digit number:

1355613664861615395867159118565849988222
2435499155382748149528243525677359158513
5925555525915593486625163845335742529177
4945884992583888713586959353325371285863
4527556159453136169552656237521466189494
2926282842422544575657193177254372565384
7578651555554957846342869631618327939471
2595118868818488848314826896215291925683
5225554139985432273982175695464436959365
2925455741532524859243296535265985915615
9649558271552149474951751255572354764123
5454245963359517171758578148483576114941
5699758963118533235677579777857783145594
5156736618535351738584345564859533597453
5284537611494391785624679221657377757736
1571259726562268981155518851758533754826
9511456994376567139635293613976279438695
5855356261247689445415149575755921738873
1826298656536494892753185475323685575252
5399655351278753216569725742449242367293
7916156784439866172694735593169554797637
3694235551672751627552155766328253287815
7944714172584449698716665823258253619731
9589568949115515358487326541185295343755
1889985528289231857785525477114644633845

If you calculate the products of sets of four adjacent digits, you will find that the largest product is 5184 and the smallest is 16.

To find this cache, repeat this calculation with sets of 13 adjacent digits.

The Northing is 52 11.abc, where abc are the first three digits of the biggest product.

The Easting is 0 7.def, where def are the first three digits of the smallest product.