20200202, 04:34  #1 
May 2004
2^{2}×79 Posts 
Algorithm for generating Carmichael numbers of type 1105
1) Let n be = = 1 (mod 3)
2)check whether n satisfying above is such that (4n+1), (12n+1) and (16n+1) are primes. If so N = (4n+1)(12n+1)(16n+1) is a Carmichael number of type 1105. 
20200202, 05:54  #2 
Aug 2006
3·1,987 Posts 
Perhaps it would be easier to say:
Check whether 12n + 5, 36n + 13, and 48n + 17 are prime for some nonnegative integer n. If so, their product is a Carmichael number "of type 1105". 
20200202, 06:12  #3 
Aug 2006
3·1,987 Posts 
It's not particularly hard to find these; e.g., 478482994075098699894289 is the 10,000th such Carmichael number.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Algorithm for combining Carmichael numbers  devarajkandadai  Number Theory Discussion Group  1  20190921 05:40 
Carmichael numbers and Šimerka numbers  devarajkandadai  Number Theory Discussion Group  14  20181202 09:27 
Devaraj numbers which act like Carmichael numbers  devarajkandadai  Number Theory Discussion Group  1  20180730 03:44 
Good Carmichael Number construction algorithm?  carpetpool  Miscellaneous Math  3  20180304 13:51 
Carmichael numbers and Devaraj numbers  devarajkandadai  Number Theory Discussion Group  0  20170709 05:07 