<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Addaboi</id>
	<title>Conservapedia - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.conservapedia.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Addaboi"/>
	<link rel="alternate" type="text/html" href="https://www.conservapedia.com/Special:Contributions/Addaboi"/>
	<updated>2026-10-10T03:48:57Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.14</generator>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Automorphism&amp;diff=881057</id>
		<title>Automorphism</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Automorphism&amp;diff=881057"/>
		<updated>2011-06-20T00:01:22Z</updated>

		<summary type="html">&lt;p&gt;Addaboi: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;An '''automorphism''' of a mathematical structure A is an [[Isomorphism|isomorphism]] from A to itself.{{citation needed}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Mathematics]]&lt;/div&gt;</summary>
		<author><name>Addaboi</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Isomorphism&amp;diff=881056</id>
		<title>Isomorphism</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Isomorphism&amp;diff=881056"/>
		<updated>2011-06-20T00:01:04Z</updated>

		<summary type="html">&lt;p&gt;Addaboi: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Given two [[Group (mathematics)|group]]s &amp;lt;math&amp;gt;G,G'&amp;lt;/math&amp;gt;, an '''isomorphism''' from &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt; to &amp;lt;math&amp;gt;G'&amp;lt;/math&amp;gt; is a [[function]] &amp;lt;math&amp;gt;\phi : G \to G'\,&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\phi&amp;lt;/math&amp;gt; is a [[homomorphism]] and &amp;lt;math&amp;gt;\phi&amp;lt;/math&amp;gt; is [[Bijection|bijective]].{{citation needed}}&amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;&lt;br /&gt;
Two groups &amp;lt;math&amp;gt;G,G'&amp;lt;/math&amp;gt; are called '''isomorphic''' if an isomorphism from &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt; to &amp;lt;math&amp;gt;G'&amp;lt;/math&amp;gt; exists.{{citation needed}}&lt;br /&gt;
&amp;lt;!--Apologies if the TeX and font size don't work well together.  I have Firefox set to use a specified font to avoid a weird bug, so I'm not sure how it'll look normally. - CSGuy --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See Also==&lt;br /&gt;
*[[Automorphism]]&lt;br /&gt;
[[Category:Algebra]]&lt;/div&gt;</summary>
		<author><name>Addaboi</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Group_(mathematics)&amp;diff=881055</id>
		<title>Group (mathematics)</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Group_(mathematics)&amp;diff=881055"/>
		<updated>2011-06-19T23:59:19Z</updated>

		<summary type="html">&lt;p&gt;Addaboi: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Math-h}}&lt;br /&gt;
A '''group''' is a mathematical structure consisting of a [[set]] of elements combined with a [[binary operator]] which satisfies four conditions:&lt;br /&gt;
&lt;br /&gt;
#'''Closure''': applying the binary operator to any two elements of the group produces a result which itself belongs to the group&lt;br /&gt;
#'''Associativity''': &amp;lt;math&amp;gt;(AB)C = A(BC)&amp;lt;/math&amp;gt; where &amp;lt;math&amp;gt;A&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;B&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;C&amp;lt;/math&amp;gt; are any element of the group&lt;br /&gt;
#'''Existence of Identity''': there must exist an identity element &amp;lt;math&amp;gt;I&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;IA = AI = A&amp;lt;/math&amp;gt;; that is, applying the binary operator to some element &amp;lt;math&amp;gt;A&amp;lt;/math&amp;gt; and the identity element &amp;lt;math&amp;gt;I&amp;lt;/math&amp;gt; leaves &amp;lt;math&amp;gt;A&amp;lt;/math&amp;gt; unchanged&lt;br /&gt;
#'''Existence of Inverse''': for each element &amp;lt;math&amp;gt;A&amp;lt;/math&amp;gt;, there must exist an inverse &amp;lt;math&amp;gt;A^{-1}&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;AA^{-1} = A^{-1}A = I&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A group with [[commutative]] binary operator is known as [[Abelian group|Abelian]].&lt;br /&gt;
&lt;br /&gt;
==Examples==&lt;br /&gt;
# the set of [[integers]] &amp;lt;math&amp;gt;\mathbb{Z}&amp;lt;/math&amp;gt; under addition, &amp;lt;math&amp;gt;(\mathbb{Z},+)&amp;lt;/math&amp;gt;:  here, zero is the identity, and the inverse of  an element &amp;lt;math&amp;gt;a \in \mathbb{Z}&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;-a&amp;lt;/math&amp;gt;. &lt;br /&gt;
# the set of the positive [[rational number]]s &amp;lt;math&amp;gt;\mathbb{Q}_+&amp;lt;/math&amp;gt; under multiplication, &amp;lt;math&amp;gt;(\mathbb{Q}_+,\cdot)&amp;lt;/math&amp;gt;: &amp;lt;math&amp;gt;1&amp;lt;/math&amp;gt; is the identity, while the inverse of an element &amp;lt;math&amp;gt;\frac{m}{n} \in \mathbb{Q}_+&amp;lt;/math&amp;gt; is &amp;lt;math&amp;gt;\frac{n}{m}&amp;lt;/math&amp;gt;. &lt;br /&gt;
# for every &amp;lt;math&amp;gt;n \in \mathbb{N}&amp;lt;/math&amp;gt; there exists at least one group with n elements,e.g., &amp;lt;math&amp;gt;(\mathbb{Z}/n\mathbb{Z},+) = (\mathbb{Z}_n,+). &amp;lt;/math&amp;gt;&lt;br /&gt;
# the set of complex numbers {1, -1, &amp;lt;i&amp;gt;i&amp;lt;/i&amp;gt;,&amp;lt;i&amp;gt;-i&amp;lt;/i&amp;gt;} under multiplication, where &amp;lt;i&amp;gt;i&amp;lt;/i&amp;gt; is the principal square root of -1, the basis of the [[imaginary number]]s. This group is [[isomorphism|isomorphic]] to &amp;lt;math&amp;gt; \mathbb{Z}_{4} &amp;lt;/math&amp;gt; under mod addition.&lt;br /&gt;
# the [[Klein four group]] consists of the set of formal symbols &amp;lt;math&amp;gt;\{1, i, j, k \} &amp;lt;/math&amp;gt;  with the relations &amp;lt;math&amp;gt; i^{2} =j^{2}=k^{2}=1, \; ij=k, \; jk=i, \; ki=j. &amp;lt;/math&amp;gt; All elements of the Klein four group (except the identity 1) have [[order]] 2. The Klein four group is [[isomorphism|isomorphic]] to &amp;lt;math&amp;gt;\mathbb{Z}_{2} \times \mathbb{Z}_{2}&amp;lt;/math&amp;gt; under mod addition.&lt;br /&gt;
# the set of &amp;quot;moves&amp;quot; on a Rubik's cube, where a move is understood to be a finite sequence of twists: here, the identity move is to do nothing, while the inverse of a move is to do the move in reverse, thereby undoing it.&lt;br /&gt;
# The [[Symmetric group]]&lt;br /&gt;
# The general and special [[Linear group]]s.&lt;br /&gt;
&lt;br /&gt;
Groups are the appropriate mathematical structures for any application involving [[symmetry]].&lt;br /&gt;
&lt;br /&gt;
[[Category:Algebra]]&lt;/div&gt;</summary>
		<author><name>Addaboi</name></author>
	</entry>
	<entry>
		<id>https://www.conservapedia.com/index.php?title=Algebra&amp;diff=881053</id>
		<title>Algebra</title>
		<link rel="alternate" type="text/html" href="https://www.conservapedia.com/index.php?title=Algebra&amp;diff=881053"/>
		<updated>2011-06-19T23:58:09Z</updated>

		<summary type="html">&lt;p&gt;Addaboi: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Math-e}}&lt;br /&gt;
'''Algebra''' is a major branch of [[mathematics]] that analyzes the relationships between quantities or items.  In higher math the principal fields of algebra are [[linear algebra]], which focuses on matrices, and [[group theory]].&amp;lt;ref&amp;gt;The name algebra comes from the [[Arabic]] word ''al jebr'', which means reduction or &amp;quot;reunion of broken parts&amp;quot; [http://dictionary.reference.com/browse/algebra Algebra] as mentioned in a book ''Hisab al-jabr w'al-muqabala'' translated as ''Science of the Reunion and the Opposition''.  This text was written in in about 830 AD by [[Muhammad ibn Mūsā al-Khwārizmī| Mohammad ibn-Musa al-Khwarizmi]] of [[Baghdad]].  See the [http://www.sjsu.edu/depts/Museum/alkhwa.html Biography of Al-Khwarizmi]&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Elementary Algebra==&lt;br /&gt;
&lt;br /&gt;
While algebra is a very wide-ranging and advanced topic in theoretical mathematics, the word also refers to a very important topic in middle-school and high-school mathematics.  This topic is the handling of arithmetical expressions and operations involving quantities that aren't known numbers, but are symbols like x, y, or z.  These symbols are generally referred to as &amp;quot;variables&amp;quot; or &amp;quot;unknowns&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
Whereas, in elementary arithmetic a typical question might be:&lt;br /&gt;
::What is the value of 3+4?&lt;br /&gt;
in elementary algebra a typical question might be:&lt;br /&gt;
::If x+4=7, what is the value of x?&lt;br /&gt;
&lt;br /&gt;
Of course this example is so simple as to be practically pointless&amp;amp;mdash;why would someone ask a question this way?&amp;amp;mdash;the use of algebra opens up sophisticated ways of solving sophisticated problems.&lt;br /&gt;
&lt;br /&gt;
Before continuing, let's see how we actually solved that.  We subtracted 4 from each side of the equation.  On the left side, subtracting 4 canceled the &amp;quot;+4&amp;quot;, so we got &amp;quot;x+4-4&amp;quot;, which is, of course, just x.  On the right side, we got 7-4, which is 3.  We used the principle that&lt;br /&gt;
::You can apply mathematical operations to something, even if it contains unknowns like &amp;quot;x&amp;quot;.&lt;br /&gt;
The goal was to get an equation that has just &amp;quot;x&amp;quot; on the left side, with some number on the right.  In the original problem, x was on the left side, but hidden with some other mathematical operations.  Our job was to strip off those operations, one at a time.  Here's a more complicated example:&lt;br /&gt;
::&amp;lt;math&amp;gt;\left(\frac{\sqrt{x+31}}{3} + 1\right) \times 6 = 18\,&amp;lt;/math&amp;gt;&lt;br /&gt;
We undo the multiplication, by dividing both sides by 6:&lt;br /&gt;
::&amp;lt;math&amp;gt;\frac{\sqrt{x+31}}{3} + 1 = 3\,&amp;lt;/math&amp;gt;&lt;br /&gt;
We undo the addition:&lt;br /&gt;
::&amp;lt;math&amp;gt;\frac{\sqrt{x+31}}{3} = 2\,&amp;lt;/math&amp;gt;&lt;br /&gt;
We undo the division:&lt;br /&gt;
::&amp;lt;math&amp;gt;\sqrt{x+31} = 6\,&amp;lt;/math&amp;gt;&lt;br /&gt;
We undo the square root:&lt;br /&gt;
::&amp;lt;math&amp;gt;x+31 = 36\,&amp;lt;/math&amp;gt;&lt;br /&gt;
We undo the addition:&lt;br /&gt;
::&amp;lt;math&amp;gt;x = 5\,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
As one gets more skillful at these kinds of manipulations, one can handle more complex problems.  A typical case involves an equation in which the unknown appears in more than one place.  After stripping away as many operations as we can, we might be left with something like:&lt;br /&gt;
::&amp;lt;math&amp;gt;3 \times x + 4 \times x = 56\,&amp;lt;/math&amp;gt;&lt;br /&gt;
At this point we use the ''distributive law'', along with the principle that&lt;br /&gt;
::The various laws of mathematics (commutative, associative, distributive) work even when the items appearing in the expressions are unknowns.&lt;br /&gt;
The distributive law tells us that&lt;br /&gt;
::&amp;lt;math&amp;gt;3 \times x + 4 \times x = (3+4) \times x\,&amp;lt;/math&amp;gt;&lt;br /&gt;
so we get&lt;br /&gt;
::&amp;lt;math&amp;gt;(3+4) \times x = 56\,&amp;lt;/math&amp;gt;&lt;br /&gt;
and hence x=8.  You can plug x=8 into &amp;lt;math&amp;gt;3 \times x + 4 \times x\,&amp;lt;/math&amp;gt; and see that the result is 24+32, or 56.&lt;br /&gt;
&lt;br /&gt;
==Polynomial Manipulations==&lt;br /&gt;
As one's proficiency increases, one can handle increasingly complicated equations.  The next step involves things like this:&lt;br /&gt;
::&amp;lt;math&amp;gt;\frac{x^2 - 8 x + 15}{x-3} = 7\,&amp;lt;/math&amp;gt;&lt;br /&gt;
This can be solved if one knows that&lt;br /&gt;
::&amp;lt;math&amp;gt;(x-3) \times (x-5) = x^2 - 8 x + 15\,&amp;lt;/math&amp;gt;&lt;br /&gt;
so&lt;br /&gt;
::&amp;lt;math&amp;gt;\frac{x^2 - 8 x + 15}{x-3} = x-5\,&amp;lt;/math&amp;gt;&lt;br /&gt;
from which one gets x=12.&lt;br /&gt;
&lt;br /&gt;
This was just a case of the principle that you can perform arithmetic operations even when the expression contain unknowns.  In this case we were actually applying the distributive law 3 times.&lt;br /&gt;
::&amp;lt;math&amp;gt;(x-3) \times (x-5) = (x) \times (x-5) + (-3) \times (x-5) = (x) \times (x) + (x) \times (-5) + (-3) \times (x) + (-3) \times (-5)\,&amp;lt;/math&amp;gt;&lt;br /&gt;
When we multiply the sum of two things times the sum of two things, we get the sum of four things.  This is an extremely common operation, and there is a mnemonic for it&amp;amp;mdash;&amp;quot;FOIL&amp;quot;&amp;amp;mdash;which stands for &amp;quot;first, outside, inside, last&amp;quot;.  We multiply the first item in each parenthesized expression; that's x times x.  We multiply the &amp;quot;outside&amp;quot; items; that's x times -5.  The &amp;quot;inside&amp;quot; items are -3 times x, and the &amp;quot;last&amp;quot; items are -3 times -5.&lt;br /&gt;
&lt;br /&gt;
This same principle applies when there are more than two items in each factor; it just doesn't have a useful mnemonic word.  Each term in the first factor (first parenthesized expression) get multiplied by each term in the second factor, and all the products are added up.&lt;br /&gt;
&lt;br /&gt;
==Notes and references==&lt;br /&gt;
&amp;lt;references/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
[[Category:Algebra]]&lt;br /&gt;
[[Category:Mathematics]]&lt;/div&gt;</summary>
		<author><name>Addaboi</name></author>
	</entry>
</feed>