Una urna contiene 13 bolas negras, 12 rojas y 7 blancas. ¿cual es el meno numero de extracciones para tener la certeza que hay a lo menos de cada color

i would pic false cause it goes down towards negative

step-by-step explanation:

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)

whole number data type

step-by-step explanation:

as whole number type represents whole number

like 1, 2 ,3, 4

in other words the whole numbers are those numbers which cannot be written infraction.

since we can take days as a whole number i.e 1 day 2 day and we cannot write 1.2 day hence we will use whole number data type