The job is to "guess" the hidden parameters (weights) of A and B, in a simple linear function F(x, y) = Ax + By, where all the numbers are assumed to be integers. A and B are not given, but whether the result F(x[i], y[i]) is positive (>=0) or negative (<0), is given for a large number of sample points (x[1], y[1]), (x[2], y[2]), … The algorithm goes as follows:

(x[3], y[3]),(x[4], y[4]),(x[-3], y[-3]),(x[-5], y[-5]),(x[i=n], y[i=n])

Step-by-step explanation:

The algorithm follows the answer given above because all numbers are member of integers.

Integers are set of positive or negative whole numbers including zero.

In the answer given, the numbers in the algorithm also take some negative values, since the are integers.

In the function, F(x,y) = Ax + By. In F(x[i], y[i]), i = +1,-1, +2,-2,+3,-3,+4,-4,+5,-5,n, where n is any positive or negative whole number or zero(That is, Integers)

3

step-by-step explanation:

because where the point where the 2 lines intersect is (3,-1) the x value is 3

ωєℓℓ ωιтн тнαт ιиfσ

тнє вαѕє ιѕ 30

αи∂ тнє нєιgнтн ιѕ 30

нσρє ι ¢συℓ∂ нєℓρ