jump to navigation

## Problem of the Day #9: A Simple Number Theory ProblemMarch 28, 2011

Posted by Seungln in : potd , trackback

Let $V(x)$ be the possible number of positive integers $n$ such that $n^{-1}$ in modulus $x$ exists – that is, there exists an integer r such that $n \equiv \frac{1}{r} \pmod{x}$. Find $p$ such that $V(1998)\equiv p \pmod{330}$

## Comments»

no comments yet - be the first?