Lösung 3.1:7c

Aus Online Mathematik Brückenkurs 1

(Unterschied zwischen Versionen)
Wechseln zu: Navigation, Suche
K (Lösning 3.1:7c moved to Solution 3.1:7c: Robot: moved page)
Zeile 1: Zeile 1:
-
{{NAVCONTENT_START}}
+
If we divide up
-
<center> [[Image:3_1_7c.gif]] </center>
+
<math>\text{153 }</math>
-
{{NAVCONTENT_STOP}}
+
and
 +
<math>\text{68 }</math>
 +
into their smallest possible integer factors, we can see whether there are squared numbers which can be taken out from under the roots, and if the expression can be simplified further,
 +
 
 +
 
 +
<math>\begin{align}
 +
& \text{153 }=3\centerdot 51=3\centerdot 3\centerdot 17=3^{2}\centerdot 17, \\
 +
& 68=2\centerdot 37=2\centerdot 2\centerdot 17=2^{2}\centerdot 17 \\
 +
\end{align}</math>
 +
 
 +
 
 +
We get
 +
 
 +
 
 +
<math>\begin{align}
 +
& \sqrt{\text{153}}\text{-}\sqrt{68}\text{ }=\sqrt{3^{2}\centerdot 17}-\sqrt{2^{2}\centerdot 17} \\
 +
& =3\sqrt{17}-2\sqrt{17}=\sqrt{17} \\
 +
\end{align}</math>
 +
 
 +
 
 +
NOTE: A good tip for when we investigate whether an integer is divisible by
 +
<math>\text{3}</math>
 +
is to look at the sum of the number's digits. A number is divisible by
 +
<math>\text{3}</math>
 +
if and only if the sum of its digits is divisible by
 +
<math>\text{3}</math>. E.g. the number
 +
<math>\text{97818}</math>
 +
is divisible by
 +
<math>\text{3}</math>
 +
because the sum of its digits,
 +
<math>\text{9}+\text{7}+\text{8}+\text{1}+\text{8}=\text{33}</math>, is divisible by
 +
<math>\text{3}</math>
 +
and, conversely, the number
 +
<math>\text{11536 }</math>
 +
is not divisible by
 +
<math>\text{3}</math>
 +
since sum of its digits,
 +
<math>\text{1}+\text{1}+\text{5}+\text{3}+\text{6}=\text{16}</math> , is not divisible by
 +
<math>\text{3}</math>.

Version vom 10:23, 23. Sep. 2008

If we divide up \displaystyle \text{153 } and \displaystyle \text{68 } into their smallest possible integer factors, we can see whether there are squared numbers which can be taken out from under the roots, and if the expression can be simplified further,


\displaystyle \begin{align} & \text{153 }=3\centerdot 51=3\centerdot 3\centerdot 17=3^{2}\centerdot 17, \\ & 68=2\centerdot 37=2\centerdot 2\centerdot 17=2^{2}\centerdot 17 \\ \end{align}


We get


\displaystyle \begin{align} & \sqrt{\text{153}}\text{-}\sqrt{68}\text{ }=\sqrt{3^{2}\centerdot 17}-\sqrt{2^{2}\centerdot 17} \\ & =3\sqrt{17}-2\sqrt{17}=\sqrt{17} \\ \end{align}


NOTE: A good tip for when we investigate whether an integer is divisible by \displaystyle \text{3} is to look at the sum of the number's digits. A number is divisible by \displaystyle \text{3} if and only if the sum of its digits is divisible by \displaystyle \text{3}. E.g. the number \displaystyle \text{97818} is divisible by \displaystyle \text{3} because the sum of its digits, \displaystyle \text{9}+\text{7}+\text{8}+\text{1}+\text{8}=\text{33}, is divisible by \displaystyle \text{3} and, conversely, the number \displaystyle \text{11536 } is not divisible by \displaystyle \text{3} since sum of its digits, \displaystyle \text{1}+\text{1}+\text{5}+\text{3}+\text{6}=\text{16} , is not divisible by \displaystyle \text{3}.

Von „http://wiki.sommarmatte.se/wikis/2009/bridgecourse1-TU-Berlin/index.php/L%C3%B6sung_3.1:7c“