Simplify Boolean Expression

[Return 0]

I'm a bit rusty on my boolean algebra, does anyone see a way to simplify this down to the simplest form? Even my boolean algebra calculator says it can't be reduced.

xy'z' + x'y'z + x'yz'

[1yR4jE8b]

I'm too lazy to do it myself, but have you tried a Karnaugh Map?

[jsmith]

The expression is 1 iff exactly one of x, y, and z is 1.

[1yR4jE8b]

I was bored, so I did the KMap

  || 00  | 01  | 11  | 10  | 

1 ||  1  |  0  |  0  |  0  |
0 ||  0  |  1  |  0  |  1  |

Apparently it can't be minimized

[Return 0]

Yeah that's what I thought. Just wanted to confirm. Thank you for taking a look.