Answer:
Polinomios irreducibles (primos) Un polinomio con coeficientes enteros que no pueden ser factorizados en polinomios de grado menor, también con coeficientes enteros, es llamado un polinomio irreducible o primo
Step-by-step explanation:
The answer is x>2 I believe.
Given: <span>2x-y-3=0.
find </span>equation for the line perpendicular to the given line that goes through the given point:<span>
(2;-1)koord of direction vector (i`m not know how it is called at you, because i'm from russia)</span><span>
=> (x-0)/2=(y-4)/-1 (</span>canonical <span>equation)
=>x+2y-8=0(general </span><span>equation)
</span>
<span>further:
{x+2y-8=0
{2x-y-3 =0 => y=13/5 x=14/5
(14/5; 13/5) - koord point on line
</span>|dist|=sqrt( (14/5-0)^2 + (13/5-4)^2 ) = sqtr(7.72) = 2.78
Удачи!
<span>
.
</span>
Answer:
Store of value
Step-by-step explanation:
Look it up
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
