Timeline for A permutation and combination problem about the number of connections in a sequence of n numbers [closed]
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 4, 2023 at 3:48 | comment | added | Math_deep | I wonder if it has anything to do with the connection paths in graph theory? | |
| Aug 3, 2023 at 13:07 | comment | added | Gerry Myerson | I say, WHAT DOES IT HAVE TO DO WITH GRAPH THEORY? | |
| Aug 3, 2023 at 9:31 | history | closed |
user44191 Peter Taylor Daniele Tampieri Dag Oskar Madsen Dave Benson |
Not suitable for this site | |
| Aug 3, 2023 at 7:22 | answer | added | ho boon suan | timeline score: 1 | |
| Aug 3, 2023 at 6:38 | comment | added | Math_deep | Thank you for the answer. But how to prove the number of combinations is the every other Fibonacci number or other special number? And whether a formula about the number of combinations can be given ? | |
| Aug 3, 2023 at 5:57 | history | edited | Gerry Myerson |
edited tags
|
|
| Aug 3, 2023 at 5:56 | comment | added | Gerry Myerson | Assuming that "connections" like $(1,1)$ are not allowed, for $n=2,3,4,5$ I get $2,5,13,34$, which is every other Fibonacci number, oeis.org/A001519 (but OEIS has several other sequences that start with those four terms). What does it have to do with graph theory, please? | |
| Aug 3, 2023 at 5:50 | comment | added | Math_deep | I have tried for a long time, but I failed. | |
| Aug 3, 2023 at 5:16 | review | Close votes | |||
| Aug 3, 2023 at 9:41 | |||||
| Aug 3, 2023 at 5:15 | comment | added | მამუკა ჯიბლაძე | Show your work, as they say | |
| Aug 3, 2023 at 4:54 | history | edited | Math_deep | CC BY-SA 4.0 |
added 10 characters in body
|
| S Aug 3, 2023 at 4:53 | review | First questions | |||
| Aug 3, 2023 at 5:33 | |||||
| S Aug 3, 2023 at 4:53 | history | asked | Math_deep | CC BY-SA 4.0 |