0

hi there :)

i'm currently practicing with the recursive backtracking method by trying to solve all the suggested problems...

one of them says: find all the solutions for the next ecuation: 3x + y + 4xz = 100

so the solution would be of type S={(x,y,z) | x,y,z belonging to N}

by now i've tried different stuff like finding a pattern which would guide me then to make the validation part but i couldnt find anything that would work.. i've deduced that each element of the 3 levels of the stack where i build the solution belongs to a set of elements formed only by knowing the other 2 ... can somebody gimme a hint or something?!