
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
August 28th, 2018, 06:14 PM  #1 
Member Joined: Jul 2010 Posts: 83 Thanks: 2  A new definition for a superset of Carmichael numbers
We define a socalled Extended Korselt Pseudoprime in the following way: A composite number N is an Extended Korselt Pseudoprime iff for all prime divisors F of (N1) the congruence F^(N1) = 1 mod N holds true. Incidentally the theorem does have at least one practical application: the Lucas Primality test. Owing to the fact that the Lucas method already requires all of the factors of (N1) to be known a priori we can therefore apply the above criterion to efficiently exclude all but the most "resilient" pseudoprimes before moving on to the classical Lucas primality test. ... Last edited by Sebastian Garth; August 28th, 2018 at 06:51 PM. Reason: simplified 
August 29th, 2018, 04:18 PM  #2  
Senior Member Joined: Aug 2012 Posts: 2,136 Thanks: 622  Quote:
Today I learned.  
August 29th, 2018, 05:27 PM  #3 
Member Joined: Jul 2010 Posts: 83 Thanks: 2  Very funny, smart ass. Anyway I think I was a little rash in posting this (I'm getting old and just tend to think out loud these days). In retrospect I can't see any real justification for associating this with Korselt's theorem per se. Still pretty useful as a precursor to the Lucas primality test though. 

Tags 
carmichael, definition, numbers, superset 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
find cardinality of superset from its subsets with 6  chris7789  Number Theory  0  January 27th, 2017 08:19 PM 
Carmichael numbers solved by Chinese amateur  mobel  Number Theory  29  July 29th, 2016 12:27 PM 
What is the strict definition of the prime numbers problem?  georgi  Math  0  November 2nd, 2014 11:12 AM 
carmichael function  mared  Algebra  1  April 10th, 2014 03:30 PM 
definition  outsos  Applied Math  14  October 24th, 2012 11:26 PM 