Answer: N >/= 7 bits
Minimum of 7 bits
Step-by-step explanation:
The minimum binary bits needed to represent 65 can be derived by converting 65 to binary numbers and counting the number of binary digits.
See conversation in the attachment.
65 = 1000001₂
65 = 7 bits :( 0 to 2^7 -1)
The number of binary digits is 7
N >/= 7 bits
Answer:
72
Step-by-step explanation:
brainliest please
Answer: 3t = 60
Step-by-step explanation:
Answer:
4
Step-by-step explanation:
gcf(432,320,228)=gcf(gcf(432,320),228)
432=320(1)+112
320=112(2)+96
112=96(1)+16
96=16(6)
So the gcf(432,320)=16.
So now we need to find gcf(16,228)
228=16(14)+4
16=4(4)
Therefore,
gcf(432,320, 228)
=gcf(gcf(432,320),228)
=gcf(16, 228)=4
===================================
432=4(108)=4(2)(54)
=4(2)(6)(9)=2(2)(2)(2)(3)(3)(3)
320=4(80)=4(2)(40)=2(2)(2)(4)(10)
=2(2)(2)(2)(2)(2)(5)
228=4(57)=2(3)(38)=2(2)(3)(19)
All three of them have 2*2 in commom, so the greatest common factor is 4.