For any positive integers q, n, m with q being a prime power and \(n \ge 5\) , we establish a condition sufficient to ensure the existence of a primitive normal pair \((\epsilon ,f(\epsilon ))\) in \(\mathbb {F}_{q^{n}}\) over \(\mathbb {F}_{q}\) such that \(\textrm{PN}_{q^n/q}(\epsilon )=a\) , where \(a\in \mathbb {F}_{q}\) is prescribed. Here \(f={f_{1}}/{f_{2}}\in \mathbb {F}_{q^n}(x)\) is a rational function subject to some minor restrictions such that deg( \(f_{1}) + \text {deg}(f_{2})=m\) and \(\begin{aligned} \textrm{PN}_{q^n/q}(\epsilon ) =\sum _{i=0}^{n-1}\Bigg (\underset{j\ne i}{\underset{0\le j\le n-1}{\prod }}\epsilon ^{q^j}\Bigg ). \end{aligned}\) Finally, we conclude that for \(m=3\) , \(n\ge 6\) , and \(q=7^k\) where \(k\in \mathbb {N}\) , such a pair will exist certainly for all (q, n) except possibly 10 choices at most.