QwikChek Puzzle Series #03 Mystery Cache

The Mobius function is a mathematical equation of a discrete one-sided curve defined by y=µ(n) where µ is defined as µ(n) = (-1)r where k1=kr=1 and µ(1)=1.  Therefor µ = -1 for each prime and is used as the Prime Number Theorem.  The resultant is a square wave horizontal representation from µ(n) to µ(n)py and is popularised as a single-sided ribbon.  I always kept a copy of this graph in my wallet to remind me of this easy function that can determine a graphical representation of the Prime Sequence.  I keep mine horizontal though.  Just makes more sense to me that way.  After substituting your own values for (n) and (p) you can deduce (k) for yourself and find the coords to the cache. HTH goes to tjoklits who came along to reposition the final. Dankie!

You can validate your puzzle solution with certitude.