<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: order of magnitute(big Oh)</title>
	<atom:link href="http://www.aboutlogic.info/order-of-magnitutebig-oh/feed" rel="self" type="application/rss+xml" />
	<link>http://www.aboutlogic.info/order-of-magnitutebig-oh</link>
	<description>logic, math, philosophy, math games, math help, mathematical logic, philosophy of education, math facts</description>
	<lastBuildDate>Fri, 03 Feb 2012 10:40:13 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: admin</title>
		<link>http://www.aboutlogic.info/order-of-magnitutebig-oh/comment-page-1#comment-7449</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Thu, 29 Jul 2010 11:03:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.aboutlogic.info/order-of-magnitutebig-oh#comment-7449</guid>
		<description>
  &#160; &#160; &#160; &#160;Hello, my main problem is &#160;much difficult. I am stuck with it. &lt;br /&gt; Let &#160; C and A be n*n matrices which have the below pattern. &lt;br /&gt; &lt;p&gt;&#160; &#160; &#160;&#124; &#160; 1 &#160; &#160; &#160; 0 &#160; &#160; 0 &#160; 0 &#160;. .. &#124; &#160; &#160; &#160; &#160; &#160;&#124; &#160; &#160;b &#160;1 &#160; 1 &#160; 1 .. &#124; &lt;br /&gt; &#160;C=&#124; &#160; a &#160; &#160; &#160; 1 &#160; &#160; 0 &#160; 0 &#160; ...&#124; &#160;, &#160;A=&#124; &#160; &#160; 1 &#160;b &#160; 1 &#160;1 &#160; ..&#124; &lt;br /&gt; &#160; &#160; &#160;&#124; &#160; a^2 &#160; &#160;a &#160; &#160; 1 &#160; 0 &#160; ...&#124; &#160; &#160; &#160; &#160; &#160;&#124; &#160; &#160; 1 &#160;1 &#160; b &#160;1 &#160;... &#124; &lt;br /&gt; &#160; &#160; &#160;&#124; &#160; a^3 &#160; &#160;a^2 &#160;a &#160; 1 &#160; ...&#124; &#160; &#160; &#160; &#160; &#160;&#124; &#160; &#160;1 &#160;1 &#160; 1 &#160;b &#160; .. &#124; &lt;br /&gt; &#160; &#160; &#160; &#160; .. &#160; &#160; &#160; &#160;.. &#160; &#160;.. &#160; ... . .. &#160; &#160; &#160; &#160; &#160; &#160; &#160; .. ... &#160;... &#160;... &lt;br /&gt; &lt;/p&gt;&lt;p&gt;&#160; &#160; &#160; &#160; &#160; &#160;Let define as M=C&#039;ACC&#039;AC. &lt;br /&gt; &#160; &#160; &#160; &#160; &#160;My problem is to find the asymptotic behaviour of &lt;br /&gt; &#160; &#160; &#160; &#160; &#160;trace(M) which is eqaul to sum((i=1 to n)(j=1 to n)(Mij^2)) &lt;br /&gt; as n increases. I tested this in matlab.It is O(n^2). But I can&#039;t &lt;br /&gt; derive it anatically. It seemed to me very complicated. Can someone &lt;br /&gt; help please? Thanks. &lt;br /&gt;
  
  &lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>&nbsp; &nbsp; &nbsp; &nbsp;Hello, my main problem is &nbsp;much difficult. I am stuck with it. <br /> Let &nbsp; C and A be n*n matrices which have the below pattern. <br /> 
<p>&nbsp; &nbsp; &nbsp;| &nbsp; 1 &nbsp; &nbsp; &nbsp; 0 &nbsp; &nbsp; 0 &nbsp; 0 &nbsp;. .. | &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;| &nbsp; &nbsp;b &nbsp;1 &nbsp; 1 &nbsp; 1 .. | <br /> &nbsp;C=| &nbsp; a &nbsp; &nbsp; &nbsp; 1 &nbsp; &nbsp; 0 &nbsp; 0 &nbsp; &#8230;| &nbsp;, &nbsp;A=| &nbsp; &nbsp; 1 &nbsp;b &nbsp; 1 &nbsp;1 &nbsp; ..| <br /> &nbsp; &nbsp; &nbsp;| &nbsp; a^2 &nbsp; &nbsp;a &nbsp; &nbsp; 1 &nbsp; 0 &nbsp; &#8230;| &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;| &nbsp; &nbsp; 1 &nbsp;1 &nbsp; b &nbsp;1 &nbsp;&#8230; | <br /> &nbsp; &nbsp; &nbsp;| &nbsp; a^3 &nbsp; &nbsp;a^2 &nbsp;a &nbsp; 1 &nbsp; &#8230;| &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;| &nbsp; &nbsp;1 &nbsp;1 &nbsp; 1 &nbsp;b &nbsp; .. | <br /> &nbsp; &nbsp; &nbsp; &nbsp; .. &nbsp; &nbsp; &nbsp; &nbsp;.. &nbsp; &nbsp;.. &nbsp; &#8230; . .. &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; .. &#8230; &nbsp;&#8230; &nbsp;&#8230;  </p>
<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;Let define as M=C&#8217;ACC&#8217;AC. <br /> &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;My problem is to find the asymptotic behaviour of <br /> &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;trace(M) which is eqaul to sum((i=1 to n)(j=1 to n)(Mij^2)) <br /> as n increases. I tested this in matlab.It is O(n^2). But I can&#8217;t <br /> derive it anatically. It seemed to me very complicated. Can someone <br /> help please? Thanks. </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://www.aboutlogic.info/order-of-magnitutebig-oh/comment-page-1#comment-7447</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Thu, 29 Jul 2010 11:03:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.aboutlogic.info/order-of-magnitutebig-oh#comment-7447</guid>
		<description>
  sorry, I made a mistake. It is from n to 2n. thanks &lt;br /&gt;
  
  </description>
		<content:encoded><![CDATA[<p>sorry, I made a mistake. It is from n to 2n. thanks </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://www.aboutlogic.info/order-of-magnitutebig-oh/comment-page-1#comment-7448</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Thu, 29 Jul 2010 11:03:05 +0000</pubDate>
		<guid isPermaLink="false">http://www.aboutlogic.info/order-of-magnitutebig-oh#comment-7448</guid>
		<description>
  &lt;p&gt;On Sat, 17 Dec 2005, oercim wrote: &lt;br /&gt; &gt; sorry, I made a mistake. It is from n to 2n. thanks &lt;br /&gt; &lt;br /&gt;I&#039;ve not the time nor the inclination for the clerical chore of back &lt;br /&gt; tracking the thread to reconstruct the line of thought. &#160;If you want &lt;br /&gt; intelligent and well thought answers, instead of sloppy inaccurate &lt;br /&gt; answers from what I remember, then include the context pertinent to your &lt;br /&gt; reply and to whom your are talking. &lt;br /&gt; &lt;/p&gt;&lt;p&gt;Please learn and use better math group manners as demonstrated &lt;br /&gt; by other participants of this newsgroup and as described at &lt;br /&gt; &#160; &#160; &#160; &#160; http://oakroadsystems.com/genl/unice.htm#quote &lt;br /&gt; &lt;/p&gt;&lt;p&gt;If you&#039;re posting from Mathforum or Google, it is requested you use &lt;br /&gt; the quote feature. &#160;Many of us use different news browsers than you. &lt;br /&gt;
  
  &lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>On Sat, 17 Dec 2005, oercim wrote: <br /> &gt; sorry, I made a mistake. It is from n to 2n. thanks </p>
<p>I&#8217;ve not the time nor the inclination for the clerical chore of back <br /> tracking the thread to reconstruct the line of thought. &nbsp;If you want <br /> intelligent and well thought answers, instead of sloppy inaccurate <br /> answers from what I remember, then include the context pertinent to your <br /> reply and to whom your are talking.  </p>
<p>Please learn and use better math group manners as demonstrated <br /> by other participants of this newsgroup and as described at <br /> &nbsp; &nbsp; &nbsp; &nbsp; <a href="http://oakroadsystems.com/genl/unice.htm#quote" rel="nofollow">http://oakroadsystems.com/genl/unice.htm#quote</a>  </p>
<p>If you&#8217;re posting from Mathforum or Google, it is requested you use <br /> the quote feature. &nbsp;Many of us use different news browsers than you. </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://www.aboutlogic.info/order-of-magnitutebig-oh/comment-page-1#comment-7446</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Thu, 29 Jul 2010 11:03:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.aboutlogic.info/order-of-magnitutebig-oh#comment-7446</guid>
		<description>
  &lt;p&gt;On Sat, 17 Dec 2005, oercim wrote: &lt;br /&gt; &gt; What is the order of magnitute(big Oh) of the below expression, &lt;br /&gt; &lt;/p&gt;&lt;p&gt;&gt; &#160; &#160; &#160; &#160;sum(a^i* (n^2-i^2)), &#160;i=n, n+1, .....,n &#160; for &#124;a&#124;&lt;1 &lt;br /&gt; &lt;/p&gt;&lt;p&gt;&gt; &#160; &#160; &#160; here sum refers the sigma notation. Thanks alot. &lt;br /&gt; &lt;br /&gt;As the sum is on i and it goes from n to ... n, there is but &lt;br /&gt; one term in the sum, namely when i = n. &#160;Thus &lt;br /&gt; &#160; &#160; &#160; &#160; sum(...) = a^n (n^2 - n^2) = 0 &lt;br /&gt; &lt;/p&gt;&lt;p&gt;-- To Google and MathForum users: &lt;br /&gt; Reply only if adequate context is included _within_ the reply. &lt;br /&gt; &#160; &#160; &#160; &#160; Otherwise all contexts are removed from my view, &lt;br /&gt; &#160; &#160; &#160; &#160; the flow of thought disrupted and chaos reigns. &lt;br /&gt; &lt;/p&gt;&lt;p&gt;In particular for Google users: &lt;br /&gt; &lt;/p&gt;&lt;p&gt;Instead of simply hitting the prominent &quot;Reply&quot; link, which doesn&#039;t &lt;br /&gt; include a copy of the post to which one is replying, click the &quot;Show &lt;br /&gt; Options&quot; link (toward the top of an item in the thread), which causes &lt;br /&gt; a shaded area of links to appear next to the top of the item, including &lt;br /&gt; &quot;Reply&quot; (first) that does introduce a copy of the previous text (offset &lt;br /&gt; by &gt; signs in the usual fashion). &lt;br /&gt; &lt;/p&gt;&lt;p&gt;---- &lt;br /&gt;
  
  &lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>On Sat, 17 Dec 2005, oercim wrote: <br /> &gt; What is the order of magnitute(big Oh) of the below expression,  </p>
<p>&gt; &nbsp; &nbsp; &nbsp; &nbsp;sum(a^i* (n^2-i^2)), &nbsp;i=n, n+1, &#8230;..,n &nbsp; for |a|&lt;1  </p>
<p>&gt; &nbsp; &nbsp; &nbsp; here sum refers the sigma notation. Thanks alot. </p>
<p>As the sum is on i and it goes from n to &#8230; n, there is but <br /> one term in the sum, namely when i = n. &nbsp;Thus <br /> &nbsp; &nbsp; &nbsp; &nbsp; sum(&#8230;) = a^n (n^2 &#8211; n^2) = 0  </p>
<p>&#8211; To Google and MathForum users: <br /> Reply only if adequate context is included _within_ the reply. <br /> &nbsp; &nbsp; &nbsp; &nbsp; Otherwise all contexts are removed from my view, <br /> &nbsp; &nbsp; &nbsp; &nbsp; the flow of thought disrupted and chaos reigns.  </p>
<p>In particular for Google users:  </p>
<p>Instead of simply hitting the prominent &quot;Reply&quot; link, which doesn&#8217;t <br /> include a copy of the post to which one is replying, click the &quot;Show <br /> Options&quot; link (toward the top of an item in the thread), which causes <br /> a shaded area of links to appear next to the top of the item, including <br /> &quot;Reply&quot; (first) that does introduce a copy of the previous text (offset <br /> by &gt; signs in the usual fashion).  </p>
<p>&#8212;- </p>
]]></content:encoded>
	</item>
</channel>
</rss>

