Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.01293 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914045029777408 |
|---|---|
| author | Voutier, Paul M |
| author_facet | Voutier, Paul M |
| contents | We investigate the number of squares in a very broad family of binary recurrence sequences with $u_{0}=1$. We show that there are at most two distinct squares in such sequences (the best possible result), except under such very special conditions where we prove there are at most three such squares. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_01293 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Bounds on the number of squares in recurrence sequences Voutier, Paul M Number Theory 11B37, 11B39, 11J82 We investigate the number of squares in a very broad family of binary recurrence sequences with $u_{0}=1$. We show that there are at most two distinct squares in such sequences (the best possible result), except under such very special conditions where we prove there are at most three such squares. |
| title | Bounds on the number of squares in recurrence sequences |
| topic | Number Theory 11B37, 11B39, 11J82 |
| url | https://arxiv.org/abs/2401.01293 |