Answer:
y = 5(x + 8)
Step-by-step explanation:
The first step is to add 8 to the input, you get x + 8. Then you need to multiply that number by 5. An equation that represents that is y = 5(x + 8).
*You can't just write down y = 5x + 8 because you are multiplying the result of x + 8 by five, not multiplying x by 5, then adding 8.
59 is the answer because I said so
This question is really simple if you focus on this part
“The sum of any two is divisible by the third”
<span>⟹⟹</span> Pairwise, the numbers must have a GCD greater than one.
Let this GCD be <span>xx</span>.
The first three easiest numbers I can think of are <span><span>x,2x</span><span>x,2x</span></span> and <span><span>3x</span><span>3x</span></span>
Because
<span><span>gcd(x,2x)=gcd(2x,3x)=gcd(3x,x)=x</span><span>gcd(x,2x)=gcd(2x,3x)=gcd(3x,x)=x</span></span>
The numbers sum to <span>9696</span>
<span><span>⟹x+2x+3x=96</span><span>⟹x+2x+3x=96</span></span>
<span><span>⟹6x=96</span><span>⟹6x=96</span></span>
<span><span>⟹x=16</span><span>⟹x=16</span></span>
The largest number is <span><span>3x=3×16=48</span><span>3x=3×16=48</span></span>
Thanks for the A2A
Answer:
the last one im p sure !!!
Answer:
110011
Step-by-step explanation:
The tedious way to do this is to divide by 2 until the quotient is 0, noting remainders at each step:
- 51/2 = 25 r 1
- 25/2 = 12 r 1
- 12/2 = 6 r 0
- 6/2 = 3 r 0
- 3/2 = 1 r 1
- 1/2 = 0 r 1
Taken from bottom to top, the list of remainders comprises the binary number: 110011.
___
Alternatively, you can convert the number to hexadecimal (base-16) or octal (base-8), then make the simple conversions from those digits to binary. In octal, we have ...
Then the number in octal is 51 = 63₈. Your familiarity with binary lets you write the binary number from memory, since you recall 6 = 110₂ and 3 = 011₂. Each octal digit must be expressed as three binary digits (or bits) in order to maintain appropriate place values.
That is, ...
63₈ = 110011₂
_____
<em>Comment on octal-binary conversion</em>
The binary values of the digits 0-7 are ...
- 0 = 000₂
- 1 = 001₂
- 2 = 010₂
- 3 = 011₂
- 4 = 110₂
- 5 = 101₂
- 6 = 110₂
- 7 = 111₂
Three binary bits can express numbers 0-7 as shown. So, using octal as an intermediate base in doing the conversion to binary lets you do the conversion 3 bits at a time, instead of one bit at a time.
Likewise, four binary bits can express numbers 0-15, so hexadecimal as an intermediate base lets you do the conversion 4 bits at a time: 51/16 = 3 r 3 ⇒ 0011 0011₂.
