#992 - Another Frog Jumping
There are \(n+1\) stones in a pond, numbered \(0\) to \(n\).
A frog starts by jumping onto stone \(0\). It then jumps between the stones, only ever jumping to adjacent ones. For fixed \(k\), it makes exactly \(k+i\) visits to each stone \(i\) for \(0 \le i \lt n\); however, there are no restrictions on the number of times stone \(n\) is visited. The frog can finish on any stone.
If \(n=3\) and \(k=2\) it would visit stone \(0\) two times, stone \(1\) three times and stone \(2\) four times.
One way of achieving this is:
\(0 \to 1 \to 0 \to 1 \to 2 \to 3 \to 2 \to 1 \to 2 \to 3 \to 2\).
Let \(J(n,k)\) be the number of ways the frog can make such a journey. For example, \(J(3,2) = 17\), \(J(6,1) = 1320\) and \(J(6,5) = 16793280\).
Find \(\displaystyle \sum_{s=0}^4 J(500,10^s)\). Give your answer modulo \(987898789\).
Problem text © Project Euler, licensed under CC BY-NC-SA 4.0. Original: projecteuler.net/problem=992. Published Saturday, 11th April 2026, 08:00 pm. Solved by 171 members at time of mirroring.
Why this is useful
Algorithmic Development. Graph/state-space search transfers to routing, dependency resolution, and execution-path optimisation (Phases 16, 17).
We classify relevance honestly - not every Euler problem is a trading application.
Prerequisites
Lessons that prepare you:
1.3 Proof Techniques: Direct, Contrapositive, and Contradiction · 19.5 Combinatorics: Counting, Binomials, and Inclusion–Exclusion · 19.14 Computational Complexity, Feasibility Estimation, and Proving Algorithms Correct · 19.1 Divisibility, GCD, and the Euclidean Algorithm · 19.9 Graph Algorithms: BFS, DFS, Dijkstra, and Minimum Spanning Trees · 19.3 Modular Arithmetic, Inverses, and Fast Exponentiation · 19.11 Integer Partitions and Counting Structures · 19.2 Primes, Sieves, and Integer Factorization · 7.1 Probability Spaces, Random Variables, and Distributions
Recommended stepping-stone problems: #673 · #907 · #610
Concepts: combinatorics graph-theory number-theory brute-force-reduction
Likely techniques: modular-exponentiation
Learning mode
Pick how much scaffolding you want. Your choice is remembered per problem.
Understand the problem
- What exactly is the input to problem 992? Is it a bound (500), a supplied dataset, or a definition you must generate from?
- What is the required output - restate it precisely: a single exact integer. Required format: Give your answer modulo 987898789.
- Which objects exactly are in scope, and which are excluded by the wording (strict vs non-strict inequality, 'distinct', 'proper', 'below' vs 'up to')?
- What do the arguments of J(n,k), J(3,2) mean, and what is the value's type (count, sum, probability)?
- What are the edge cases: the smallest legal object, zero/one, ties, and the boundary at exactly 500?
- Why is brute force hard HERE specifically? Estimate the number of candidates implied by 500 and the cost of testing one.
- Which combinatorics fact would, if true, collapse the search - and can you state it as a testable claim before you look for a proof?
Predict & plan (before you code)
- Predict the strategy: in one sentence, what will your solution do? (The classification says combinatorics / modular-exponentiation - do you agree, and why?)
- Predict the complexity of your intended method in terms of N = 500, and the wall-clock time you expect. Write both down now.
- Predict the key data structure: what is stored, keyed by what, and how large will it get at full scale?
- Predict the failure mode: what is most likely to break - an off-by-one on the bound, a definition misread, precision, or memory?
- Predict the output of the small case from rung 3 BEFORE running it (the statement says: "For example, J(3,2) = 17, J(6,1) = 1320 and J(6,5) = 16793280.") - then run it. A surprise here is worth more than an hour of debugging later.
Scratchpad
Mathematical notes, formulas, pseudocode, hypotheses, complexity notes. Saved automatically with your progress.
Python workbench
Real Python (Pyodide) in a sandboxed Web Worker - no network, no filesystem, no DOM access. Ctrl/Cmd+Enter runs. Escape leaves the editor. Stop terminates the worker.
Check your answer
Answers are checked against a salted hash held in a separate file - not printed in this page. This prevents accidental spoilers; it is not cryptographic protection (see the build notes).
Progressive hints
Optimization
You have a correct answer. That is the start of the learning, not the end.
- Reduce the time complexity. What is the bottleneck, and what mathematical fact removes it?
- Reduce memory. Can you stream, or keep only the last k states?
- Replace brute force with a closed form, a sieve, a recurrence, or a symmetry argument.
- Prove the optimized version computes the same thing.
- Compare two implementations and time them.
Explain it
Which step of your solution were you least confident about, and what evidence would settle it?
What did you try first, and what specifically made you abandon it - a proof, a timing, or a wrong small-case answer?
Where did the combinatorics structure do the real work? Name the single observation that collapsed the search space.
Could you have reached the modular-exponentiation idea faster? Which words in the statement were pointing at it, and did you notice them?
What was the bug that cost you the most time, and what CLASS of bug was it (off-by-one, definition misread, precision, state under-specified)?
How would your solution change if the bound 500 were multiplied by 1000? Does it survive, or does it need a different idea?
What is the honest complexity of what you wrote (not what you intended), and where is the remaining slack?
Which problem you have already solved is this most similar to, and what is the shared skeleton - is it really 'modular-exponentiation' underneath?
State the transferable technique in one sentence, without mentioning this problem's story at all.
Self-assess (mastery is not a correct number)
You reach Mastered only when you have solved it, rated yourself at least Solid across the dimensions, and written a real explanation.
Confidence
Low confidence schedules this problem for spaced review, even if you solved it.
Mastery check
- Variation: change the bound (or a rule) in the statement. Does your method still work? What breaks first?
- Constraints: if the limit were 10× larger, which step fails, and what would you replace it with?
- Related problem: #673 · #907 · #610
- Transfer: where else does this technique appear? Name a lesson and a real computational setting.
- Spaced re-attempt: come back after the review interval and re-solve it with no hints.