help karnaugl

Reply #16

dr san — Tue, 23 Aug 2011 17:49:38 GMT

Hello, Sulla, seeing I know this map karnagul, a suggestion to try to see examples of small segments in the three vertical columns and two each in the two lines instead of one digit only, of course I will join when the segment will give 5 digits, but it is easier to reduce After closing for 2 of 5 = 10picks, the idea is to get matching segments, then typed or drawn into this or not this means

Reply #15

sully16 — Tue, 23 Aug 2011 13:09:52 GMT

Thats been my goal for awhile now, good luck to you.

Reply #14

dr san — Tue, 23 Aug 2011 00:20:52 GMT

Hello Sulli, your money will come, but only when your subconscious discover how to how to connect the three columns to find peers to pick3. Because the matrix is like an electrical circuit lines has columns, the problem is how to join, because we have the option of three union The center of the left and right columns of the matrix!, I could not figure out this optimization, the cry of BINGO, maybe it was subconscious have seen something.

Reply #13

sully16 — Mon, 22 Aug 2011 23:00:07 GMT

I yelled Bingo, Where's my prize money.

Reply #12

lakerben — Mon, 22 Aug 2011 05:06:37 GMT

The truth table for an AND GATE. I think maybe set of numbers by sums or root sums maybe meeting conditions can be used in logic.

Maybe inputs to a multiplexor or (a to d converter).

Reply #11

rdgrnr — Mon, 22 Aug 2011 03:35:16 GMT

When I look at that elephant I'm reminded of one of Borat's lines concerning a part of his girlfriend's anatomy if I recall:

It hangs like the sleeve of a wizard .

Reply #10

susscs — Mon, 22 Aug 2011 03:26:15 GMT

But isn't the Elephant supposed to be Pink or is that Purple

Reply #9

joker17 — Mon, 22 Aug 2011 00:57:57 GMT

Ha ha...but where's the elephant? The equation isn't complete without the elephant.....

Reply #8

sully16 — Sun, 21 Aug 2011 23:32:19 GMT

Bingo

Reply #7

rdgrnr — Sun, 21 Aug 2011 23:28:50 GMT

Yeah sure, but did you consider this?

Makes a lot more sense that way, doesn't it

Reply #6

dr san — Sun, 21 Aug 2011 17:33:59 GMT

Hello. BJECTIVES of the map karnaugl, take it and join segments (pieces of peers or a digit) to form pick3, this is what I am trying to see! after spending up to 6 results in the matrix segment and the left and and right diagonal pick3 from the last (output) in both lines, vertical or diagonal segments see! understand

Reply #5

lakerben — Sun, 21 Aug 2011 16:42:21 GMT

Perhaps a trial run with NM p3.

614

984

396

636

071

242

752

044

911

022

869

224

842

686

386

411

344

Tell me what results you get for this weeks draws.

Reply #4

dr san — Sun, 21 Aug 2011 16:19:37 GMT

Ok laker! But it has put in a matrix = 1 1 1 2 2 2 3 3 3 4 4 4 5 5 5 6 6 6 7 7 7 8 8 8 9 9 9 0 0 0 Optimization of karnaugl by position, finding the stress segment columns.

1 1 1

2 2 2

3 3 3

4 4 4

5 5 5

6 6 6

7 7 7

8 8 8

9 9 9

0 0 0

Reply #3

lakerben — Sun, 21 Aug 2011 15:52:24 GMT

Dr San ,you may be on to something. Somebody could program with digital exclusive or's or maybe a ring counter. The possibilities are endless.

Or, if the result is high then input into a OR GATE. If both low inputs into a AND GATE then the output is low which means either go with another low combo or go the other direction. Thus use hhh for the next game 789 or 889 999. THE USER WOULDN'T HAVE TO UNDERSTAND THE GATES JUST INPUT PAIRS! The result would tell whether to go high or low on the... [ More ]

Reply #2

dr san — Sun, 21 Aug 2011 12:34:22 GMT

Hello, joker, ok, but you understand the karnaugl and gray code as well!

How did you do?

You could see these two optimization system, to create a table for conversion of peer pick3? thanks

Reply #1

joker17 — Sun, 21 Aug 2011 01:54:20 GMT

I believe the right sequence is: 3 7 11 13 4 8 10 16 8 18 22 24 3 9 11 17

0 0 0 0 0 0 0 5 0 15 0 1 0 1 0 1 0 1 0 0 0 0 0 0 1 0 0 12 1 0 1 1 1 0 1 1 0 1 e l e p h a n t 1 1 1 1 2 1 1 0 0 0 0 0 0 4 0 0 0 2 0 0 0 12 0 0 0 0 0

help karnaugl

dr san — Sun, 21 Aug 2011 00:24:24 GMT

How to Karnaugh maps of the table that makes converting gray code to binary code ????????

I'm not getting to the Karnaugh maps! is the next table below shows the conversion of gray code to binary: N G3 G2 G1 G0 B3 B2 B1 B0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 2 0 0 1 0 0 0 1 0 3 0 0 1 1 0 0 1 1 4 0 1 0 0 0 1 0 0 5 0 1 0 1 0 1 0 1 6 0 1 1 0 0 1 1 0 7 0 1 1 1 0 1 1 1 8 1 1 0 0 1 0 0 0 9 1 1 0 1 1 0 0 1 10 1 1 1 0 1 0 1 0 11 1 1 1 1 1 0 1 1 12 1 0 0 0 1 1 0 0 13 1 0 0 1 1 1 0 1 14 1 0 1 0 1 1 1 0... [ More ]