...Huge Division


//----------------------------------


void ThousandFold(int xa[]){
int i=0, Top = xa[RRay];
if(Top==RRay){ printf("\nTF MAX!!\n"); return;}
for(i=Top;i>=0;i--){
    xa[i+1] = xa[i];
    //print()
    }
xa[0]=0;
xa[RRay]++;
}
   

//---------------------------------------------------

void TSDivide(int xa[], int xb[], int xc[]){
int mCount[102],
     VSub[102], VCount[102], TCount[102], OVC[102], OVM[102];

int GetRays=0, ThouLoop=0;

Set(VSub, xa);
Set(VCount, xb);
One(mCount);
Zero(TCount);

while(isLarger(VSub, VCount)>0){   
   
    /*printf("VS");
    Printout(VSub);
    printf("VC");
    Printout(VCount);
    Pause();
    */

    while(isLarger(VSub, VCount)>=0){
        Set(OVC, VCount);
        Set(OVM, mCount);
        ThousandFold(VCount);
        ThousandFold(mCount);
       
        /*//ThouLoop = isLarger(VSub, VCount);
        printf("MC");
        Printout(mCount);
        printf("VC");
        Printout(VCount);
        Pause();
        //GetRays++;
        */
        }
    Set(VCount, OVC);
    Set(mCount, OVM);
   
    //GetRays--;
   
    while(isLarger(VSub, VCount)>=0){
        Set(OVC, VCount);
        Set(OVM, mCount);
        Add(VCount, VCount, VCount);
        Add(mCount, mCount, mCount);

        /*printf("MC");
        Printout(mCount);
        printf("VC");
        Printout(VCount);
        Pause();
        */

        }
   
    /*printf("VS");
    Printout(VSub);
    printf("Minus OVC");
    Printout(OVC);


    printf("TC");
    Printout(TCount);
    printf("Plus OVM");
    Printout(OVM);
    Pause();
    */   

    Sub(VSub, OVC, VSub);
    Add(OVM, TCount, TCount);

    Set(VCount, xb);
    One(mCount);

    /*printf("VS");
    Printout(VSub);
    printf("TC");
    Printout(TCount);
    Pause();

    */
    }


if(isLarger(VSub, VCount)==0){   
    Add(aOne, TCount, TCount);
    Sub(VSub, VCount, VSub);
    }

printf("\n\nDivide ");
Printout(TCount);
printf("Remainder ");
Printout(VSub);

Set(xc, TCount);
}

//---------------------------------------------------

...Really, the main problem is that it's just too simple
Surely this can't have not been built already...

...Not that that makes it any better or worse, just -quite likely- previously discovered....

..Bit like the -Lotus- Hash alg i posted, I have no doubt NASA already has something similar[and Better].... But it's just not public.... thereby useless to most people...

While i'm on that, Should give a big shout-out to Bob Gunn, the ex-NASA man who enlightened me on the topic of Factorials, in the context of Cryptography... =)
I built Lotus myself, but none-the-less it would not have happened without him... and many others =D