Anyone Good With Proving Sets?
2013-11-15, 11:12 AM,
#1
Hey guys, so I got a math question for a computer science course, this one is giving me a bit of trouble Can anyone point me in the correct direction?

Prove that:

A n B is a subset of (A n C) u ( B n C') without the use of set algebra.

n - intersection
u - union
A - set a
B - set b
C' - C compliment.

All input is appreciated.
Reply
2013-11-16, 12:15 AM,
#2
Im poor at sets, but try drawing Venn Diagrams! That helps a lot.

Join The Best Network Today And Earn REAL Money! The secret to success lies here.

[Image: jqE21u3.gif]
Reply
2013-11-16, 05:02 AM,
#3
(2013-11-16, 12:15 AM)superhero99 Wrote: Im poor at sets, but try drawing Venn Diagrams! That helps a lot.

Wish I could draw them, but it's a proof and drawing diagrams is not a proof. Managed to get it out using proof by contradiction.
Reply


Possibly Related Threads...
Thread Author Replies Views Last Post
  Were you good students at primary school? ruskiczoug 10 300 2017-11-25, 05:34 PM
Last Post: bryan1
  Have you ever been or seen a good fight? Flipin_jackass 8 166 2017-08-18, 11:21 PM
Last Post: siyaram
  Good movies to see? SnackyCPA 11 319 2017-08-16, 12:39 PM
Last Post: sorsabata
  Were you ever given any GOOD sexual advice? Elites_Mate 51 1,954 2017-06-03, 12:14 PM
Last Post: salen72
  A good sportsmanship dontme 6 290 2017-04-19, 02:50 AM
Last Post: citarist





About Us | Contact Us | CPA Elites | Advertise | Stats | Staff Team

© 2013-2017 CPA Elites Ltd
Enhanced by MyBB and WallBB
Return to top