<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>midterm review by Shelby Hamilton</title>
      <link>https://padlet.com/s3548/vkbb8jb3wwe9</link>
      <description>Made with a bold sensibility</description>
      <language>en-us</language>
      <pubDate>2018-03-13 12:51:36 UTC</pubDate>
      <lastBuildDate>2025-12-13 12:37:23 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Functions and Transformation</title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241333782</link>
         <description><![CDATA[<div>A transformation is a function that maps a set x to itself. <br>4 types of transformation are rotation, reflection, translation, and dilation. <br>1. f(x)=x (identity)<br>2. f(x)= x2 (Quadratic)<br>3. f(x)=x3 (cubic)<br>4. f(x)= lxl (absolute value) <br>5.f(x)= sqr of x (square root)<br>6. 3 sqr x (cude root)<br><br><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2018-03-13 12:55:41 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241333782</guid>
      </item>
      <item>
         <title>Linear Programming </title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241890700</link>
         <description><![CDATA[<div>The method of finding the minimum and maximum value of quantities, given constraints. <br>The maximum and minimum always occur at a vertex of the feasible region. <br>Feasible region is all of the points that satisfy all the constraint <br> </div>]]></description>
         <enclosure url="https://jeremykun.files.wordpress.com/2014/05/lp-visualization.png" />
         <pubDate>2018-03-14 14:14:29 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241890700</guid>
      </item>
      <item>
         <title>Solving System of Equations by Graphing </title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241907206</link>
         <description><![CDATA[<div>A system of linear equations contains 2 or more equations. The solution of a system is the ordered pair that is a solution to both equations. Solving a system of linear equations graphically you graph both equations in the same coordinate system. </div>]]></description>
         <enclosure url="https://image.slidesharecdn.com/swartzsolvingbygraphandsub-141023093224-conversion-gate01/95/solving-systems-by-graphing-and-substitution-5-638.jpg?cb=1414056786" />
         <pubDate>2018-03-14 14:37:51 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241907206</guid>
      </item>
      <item>
         <title>Complex Numbers</title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241910569</link>
         <description><![CDATA[<div>A number in the form of bi, where a and b are integers and i is the imaginary unit. <br>A- real part<br>I- Imaginary part</div>]]></description>
         <enclosure url="" />
         <pubDate>2018-03-14 14:43:07 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241910569</guid>
      </item>
      <item>
         <title>Solving Quadratic Formula by Factoring</title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241911467</link>
         <description><![CDATA[<div>The solution to a quadratic equation are called the x-int., zeros, or roots. <br>Steps for solving quadratic equation:<br>1. Multiply (a)(c)<br>2. Add what you get for (a)(c) to get b<br>3. Make box<br>4. Find GCF of each <br>5.Write GCF in parenthesis <br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2018-03-14 14:44:30 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241911467</guid>
      </item>
      <item>
         <title>Quadratic Formula</title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241914529</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padlet-uploads.storage.googleapis.com/271976681/a0f3d29b86c4ea47fb47ce6fb3d9931b/drawing.png" />
         <pubDate>2018-03-14 14:49:20 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241914529</guid>
      </item>
      <item>
         <title>Polynomials </title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241918709</link>
         <description><![CDATA[<div>Expression of 2 or more algebraic terms, more likely the sum of several terms that contain different powers of the same variables.  </div>]]></description>
         <enclosure url="https://usercontent1.hubstatic.com/6297702_f1024.jpg" />
         <pubDate>2018-03-14 14:55:23 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241918709</guid>
      </item>
      <item>
         <title>Operations of Polynomials in Function Notation</title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241919839</link>
         <description><![CDATA[<div>Adding (f+g)(x)=f(x)+g(x)<br>Subtracting(f-g)(x)= f(x)-g(x)<br>Multiply(fg)(x)= f(x)*g(x)<br>dividing(f/g)(x)=f(x)/g(x)<br>(fog)(x)= f(g(x))</div>]]></description>
         <enclosure url="" />
         <pubDate>2018-03-14 14:57:15 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241919839</guid>
      </item>
      <item>
         <title>Synthetic Division </title>
         <author>s3548</author>
         <link>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241922402</link>
         <description><![CDATA[<div>Synthetic Division is a shorthand method of polynomial division in the special case of dividing by a linear factor and it will only work in this case. </div>]]></description>
         <enclosure url="https://i.ytimg.com/vi/7mS5LmJffgw/maxresdefault.jpg" />
         <pubDate>2018-03-14 15:01:18 UTC</pubDate>
         <guid>https://padlet.com/s3548/vkbb8jb3wwe9/wish/241922402</guid>
      </item>
   </channel>
</rss>
