
Search found 4 matches
- Mon Jul 03, 2006 11:16 pm
- Forum: Volume 7 (700-799)
- Topic: 701 - The Archeologists' Dilemma
- Replies: 43
- Views: 35719
- Wed May 24, 2006 1:08 am
- Forum: Volume 2 (200-299)
- Topic: 202 - Repeating Decimals
- Replies: 82
- Views: 25643
- Sat May 20, 2006 4:17 am
- Forum: Volume 4 (400-499)
- Topic: 443 - Humble Numbers
- Replies: 82
- Views: 18125
You can't run such a loop. It will take more than a minute (probably).
Generate all the numbers whose prime factors are 2, 3, 5, 7 and insert them in a sorted list like we do in insertion sort. For example, 1 is a humble number. Now multiply it with 2, 3, 5 and 7 and the new list will be 1 2 3 5 7 ...
Generate all the numbers whose prime factors are 2, 3, 5, 7 and insert them in a sorted list like we do in insertion sort. For example, 1 is a humble number. Now multiply it with 2, 3, 5 and 7 and the new list will be 1 2 3 5 7 ...
- Sat May 20, 2006 4:09 am
- Forum: Volume 105 (10500-10599)
- Topic: 10544 - Numbering the Paths
- Replies: 14
- Views: 6385