The generalized Pell equation is of the form: 
. Given D and N as inputs, output the first 50 positive integer solutions [x, y] sorted by x (smallest to largest). Both outputs should be a cell array of character arrays containing the integer solutions.
. Given D and N as inputs, output the first 50 positive integer solutions [x, y] sorted by x (smallest to largest). Both outputs should be a cell array of character arrays containing the integer solutions.Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
-
2530 Solvers
-
given 3 sides, find area of this triangle
823 Solvers
-
205 Solvers
-
101 Solvers
-
Split bread like the Pharaohs - Egyptian fractions and greedy algorithm
97 Solvers
More from this Author65
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Using a combination of a so-called 'brute-force' algorithm and the general solution to the Pell-equation (see e.g. a nice paper by Robertson), I get much more solutions with small positive x than seem to be considered by the creator of the problem. The assigned 20-th solution of case 1 is my 30-th solution. Please rework the problem.