Course!
Well, I tried to manualy minize it, but all i got was:
F = A(CD + B) + BC'
And that's all!
I'm really confused about the De Morgan's theorem, how to use it to design and draw a circuit only with the NAND ports. I know how to make an inversor, AND and OR ports from only NANDs, but I'm not sure if that is all that I need for this.
Also, I used a software called "Logic Friday" to minimize it, but it gave me the same logical function.
that is already minimized form
to make use of NANDs means to produce terms in form
(XY)'
in your case it would be something like
ACD+AB+BC'=
(ACD+AB+BC')"=
[((ACD)'(AB)'(BC')']'=
[((AC)"D)'(AB)'(BC')']'
etc.
note that (AC)' need to be inverted one more time before anding with D.
we can do the same to get around 2-input limitations for final gate. in example here that one is still using 3 inputs but you can finish it same way the rest was done (hint, read the note).
= (ACD+AB+BC')" First, you double negated all the equation
= [((ACD)'(AB)'(BC')']' After, used De Morgan,
[((AC)"D)'(AB)'(BC')']' And lastly, i didn't understand how you isolated AC from D.
The most brain-dead and fool-proof (but not the shortest) method you can use, is to construct a truth table from the given expression and then find the Sum of Products solution, which is most of the time, the shortest.