Potencias de exponente negativo. Notación científica. 1.-Expresa en notación científica: a) Distancia de la tierra al sol \( =150000000 \mathrm{~km} \). b) Número de átomos de un gramo de oxígeno \( =37643750000000000000000 \) átom

Aşağıdaki kutuların içine \( 2,4,6,8,70 \) ve 12 sayılarından dört tanesi her kutuya farkıı bir sayı gelecek şekilde yerleştirildiğinde eşitlik sağlanmaktadır. \[ \sqrt{\square}+\sqrt{\square}=\sqrt{\square+\square} \] Buna göre, kutulara yerleştirilmeyen sayılarín toplamı kaçtır? \( \begin{array}{llll}\text { (A) } 12 & \text { B) } 14 & \text { C) } 16 & \text { D) } 18\end{array} \) E) 20

Graph the parabola. \( y=x^{2} \) Plot five points on the parabola: the vertex, two points to the left of the vertex, and two points to the right of the vertex. Then click on the graph-a-function button.

Cabinet \( X \) costs \( \$ 30 \), requires 12 sq ft of floor space, and holds 36 cu ft of files. Cabinet \( Y \) costs \( \$ 50 \), requires 6 sq ft of floor space, and holds 30 cu ft . To get maximum storage, how many of each should be purchased with a budget limit of \( \$ 450 \) and floor space of 96 sq ft ? The manager should buy \( \square \) of cabinet \( X \) and \( \square \) of cabinet \( Y \). (If two possibilities provide maximum storage, use the option that involves buying at least one of cabinet \( X \) and at least one of cabinet \( ~ \) .)

1. Fill in the Blank 16 points A sequence is defined by \( f(1)=8 \) and \( f(n)=3 f(n-1) \), for each whole number where \( n>1 \).

Cabinet \( X \) costs \( \$ 30 \), requires \( 12 \mathrm{sq} \mathrm{ft} \mathrm{of} \mathrm{floor} \mathrm{space} \),and holds 36 cu ft of files. Cabinet \( Y \) costs \( \$ 50 \), requires 6 sq ft of floor space, and holds 30 cu ft . To get maximum storage, how many of each should be purchased with a budget limit of \( \$ 450 \) and floor space of 96 sq ft? The manager should buy \( \square \) of cabinet \( X \) and \( \square \) of cabinet \( Y \). (If two possibilities provide maximum storage, use the option that involves buying at least one of cabinet \( X \) and at least one of cabinet \( Y \).)