count_solutions_diophantine
Count integer solutions to linear Diophantine equations within specified bounds. Use this tool to determine how many integer pairs (x,y) satisfy ax + by = c for given ranges.
Instructions
Count integer solutions to ax + by = c within given bounds. (Domain: arithmetic, Category: diophantine_equations)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | ||
| b | Yes | ||
| c | Yes | ||
| x_min | Yes | ||
| x_max | Yes | ||
| y_min | Yes | ||
| y_max | Yes |