සුදු මහත්තයා;11281896 said:No need to draw 7 points. because all 1s are included this two points.so why we complex our output. Kanaugh maps purpose is simplify logic.
![]()
You haven't included 11 and 13
සුදු මහත්තයා;11281896 said:No need to draw 7 points. because all 1s are included this two points.so why we complex our output. Kanaugh maps purpose is simplify logic.
![]()
You haven't included 11 and 13
so it didn't care.
). Don't need to use a CCD. සුදු මහත්තයා;11281921 said:using 1 seven segment you cannot display 11 and 13.so it didn't care.

Machan the question doesn't ask for a seven segment display.
Only to identify whether a prime between 0-15 is present or not. So, there are 7 primes. We have to identify all 7 and give an output 1 if any of them is present.

oooops, sorry. I think she can correct it. 


normally this type of questions come with SSD. so I didn't read it carefully. 

සුදු මහත්තයා;11282149 said:oooops, sorry. I think she can correct it.
thanks for correction.normally this type of questions come with SSD. so I didn't read it carefully.
![]()



Look at this pdf, it has a solved minimized 4-bit input prime detector.
http://www.engr.usask.ca/classes/EE/232/EE232_2011/notes/04_combinational logic_part2.pdf
Use an LED for giving the output (they say to convert in to a circuit). Don't need to use a CCD.
here u can find the answer. but remember 1 is not a prime number.
so u hav to correct it.

Yes. But what to do is the question itself states as such, as in this case.. Just have to go with the question.![]()

Yes. But what to do is the question itself states as such, as in this case.. Just have to go with the question.![]()


![]()
![]()
A^D +ABC^D +AB^CD =answer
^= bar