El mcd de dos numeros es 13 y los cocientes sucesivos que se obtienen meidante el algoritmo de euclides son 11,9,1,1,2 . Calculaar el menor numero

El número más pequeño es 3665844.

Step-by-step explanation:

Deje que los números sean X e Y

Por algoritmo euclidiano, tenemos

Por lo tanto tenemos X / Y = 11 + R

Y / R = 9 + S

R / S = 1 + T

S / T = 1 + U

T / U = 2

Dónde:

R, S, T y U son el resto en cada paso

Por lo tanto, 2U = T

Lo que da;

MCD (X, Y) = MCD (Y, R) = MCD (R, S) = MCD (S, T) = MCD (T, U) = 13

T / U = 2

y MCD (T, U) = 13

Por lo tanto, 2 y 13 son factores de T y U si T = 26 y U = 13, tenemos;

S = T (1 + U) = 364

R = S (1 + T) = 9828

Y = R (9 + S) = 3665844

X = Y (11 + R) = 36068239116

Los números son 36068239116 y 3665844

Por lo tanto, el más pequeño de los números = 3665844.

for the friend request.

when a figure, such as triangle (xyz) is reflected over the line y = x to create x'y'z' the x-coordinates and y-coordinates of the original image (pre-image) will be reversed for the image. (e.g., (x, y) > (y, x)) this means that the pre-image position of the x- and y-coordinates switch places which in turn provides a mirror like image of the original xyz.  

i notice that when i draw a line segment from x to x', that the points are parallel from each other -- they are exactly across from each other and do not intersect with any other points.  

yes, think i would see the same characteristic if you drew the line segment connecting y with the reflecting line and then y' with the reflecting line because of the essence of reflections. because it is a mirror image, each point was effected the same way which leads me to conclude that they same would apply to y and y'.