Post History
Heavily based on this closed challenge from SE. Description A Sumac sequence starts with two non-zero integers $t_1$ and $t_2.$ The next term, $t_3 = t_1 - t_2$ More generally, $t_n = t_{n-2} ...
#4: Post edited
by
General Sebast1an
·
2021-08-11T12:07:50Z (about 3 years ago)
Length of a Sumac Sequence
- Heavily based on [this closed challenge from SE.](https://codegolf.stackexchange.com/q/148911/80214)
- # Description
- A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$
- The next term, \$t_3 = t_1 - t_2\$
- More generally, \$t_n = t_{n-2} - t_{n-1}\$
- The sequence ends when \$t_n ≤ 0\$. All values in the sequence must be positive.
- # Challenge
- Given two integers \$t_1\$ and \$t_2\$, compute the Sumac sequence, and output it's length.
- If there is a negative number in the input, remove everything after it, and compute the length.
- You may take the input in any way (Array, two numbers, etc.)
- # Test Cases
- (Sequence is included for clarification)
- ```
- [t1,t2] Sequence n
- ------------------------------
- [120,71] [120,71,49,22,27] 5
- [101,42] [101,42,59] 3
- [500,499] [500,499,1,498] 4
- [387,1] [387,1,386] 3
- [3,-128] [3] 1
- [-2,3] [] 0
- [3,2] [3,2,1,1] 4
- ```
- # Scoring
This is [tag: code-golf]. Shortest answer in each language wins.
- Heavily based on [this closed challenge from SE.](https://codegolf.stackexchange.com/q/148911/80214)
- # Description
- A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$
- The next term, \$t_3 = t_1 - t_2\$
- More generally, \$t_n = t_{n-2} - t_{n-1}\$
- The sequence ends when \$t_n ≤ 0\$. All values in the sequence must be positive.
- # Challenge
- Given two integers \$t_1\$ and \$t_2\$, compute the Sumac sequence, and output it's length.
- If there is a negative number in the input, remove everything after it, and compute the length.
- You may take the input in any way (Array, two numbers, etc.)
- # Test Cases
- (Sequence is included for clarification)
- ```
- [t1,t2] Sequence n
- ------------------------------
- [120,71] [120,71,49,22,27] 5
- [101,42] [101,42,59] 3
- [500,499] [500,499,1,498] 4
- [387,1] [387,1,386] 3
- [3,-128] [3] 1
- [-2,3] [] 0
- [3,2] [3,2,1,1] 4
- ```
- # Scoring
- This is <a class="badge is-tag">code-golf</a>. Shortest answer in each language wins.
#3: Post edited
by
Razetime
·
2021-01-28T09:46:10Z (almost 4 years ago)
- Heavily based on [this closed challenge from SE.](https://codegolf.stackexchange.com/q/148911/80214)
- A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$
- The next term, \$t_3 = t_1 - t_2\$
- More generally, \$t_n = t_{n-2} - t_{n-1}\$
The sequence ends when \$t_n ≤ 0\$ (exclusive). No negative integers should be present in the sequence.- # Challenge
- Given two integers \$t_1\$ and \$t_2\$, compute the Sumac sequence, and output it's length.
If there is a negative number in the input, remove everything after it(including the negative number), and compute the length. The length can be 0.- You may take the input in any way (Array, two numbers, etc.)
- # Test Cases
Taken from the original question.- ```
t1 t2 length120 71 5101 42 3500 499 4387 1 33 -128 1-2 3 00 0 0- ```
- Heavily based on [this closed challenge from SE.](https://codegolf.stackexchange.com/q/148911/80214)
- # Description
- A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$
- The next term, \$t_3 = t_1 - t_2\$
- More generally, \$t_n = t_{n-2} - t_{n-1}\$
- The sequence ends when \$t_n ≤ 0\$. All values in the sequence must be positive.
- # Challenge
- Given two integers \$t_1\$ and \$t_2\$, compute the Sumac sequence, and output it's length.
- If there is a negative number in the input, remove everything after it, and compute the length.
- You may take the input in any way (Array, two numbers, etc.)
- # Test Cases
- (Sequence is included for clarification)
- ```
- [t1,t2] Sequence n
- ------------------------------
- [120,71] [120,71,49,22,27] 5
- [101,42] [101,42,59] 3
- [500,499] [500,499,1,498] 4
- [387,1] [387,1,386] 3
- [3,-128] [3] 1
- [-2,3] [] 0
- [3,2] [3,2,1,1] 4
- ```
- # Scoring
- This is [tag: code-golf]. Shortest answer in each language wins.
#2: Post edited
by
Razetime
·
2020-12-04T01:55:42Z (almost 4 years ago)
- Heavily based on [this closed challenge from SE.](https://codegolf.stackexchange.com/q/148911/80214)
- A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$
- The next term, \$t_3 = t_1 - t_2\$
- More generally, \$t_n = t_{n-2} - t_{n-1}\$
- The sequence ends when \$t_n ≤ 0\$ (exclusive). No negative integers should be present in the sequence.
- # Challenge
- Given two integers \$t_1\$ and \$t_2\$, compute the Sumac sequence, and output it's length.
- If there is a negative number in the input, remove everything after it(including the negative number), and compute the length. The length can be 0.
- You may take the input in any way (Array, two numbers, etc.)
- # Test Cases
- Taken from the original question.
- ```
- t1 t2 length
- 120 71 5
- 101 42 3
- 500 499 4
- 387 1 3
- 3 -128 1
- -2 3 0
- ```
- Heavily based on [this closed challenge from SE.](https://codegolf.stackexchange.com/q/148911/80214)
- A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$
- The next term, \$t_3 = t_1 - t_2\$
- More generally, \$t_n = t_{n-2} - t_{n-1}\$
- The sequence ends when \$t_n ≤ 0\$ (exclusive). No negative integers should be present in the sequence.
- # Challenge
- Given two integers \$t_1\$ and \$t_2\$, compute the Sumac sequence, and output it's length.
- If there is a negative number in the input, remove everything after it(including the negative number), and compute the length. The length can be 0.
- You may take the input in any way (Array, two numbers, etc.)
- # Test Cases
- Taken from the original question.
- ```
- t1 t2 length
- 120 71 5
- 101 42 3
- 500 499 4
- 387 1 3
- 3 -128 1
- -2 3 0
- 0 0 0
- ```
#1: Initial revision
by
Razetime
·
2020-11-16T16:42:10Z (almost 4 years ago)
Length of a Sumac Sequence
Heavily based on [this closed challenge from SE.](https://codegolf.stackexchange.com/q/148911/80214)
A Sumac sequence starts with two non-zero integers \$t_1\$ and \$t_2.\$
The next term, \$t_3 = t_1 - t_2\$
More generally, \$t_n = t_{n-2} - t_{n-1}\$
The sequence ends when \$t_n ≤ 0\$ (exclusive). No negative integers should be present in the sequence.
# Challenge
Given two integers \$t_1\$ and \$t_2\$, compute the Sumac sequence, and output it's length.
If there is a negative number in the input, remove everything after it(including the negative number), and compute the length. The length can be 0.
You may take the input in any way (Array, two numbers, etc.)
# Test Cases
Taken from the original question.
```
t1 t2 length
120 71 5
101 42 3
500 499 4
387 1 3
3 -128 1
-2 3 0
```