Liste des Groupes | Revenir à s math |
On 2/20/2025 5:32 AM, WM wrote:Yes.On 20.02.2025 03:23, Richard Damon wrote:== Assume S ⊆ {F} exists such that>>
Assume a set of sufficient FISONs.
⋃S is the only.inductive.subset of ⋃S
|ℕ \ {1, 2, 3, ..., n}| = ℵoYes.
is true for all FISONs.
⎛ For any two FISONs {i:i≤j} and {i:i≤k},
⎜ their sum {i:i≤j+k} is a FISON.
The assumption is the existence of S.That contradicts the assumption.What is the assumption?
What is the contradiction?The contradiction is that induction proves every FISON useless and therefore S not existing.
Les messages affichés proviennent d'usenet.