I've gotten this far and don't know what to do....
I am trying to simplify this further.

U=X(not) Y Z+X Y(not) Z+ X Y Z(not)+ X(not) Y(not) Z(not)

 

You can simplify further if you use an XOR, otherwise that's as simple as it gets as far as I can tell.

 

Sorry, im having trouble understanding these concepts
How Would I use the Ex-or function for this??.... would it then simplify to X and or Z? hmm..

 

Do you know the truth-table for xor? xor has nothing to do with your X variable.
XOR:
A B | Q
0 0 | 0
0 1 | 1
1 0 | 1
1 1 | 0

Are you using a k-map to help you simplify? If you draw out the k-map, you'll notice a checkerboard pattern, which is indicative of an xor function.

 

Thanks alot for your help!... The K-map helped me see it

 

I've gotten this far and don't know what to do....
I am trying to simplify this further.

U=X(not) Y Z+X Y(not) Z+ X Y Z(not)+ X(not) Y(not) Z(not)

This can be simplified by merely taking common factors: Z(NOT) and Z are ones that jump out immediately.

Again check the Boolean Algebra page here at AAC: http://www.allaboutcircuits.com/vol_4/chpt_7/index.html

Dave