How many of each specific coins are in a bottle? Question

Suppose you have a bottle that contains exactly twenty-two U.S. coins.These coins only consist of nickels(\$0.05), dimes(\$0.10), and quarters(\$0.25).
In addition to the types of coins, you also know the following statements to be true:

1. When added together, the coins hold a total value of \$2.55.
2. The number of nickels and the number of dimes is greater than the number
of quarters.
3. The number of nickels in the bottle is greater than five.

Using the information given, how can we calculate the quantity of each coin in the bottle?
Edit

In efforts to clarify any vagueness or lack of information, please consider the following questions and their respective answers.
Clarification

$(1)$ Can you provide a clarification of the 2nd constraint?


The number of nickels and the number of dimes is greater than the number of quarters.

Is it intended that $(n)$ and $(d)$ are each separately
$(>q)$.Furthermore, this means the constraint translates to $(n>q)$ and
$(d>q)$.

Additional Information

$(2)$ What is the source of the problem?

This problem originates from my undergraduate studies in a Linear
Algebra I course (MA-237). While this problem is not located in the
course textbook itself, a similar problem can be found on page 12
as "Exercise 1.37".
This is the free textbook (Author's Words):LINEAR ALGEBRA -
Fourth edition by Jim Hefferon:

https://hefferon.net/linearalgebra/


$(3)$ What theorems or previously solved problems or worked examples that led up to this problem do you think might be relevant?

When I originally posted this question, I intended to supply examples
and relevant information in the answer's reference section. I see now
that they should also be applied here.Please find them listed below:


*

*Constructing an Augmented Matrix

*Gaussian-Elimination Operations

*Insight into "Reducing a Matrix"

*Brief Explanation of Free Variables

*Parametric Vector Form Example


Background

$(4)$ In general, what is your Math education/background?

Currently, I am an Undergraduate Student seeking a Bachelor of Science
Degree with a minor in Mathematics.

$(5)$ What is your motivation for posting this question?

When I was a student in what we refer to at my university as MA-237 or
Linear Algebra I, I distinctly remember struggling to work through this problem due to the variety of concepts that are prevalent in its
solution.Through the answer I provided, I hope that any future
students also struggling to understand these concepts will find the
same understanding that I did at completing this question.

 A: Alternative approach:
Since the number of nickels must be greater than 5, and since $~\displaystyle \frac{255}{22} \approx 10$, a reasonable first guess is that there are $6$ nickels and $16$ dimes.
This totals $190$, which leaves a deficit of $65$.
It is clear, from the constraints of the problem that this deficit must be cleared by converting some of the dimes to quarters and converting some of the dimes to nickels.
Each dime --> quarter reduces the deficit by 15.
Each dime --> nickel increases the deficit by 5.
Since $65$ is not a multiple of $15$, and since you are not allowed to change nickels to dimes (since there must be at least $6$ nickels), it is clear that the conversion of dimes to quarters must focus on multiples of $15$ that are greater than $65$.
Further, the only (other) constraint to fade is that the number of dimes + the number of nickels must exceed the number of quarters.

Edit
The above paragraph may represent a misinterpretation of the 2nd constraint.  This issue is discussed more fully, later in this answer.

So, the obvious play is to explore converting 5 dimes to quarters, and 2 dimes to nickels.
This results in 8 nickels, 9 dimes and 5 quarters, which clearly satisfies all of the constraints.  However, it remains to determine whether this solution is unique.

One way of investigating this is to return to the baseline distribution of $(n,d,q) = (6,16,0)$ and its deficit of 65.
Consider what happens if you aim for the dime --> quarter conversion of $6$, rather than $5$.  You have changed the deficit from $(+65)$ to $(-25)$ which implies that you then have to convert a further $5$ dimes to nickels.
This results in $(n,d,q) = (11,5,6)$, which (arguably - see later in this answer) also satisfies the constraints.

At this point, one must question how the following constraint is to be interpreted:

*

*The number of nickels and the number of dimes is greater than the number of quarters.

I was interpreting this to mean that $(n + d) > q$.
However, the alternative interpretation is that

*

*$n > q$ and $d > q$.

Under this alternative interpretation, it is clear that
$(n,d,q) = (11,5,6)$ must be excluded, as well as any conversion of a greater number of dimes to quarters.
This leaves as unique, the original answer of $(n,d,q) = (8,9,5).$
Meta-cheating, one might guess that this is the problem composer's intent, since it is customary for the solution to be unique.  Then, one simply surmises that the pertinent (2nd) constraint is poorly written.

It only remains to explore, what other solutions, besides
$(n,d,q) \in \{(8,9,5), (11,5,6)\}$ are possible, under the alternative assumption that the 2nd constraint is to be interpreted as $(n + d) > q$.
Returning again to the baseline, of $(n,d,q) = (6,16,0)$, the conversion of $7$ dimes to quarters, changes the deficit from $(+65)$ to $(-40)$.  This means that you then have to convert $8$ (other) dimes to nickels.
This results in $(n,d,q) = (14,1,7)$ which also works. It is then clear that any conversion of a larger number of dimes to quarters, must be excluded, because this would trigger also converting dimes to nickels.  So, the result would be a negative number of dimes.
So, under the alternative interpretation, in addition to the answer of $(n,d,q) = (8,9,5)$, the only other permissible answers are $(11,5,6)$, or $(14,1,7)$.
