Recursive sufficiency for the Collatz conjecture and computational verification
We define the notion of recursive sufficiency for the Collatz conjecture and we use it to present some results concerning the computational verification of the conjecture. For any integer N≥1 and any recursively sufficient set F, it is proved that all integers in the interval [1, N] satisfy the conj...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
"Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences
2025-08-01
|
| Edice: | Notes on Number Theory and Discrete Mathematics |
| Témata: | |
| On-line přístup: | https://nntdm.net/papers/nntdm-31/NNTDM-31-3-471-480.pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|