3-bit to 6-bit combinational circuit for squaring binary numbers

[mr_coffee]

One of my questions say:
Designa combinational circuit that accepts a 3 bit number and generates a 6 bit binary number output equal to the sqaure of the input number.

Now when it says it wants a 3 bit number as the input does it mean like
ABC
000
001
010
011
100
101
110
111

then the output would be
000 000
000 001
how would u make a 6 bit output of 010 == 2 in decimal? maybe I'm confused, wait i know i am! can anyone help?

 

[mr_coffee]

Wait i get it now...
if i would multiply
111
111
i would get
110001
but how would i implement that in a truth table?
like would it be
ABC DEFGHI
111 110001
Then my min term would be DE'F'G'HI ?

 

[mr_coffee]

I figured it out...

 

[kabukiUkie]

I have the same question. Can you explain how you did this please? I need the table with inputs and ouput and the minimized equation for it.