From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,e3ba37c5a979fdcb
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!postnews.google.com!g47g2000cwa.googlegroups.com!not-for-mail
From: "isaac2004" <isaac_2004@yahoo.com>
Newsgroups: comp.lang.ada
Subject: Re: Ada.Text_IO.Create
Date: 21 Feb 2006 14:15:59 -0800
Organization: http://groups.google.com
Message-ID: <1140560159.318265.105160@g47g2000cwa.googlegroups.com>
References: <igGJf.45328$d5.201713@newsb.telia.net>
   <1140297548.116832.212770@g43g2000cwa.googlegroups.com>
   <57OJf.45346$d5.201767@newsb.telia.net>
   <dt8aup$36b$1@nwrdmz01.dmz.ncs.ea.ibs-infra.bt.com>
   <HMOJf.45349$d5.201704@newsb.telia.net>
   <dt99e1$36b$2@nwrdmz01.dmz.ncs.ea.ibs-infra.bt.com>
   <fV3Kf.1931$VI6.308@newsread1.news.pas.earthlink.net>
   <GiF0Di0uFg5M@eisner.encompasserve.org>
   <1140415791.303850.38080@z14g2000cwz.googlegroups.com>
   <3stiv1l39144oscbs5he2v6h5uvfmli03q@4ax.com>
NNTP-Posting-Host: 67.170.5.168
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1140560177 16114 127.0.0.1 (21 Feb 2006 22:16:17
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Tue, 21 Feb 2006 22:16:17 +0000 (UTC)
In-Reply-To: <3stiv1l39144oscbs5he2v6h5uvfmli03q@4ax.com>
User-Agent: G2/0.2
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; SV1;
 .NET CLR 1.1.4322; .NET CLR 2.0.50727),gzip(gfe),gzip(gfe)
Complaints-To: groups-abuse@google.com
Injection-Info: g47g2000cwa.googlegroups.com; posting-host=67.170.5.168;
   posting-account=bWy1LAwAAAAtVkasDCH0ykMCBMNd-FcL
Xref: g2news1.google.com comp.lang.ada:3049
Date: 2006-02-21T14:15:59-08:00
List-Id: <comp.lang.ada>

alright everybody who helped me thank you because i am near completion

i only have one more question. when i run my code for a length of 30 it
hits a range error, any help on how on fix it

with Ada.Text_Io;
use Ada.Text_Io;
with Ada.Integer_Text_Io;
use Ada.Integer_Text_Io;
procedure Assignment3 is

---------------------------------------------------------------------
   --| program that takes a range in the form of a minimum and maximum
number,
   --| and prompts for the length, to find all sociable chains inside
of the range
   --| to that desired chain
   --| Isaac Levin, Western Washington
   --| February 2006

---------------------------------------------------------------------------

   Start  : Natural;
   Stop   : Natural;
   Max    : Natural range 1 .. 30;
   Chains : File_Type;


function Sum_Of_Divisors (
         N : Integer)
     return Integer is
       C: Integer;
      Sum : Integer;

   begin
      Sum := 1;
      C:=2;
      while C**2 <= N loop --Number

         if N mod C = 0 then
            if C * 2 = N then
               Sum := Sum + C;
            else
               Sum := Sum + C + N / C;
            end if;
         end if;
         C := C + 1 ;
      end loop;
      return Sum ;

   end Sum_Of_Divisors;



   procedure Sociable_Chain (
         Start,
         Max   : Natural) is
      A : array (1 .. 30) of Natural;
      I : Natural                    := 2;

   begin
      A(1) :=Start; -- makes first number of array the prompt number
      A(2) := Sum_Of_Divisors (A(1));
      -- 2nd number in array is sum of divisors of prompt
      while I < Max and A (1) /= A(I) loop
         -- loop till length is reached and till A(I) = A(1)
         I:= I + 1;
         A(I) := Sum_Of_Divisors (A(I - 1));
      end loop;
      if A(1) = A(I) then
         for Index in 1 .. I loop
            Put(
               File  => Chains,
               Item  => A (Index),
               Width => 0);
            New_Line (File => Chains) ;
            Put(
               Item  => A (Index),
               Width => 0);
            New_Line ;
         end loop;
         New_Line (File => Chains) ;
         New_Line ;
      end if ;
   end Sociable_Chain;

begin


   Put(Item => "Please enter your starting integer.");
   Get(Item => Start);
   New_Line;
   Put(Item => " Please enter your ending integer.");
   Get(Item => Stop);
   New_Line;
   Put(Item => " Please enter the length of largest chain. ");
   Get(Item => Max);




   Create(
      File => Chains,
      Mode => Out_File,
      Name => "chains.txt");

   for N in Start .. Stop loop
      Sociable_Chain ( N, Max) ;
   end loop;

   Close (File => Chains) ;

end Assignment3 ; 
   

thank you