Hi everyone!
I know Quine–McCluskey algorithm for minimization of boolean functions. but there's this Petrick's method for determining the prime implicants that I need to know about. I've read some stuff about it but I didn't get it the way I should. can somebody please explain it in the simplest possible way?
I would be really grateful.

 

I was about to take a pic of my digital design notebook. But I just saw wiki and found that the info in wiki and my notes match exactly. So here it is http://en.wikipedia.org/wiki/Petrick's_method

 

If you dont understand just say it. I'll elaborate