## Search found 5 matches

Tue Oct 05, 2004 3:06 pm
Forum: Volume 2 (200-299)
Topic: 254 - Towers of Hanoi
Replies: 39
Views: 16792
if n is 0, m has to be 0 since 2^0 -1 = 1 - 1 = 0

So if n is 0 the program should terminate.
Tue Oct 05, 2004 12:12 am
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 27664
I found the problem! Thanks allot!
Sun Oct 03, 2004 7:44 pm
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 27664

### 10139 Factovisors. WA, need more test data.

Could someone post more test data for this problem? This is the test data I have tested on so far: Input: 0 1 1 1 2 1 3 6 1233473 1233473 46337 2144430863 2144430862 2144430863 12 479001600 12 43545600 12 6220800 12 467775 12 248832 12 42525 12 1925 12 1215 12 1024 12 243 12 77 12 25 12 11 12 7 12 2...
Thu Sep 30, 2004 5:37 pm
Forum: Volume 2 (200-299)
Topic: 202 - Repeating Decimals
Replies: 82
Views: 11816
I found my problem...

Test this one:

Input:
260 606

Output:
260/606 = 0.(4290)
4 = number of digits in repeating cycle
Thu Sep 30, 2004 4:28 pm
Forum: Volume 2 (200-299)
Topic: 202 - Repeating Decimals
Replies: 82
Views: 11816
Input: 1 2971 1 251 1 613 Output: 1/2971 = 0.(00033658700774150117805452709525412319084483338943...) 2970 = number of digits in repeating cycle 1/251 = 0.(00398406374501992031872509960159362549800796812749) 50 = number of digits in repeating cycle 1/613 = 0.(00163132137030995106035889070146818923327...