<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Module 2: Systems of equations and inequalities by Lucas Birkenstock</title>
      <link>https://padlet.com/birkenstockl1500/p8jagm0bxpyc</link>
      <description>by Lucas Birkenstock</description>
      <language>en-us</language>
      <pubDate>2016-10-04 18:45:56 UTC</pubDate>
      <lastBuildDate>2024-06-01 12:37:39 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>New Vocabulary Words</title>
         <author>birkenstockl1500</author>
         <link>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128304130</link>
         <description><![CDATA[<div><strong>Feasible Region</strong>- An area defined by a set of coordinates that satisfy a system of inequalities.<br><strong>Reduced Row Form</strong>- Also called reduced row echelon form.&nbsp; It is a matrix where 1´s are in a diagonal line, and all other numbers that are not 1 must be 0. <strong><br>Max Profit</strong>- The maximum amount of money you could make from certain context.<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2016-10-04 18:50:43 UTC</pubDate>
         <guid>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128304130</guid>
      </item>
      <item>
         <title></title>
         <author>birkenstockl1500</author>
         <link>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128307865</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/aws/137208189/8447a7d5b5962883e990a1d4767a2748/2000px_Linear_Programming_Feasible_Region_svg.png" />
         <pubDate>2016-10-04 18:59:20 UTC</pubDate>
         <guid>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128307865</guid>
      </item>
      <item>
         <title>New Concepts</title>
         <author>birkenstockl1500</author>
         <link>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128309926</link>
         <description><![CDATA[<div><strong>Solving equations with matrices-</strong> Very hard concept. Convert the two or more equations into a matrix. Then solve the matrix so that there is a diagonal line of 1s going from the top left to bottom right, and all the other numbers are 0 on the left side of the equation. The numbers on the right side of the equation are your solution. You can add, subtract, multiply, and divide rows by each other to find the solution.<strong><br>Max profit- </strong>Graph two lines representing the cost and other variable. After this is done, find where the two lines intersect. This is the maximum profit<br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2016-10-04 19:05:42 UTC</pubDate>
         <guid>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128309926</guid>
      </item>
      <item>
         <title>Example Problem</title>
         <author>birkenstockl1500</author>
         <link>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128315011</link>
         <description><![CDATA[<div>[ 3 2 &nbsp; | -6]<br>[ 1 2 &nbsp; | 2 ]&nbsp;<br><br>Answer:&nbsp;<br>R1-R2-&gt;R1, R1/2-&gt;R1, R1+R2-&gt;R1, R1/2-&gt;R1,<br>R2-R1-&gt;R2, and finally R1-R2-&gt;R1<br>[1 0 |-4]<br>[0 1&nbsp; |3]</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-10-04 19:21:08 UTC</pubDate>
         <guid>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128315011</guid>
      </item>
      <item>
         <title>Helpful video</title>
         <author>birkenstockl1500</author>
         <link>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128661065</link>
         <description><![CDATA[<div>This video covers how to solve a system of equations using matrices. </div>]]></description>
         <enclosure url="https://www.youtube.com/watch?v=AUqeb9Z3y3k" />
         <pubDate>2016-10-05 23:45:01 UTC</pubDate>
         <guid>https://padlet.com/birkenstockl1500/p8jagm0bxpyc/wish/128661065</guid>
      </item>
   </channel>
</rss>
