Jump to content

Information for "Chernick's Carmichael numbers"

Basic information

Display titleChernick's Carmichael numbers
Default sort keyChernick's Carmichael numbers
Page length (in bytes)70,850
Namespace ID0
Page ID12385
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)
Page views in the past month0

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorTrizen (talk | contribs)
Date of page creation11:11, 1 June 2019
Latest editorZeddicus (talk | contribs)
Date of latest edit07:56, 15 September 2024
Total number of edits54
Recent number of edits (within past 180 days)7
Recent number of distinct authors2

Page properties

Hidden category (1)

This page is a member of a hidden category:

Transcluded templates (8)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
In 1939, Jack Chernick proved that, for n ≥ 3 and m ≥ 1: U(n, m) = (6m + 1) * (12m + 1) * Product_{i=1..n-2} (2^i * 9m + 1) is a Carmichael number if all the...
Information from Extension:WikiSEO
Cookies help us deliver our services. By using our services, you agree to our use of cookies.