-
Notifications
You must be signed in to change notification settings - Fork 130
Erdős Problem 503 #659
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Erdős Problem 503 #659
Conversation
mo271
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice, especially doing all of the statements on the page.
I left a few initial comments, but looks good in general..
| theorem erdos_503 {n : ℕ} : ∃ A : Set (ESpace n), isoscelesSet A ∧ (∀ B : Set (ESpace n), | ||
| isoscelesSet B → B.ncard ≤ A.ncard) ∧ A.ncard = answer(sorry) := by |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
one could use IsGreatest here
also below.
But perhaps even better define the largest such that separately using iSup or sSup then we can use it all over the place?
|
Apologies for the delay! I wasn't sure how to best define "largest such that", so I decided to use |
callesonne
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for the contribution! Here are some comments :)
callesonne
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This is ready to go after my final comment has been adressed, thanks a lot!
Fixed now, and no prob 🙂 |
Adds Erdős Problem 503.