|
2020-02-02, 04:34
|
#1 |
May 2004
22×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. |
|
|
|
2020-02-02, 05:54
|
#2 |
Aug 2006
22×3×499 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". |
|
|
|
|
2020-02-02, 06:12
|
#3 |
|
Aug 2006
22×3×499 Posts |
It's not particularly hard to find these; e.g., 478482994075098699894289 is the 10,000-th 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 | 2019-09-21 05:40 |
| Carmichael numbers and Šimerka numbers | devarajkandadai | Number Theory Discussion Group | 14 | 2018-12-02 09:27 |
| Devaraj numbers which act like Carmichael numbers | devarajkandadai | Number Theory Discussion Group | 1 | 2018-07-30 03:44 |
| Good Carmichael Number construction algorithm? | carpetpool | Miscellaneous Math | 3 | 2018-03-04 13:51 |
| Carmichael numbers and Devaraj numbers | devarajkandadai | Number Theory Discussion Group | 0 | 2017-07-09 05:07 |
