|
Search: id:A104017
|
|
|
| A104017 |
|
Devaraj numbers which are not Carmichael numbers. |
|
+0
4
|
|
| 11305, 39865, 96985, 401401, 464185, 786961, 1106785, 1296505, 1719601, 1993537, 2242513, 2615977, 2649361, 2722681, 3165961, 3181465, 3755521, 4168801, 4229601, 4483297, 4698001, 5034601, 5381265, 5910121, 5977153, 7177105
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Counterexamples to sufficiency of the original Devaraj's 2nd Conjecture. Devaraj numbers are given by A104016.
It is sufficient to scan only odd numbers (cf. A104016), which makes the computation of the list twice as fast. [From M. F. Hasler (MHasler(AT)univ-ag.fr), Apr 03 2009]
|
|
LINKS
|
A. K. Devaraj, Devaraj's 2nd Conjecture
|
|
PROGRAM
|
(PARI) { DNC() = for(n=2, 10^8, f=factorint(n); if(vecmax(f[, 2])>1, next); f=f[, 1]; r=length(f); if(r==1, next); Carmichael=1; d=f[1]-1; p=1; for(i=1, r, d=gcd(d, f[i]-1); p*=f[i]-1; if((n-1)%(f[i]-1), Carmichael=0)); if( ((n-1)^(r-2)*d^2)%p==0 && !Carmichael, print1(" ", n)) ) }
(PARI) forstep( n=3, 10^7, 2, vecmax((f=factor(n))[, 2])>1 & next; #(f*=[1, -1]~)>1 | next; gcd(f)^2*(n-1)^(#f-2) % prod(i=1, #f, f[i]) & next; for( i=1, #f, (n-1)%f[i] & !print1(n", ") & break)) \\ [From M. F. Hasler (MHasler(AT)univ-ag.fr), Apr 03 2009]
|
|
CROSSREFS
|
Cf. A104016, A002997.
Adjacent sequences: A104014 A104015 A104016 this_sequence A104018 A104019 A104020
Sequence in context: A051346 A110375 A112441 this_sequence A067791 A067779 A082440
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Max Alekseyev (maxale(AT)gmail.com), Feb 25 2005
|
|
|
Search completed in 0.002 seconds
|
