원클릭으로
stop-at-one
Compute a sequence for a given starting number by repeatedly calling the next_number tool until the value 1 is reached.
Codex 또는 Claude로 설치 이 Prompt를 복사해 Codex, Claude 또는 다른 어시스턴트에 붙여 넣으면 Skill 페이지를 검토하고 설치를 진행할 수 있습니다.
메뉴
Compute a sequence for a given starting number by repeatedly calling the next_number tool until the value 1 is reached.
Codex 또는 Claude로 설치 이 Prompt를 복사해 Codex, Claude 또는 다른 어시스턴트에 붙여 넣으면 Skill 페이지를 검토하고 설치를 진행할 수 있습니다.
Compute the complete Hailstone sequence for a given starting number by repeatedly calling the next_number tool until the value 1 is reached.
Compute the top-10 most frequent words in any text passage supplied by the user.
Bump the package version (major, minor, or patch), then sync CITATION.cff, src/_version.py, and CHANGELOG.md. Use when asked to cut a release or bump the version.
Create a GitHub issue in nerdai/llm-agents-from-scratch and add it to project
SOC 직업 분류 기준
| name | stop-at-one |
| description | Compute a sequence for a given starting number by repeatedly calling the next_number tool until the value 1 is reached. |
Compute a full sequence from a starting number down to 1
using the next_number tool.
The user must provide a starting number (a positive integer greater than 1).
If no starting number is given, ask the user before proceeding.
Set the current number x to the starting number provided by the user.
Begin tracking the sequence as a list: [x].
Call next_number with the current value of x.
next_number(x=<current_number>)
STOP and WAIT for the tool result before continuing.
Append the returned value to the sequence list.
Set x to the returned value.
x == 1, proceed to Step 5.Important rules:
Print the complete sequence from start to finish, for example:
6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1
Also report: