Easy Sequences 92: Number of Roots of a System of Linear Diophantine Equations - MATLAB Cody - MATLAB Central

Problem 57565. Easy Sequences 92: Number of Roots of a System of Linear Diophantine Equations

Difficulty:
(303)
Rate
One of the tasks that Matlab is very good at, is in solving systems of linear equations.
In this problem we shall tackle a system of linear Diophantine Equations in which the roots are limited to certain range.
Given the number of variables n, positive integers, a, b and a root limit, L, create the function, numRoots(n,a,b,L), that outputs the number of posible integer root sets of the following system of equations:
with:
.
For example, if , the system of equations: and , where , has only one root set, namely: . Therefore, numRoots(2,10,4,1) = 1.
If , two of the possible roots of:
; and
where:
are and . In fact, there are possible root sets. Therefore, numRoots(4,20,6,3) = 16.
There are no possible roots for and , therefore in these cases the function should return: numRoots = 0.
-------------------------
NOTE: As an added challenge, only those solutions with Cody program size of less than or equal to 200 will be accepted.
Solve

Solution Stats

100.0% Correct | 0.0% Incorrect
Last Solution submitted on Feb 08, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers1

Suggested Problems

More from this Author116

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Go to top of page