Lösung 3.1:7c

Aus Online Mathematik Brückenkurs 1

(Unterschied zwischen Versionen)
Wechseln zu: Navigation, Suche
K
Zeile 1: Zeile 1:
-
If we divide up
+
If we divide up 153 and 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,
-
<math>\text{153 }</math>
+
-
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>
+
 +
{{Displayed math||<math>\begin{align}
 +
153 &= 3\cdot 51 = 3\cdot 3\cdot 17 = 3^{2}\cdot 17,\\[5pt]
 +
68 &= 2\cdot 37 = 2\cdot 2\cdot 17 = 2^{2}\cdot 17\,\textrm{.}
 +
\end{align}</math>}}
We get
We get
-
 
+
{{Displayed math||<math>\begin{align}
-
<math>\begin{align}
+
\sqrt{153}-\sqrt{68}
-
& \sqrt{\text{153}}\text{-}\sqrt{68}\text{ }=\sqrt{3^{2}\centerdot 17}-\sqrt{2^{2}\centerdot 17} \\
+
&= \sqrt{3^{2}\cdot 17}-\sqrt{2^{2}\cdot 17}\\[5pt]
-
& =3\sqrt{17}-2\sqrt{17}=\sqrt{17} \\
+
&= 3\sqrt{17}-2\sqrt{17}\\[5pt]
-
\end{align}</math>
+
&= \sqrt{17}\,\textrm{.}
 +
\end{align}</math>}}
-
NOTE: A good tip for when we investigate whether an integer is divisible by
+
Note: A good tip for when we investigate whether an integer is divisible by 3 is to look at the sum of the number's digits. A number is divisible by 3 if and only if the sum of its digits is divisible by 3. E.g. the number 97818 is divisible by 3 because the sum of its digits, <math>9+7+8+1+8=33</math>, is divisible by 3 and, conversely, the number 11536 is not divisible by 3 since sum of its digits,
-
<math>\text{3}</math>
+
<math>1+1+5+3+6=16</math>, is not divisible by 3.
-
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 14:22, 30. Sep. 2008

If we divide up 153 and 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,

Vorlage:Displayed math

We get

Vorlage:Displayed math


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

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