<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
  <channel>
    <title>'Divide Set Algorithm to recive the vector (1,1,...,1)' Thread RSS Feed</title>
    <link>http://www.programmersheaven.com/</link>
    <description>Contains the latest posts from the thread 'Divide Set Algorithm to recive the vector (1,1,...,1)' posted on the 'Algorithms' forum at Programmer's Heaven.</description>
    <language>en</language>
    <copyright>Copyright 2013 Programmers Heaven</copyright>
    <pubDate>Wed, 19 Jun 2013 08:25:25 -0700</pubDate>
    <lastBuildDate>Wed, 19 Jun 2013 08:25:25 -0700</lastBuildDate>
    <generator>Argotic Syndication Framework 2007.3.0.1, http://www.codeplex.com/Argotic</generator>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <ttl>360</ttl>
    <image>
      <url>http://www.programmersheaven.com/images/ph.gif</url>
      <title>Programmers Heaven</title>
      <link>http://www.programmersheaven.com/</link>
      <width>88</width>
      <height>31</height>
    </image>
    <item>
      <title>Divide Set Algorithm to recive the vector (1,1,...,1)</title>
      <link>http://www.programmersheaven.com/mb/Algorithms/391122/391122/divide-set-algorithm-to-recive-the-vector-111/</link>
      <description>So I'm stuck at this question, the goal is to find a lower bound.&lt;br /&gt;
I have a set of natural numbers, each action is&lt;br /&gt;
choose a number&amp;gt;1 (refer as k) and divide the whole set (the vector (a1,a2,...,an) by this k then insted of the number's value enter this formula: i/k+i%k (Div+Mod)&lt;br /&gt;
&lt;br /&gt;
for example:&lt;br /&gt;
(13,5,8,40) for k=4 we get: (13/4+13%4,5/4+5%4,8/4+8%4,40/4+40%4)&lt;br /&gt;
(4,2,2,10) then repeat the action.&lt;br /&gt;
&lt;br /&gt;
-We know the higest number has value N&lt;br /&gt;
I need a lower bound of minimum action (If it helps i know the upper bound is 2*sqrt(N))&lt;br /&gt;
&lt;br /&gt;
It's really urgent!!!&lt;br /&gt;
Thanks in advance,&lt;br /&gt;
Rom.&lt;br /&gt;</description>
      <guid isPermaLink="true">http://www.programmersheaven.com/mb/Algorithms/391122/391122/divide-set-algorithm-to-recive-the-vector-111/</guid>
      <pubDate>Sun, 17 May 2009 23:27:03 -0700</pubDate>
      <category>Algorithms</category>
    </item>
    <item>
      <title>Re: Divide Set Algorithm to recive the vector (1,1,...,1)</title>
      <link>http://www.programmersheaven.com/mb/Algorithms/391122/391123/re-divide-set-algorithm-to-recive-the-vector-111/#391123</link>
      <description>The Bound Function need to be as a value  of N&lt;br /&gt;
&lt;br /&gt;</description>
      <guid isPermaLink="true">http://www.programmersheaven.com/mb/Algorithms/391122/391123/re-divide-set-algorithm-to-recive-the-vector-111/#391123</guid>
      <pubDate>Sun, 17 May 2009 23:31:56 -0700</pubDate>
      <category>Algorithms</category>
    </item>
  </channel>
</rss>