The circular wait condition states that there exists a chain of processes where each process is waiting for a resource that is being held by another resource.
According to the question, N number of processes are competing for a single resource R.
There will be a deadlock if all of them are waiting for R but there must exist a process Pk which is holding R
So the system will not be in deadlock (Assuming any process needs only a single instance of R)