## Search found 4 matches

Fri Sep 20, 2002 2:58 pm
Forum: Volume 100 (10000-10099)
Topic: 10005 - Packing polygons
Replies: 49
Views: 15343
1. Given two points the unique minimal radius circle intersecting these is the circle with center in the middle and half the distance as radius. 2. Given three points that are not colinear there is a unique circle that intersect these. 3. Given n>1 points it it possible to choose two or three point...
Wed Sep 18, 2002 8:13 am
Forum: Volume 100 (10000-10099)
Topic: 10006 - Carmichael Numbers
Replies: 66
Views: 20706
Thank you to help me to concentrate on other part. I finnaly found out the problems, it's when I send problem using Yahoo Mail, it cut down the long line which contain 'printf()', so the output format have been changed unknowingly.
Tue Sep 17, 2002 6:33 pm
Forum: Volume 100 (10000-10099)
Topic: 10001 - Garden of Eden
Replies: 39
Views: 15056
I think this problem should'n solved by exhausted search. My algorithm is to find all posible cases of first 3 digit of possible previous states and then use dynamic algorithm to check if with those 3 first digit can lead to a whole previous state or not.
Tue Sep 17, 2002 6:26 pm
Forum: Volume 100 (10000-10099)
Topic: 10006 - Carmichael Numbers
Replies: 66
Views: 20706
I've already found out 15 Carmichael numbers which are <65000

THey are :
561,
1105,
1729,
2465,
2821,
6601,
8911,
10585,
15841,
29341,
41041,
46657,
52633,
62745,
63973

But my program stil getl wrong answer. Can you check for me if above numbers are correct ?[/cpp]