feat(Date/Choose): add some lemmas about choose of prime pow#38317
Open
WenrongZou wants to merge 1 commit intoleanprover-community:masterfrom
Open
feat(Date/Choose): add some lemmas about choose of prime pow#38317WenrongZou wants to merge 1 commit intoleanprover-community:masterfrom
WenrongZou wants to merge 1 commit intoleanprover-community:masterfrom
Conversation
PR summary 4f7183fb7fImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
In this PR, I add some lemma about choose of prime pow.
pand positive integern, assume that for alli ∈ Icc 1 (n - 1),choose n icongruent to0modulep, thenn = p ^ multiplicity p n.n, the greatest common divisor ofchoose n 1, ⋯, choose n (n - 1)is actually the minimal prime factor ofn.ngreater than1, assume thatnis not a prime power, then the greatest common divisor ofchoose n 1, ⋯, choose n (n - 1)is1.