int main()
{
int input;
int maxnumfactors = 0;
int trinum = 0;
int i, j;
int *primes;
primes = genprimes();
printf("\nPlease input a maximum: \n");
scanf("%d", &input);
// find triangle numbers and store number of divisors until input reached
for(i=1;maxnumfactors<input;i++){
int thisnumfactors;
trinum+=i;
thisnumfactors=findfactors(trinum,primes);
printf("%d %d\n",trinum,thisnumfactors);
if(thisnumfactors>maxnumfactors){
maxnumfactors=thisnumfactors;
}
}
printf("\nMax Factor %d Triangle Number %d\n", maxnumfactors, trinum);
return 0;
}
void
main (){
long double i;
printf("\n");
for (i = 2; i<200000 ; i++) {
long double tri = series (i, 1);
int res = findfactors(tri);
if (res >= 450 )
printf("i %0.0Lf tri %0.0Lf factors %d \n", i, tri, res);
}
}
