Unfortunately NextZero does not seem very reliable. In this case, it seems to not always find what is truly the next zero. I will try again by converting this to a continuous problem---trivial to do in this case.

Unfortunately NextZero does not seem very reliable. In this case, it seems to not always find what is truly the next zero. I will try again by converting this to a continuous problem---trivial to do in this case.

@abbeykabir Please start a new Question thread with this question. Also, please try to put some details of the question into the text itself, rather than leaving it all in the worksheet. I will look at your worksheet in the meantime.

Update: I took a look at it. It is a very interesting question. Please post it as a separate thread. Also, please attach a worksheet that I can execute. The current one does not give me access to the b; it merely displays its value.

@abbeykabir Please start a new Question thread with this question. Also, please try to put some details of the question into the text itself, rather than leaving it all in the worksheet. I will look at your worksheet in the meantime.

Update: I took a look at it. It is a very interesting question. Please post it as a separate thread. Also, please attach a worksheet that I can execute. The current one does not give me access to the b; it merely displays its value.

You had to have a formula to draw the graph, right? It would be easier to answer your questions using that formula than getting it directly from the graph.

Yes, you can just remove it. Then you'll just be left with the radial lines.

The command quo(a,b,x,'r') divides polynomial a by polynomial b with respect to variable x. It returns the quotient and stores the remainder in r. Each row of the matrix corresponds to one of our polynomials (that's the outer seq). To get the entry in the leftmost column, we divide by a[1]. To get the entry in the next column, we take the remainder of the division and divide it by a[2]. We proceed in this manner until we have divided by every variable.

The command quo(a,b,x,'r') divides polynomial a by polynomial b with respect to variable x. It returns the quotient and stores the remainder in r. Each row of the matrix corresponds to one of our polynomials (that's the outer seq). To get the entry in the leftmost column, we divide by a[1]. To get the entry in the next column, we take the remainder of the division and divide it by a[2]. We proceed in this manner until we have divided by every variable.

@Andriy 

I have decided that it is a typo as I can't understand this construction:

N:= (i,j,sigma,f)-> sum(sum(sum(nn(i,j,sigma), sigma= 1..2), j= 1..3), i= 1..f):

You're right: It should be N:= f-> .... What I wrote is nonsense! Sorry about that. Try this:

nn:= ()-> `if`([args]::list(integer), ap.am(args), 'procname'(args)):

N:= proc(f)
local i,j,sigma;
     Sum(Sum(Sum(nn(i,j,sigma), sigma= 1..2), j= 1..3), i= 1..f)
end proc:

I can't help with the simplification of the nn operators.

@Andriy 

I have decided that it is a typo as I can't understand this construction:

N:= (i,j,sigma,f)-> sum(sum(sum(nn(i,j,sigma), sigma= 1..2), j= 1..3), i= 1..f):

You're right: It should be N:= f-> .... What I wrote is nonsense! Sorry about that. Try this:

nn:= ()-> `if`([args]::list(integer), ap.am(args), 'procname'(args)):

N:= proc(f)
local i,j,sigma;
     Sum(Sum(Sum(nn(i,j,sigma), sigma= 1..2), j= 1..3), i= 1..f)
end proc:

I can't help with the simplification of the nn operators.

@Markiyan Hirnyk asked: Could you explain the occurrence of or in your code?

I also wondered at it at first. But pay close attention to the direction of the inequalities that are connected by or. Preben had to do it this way because two-argument arctan always returns a value between -Pi and Pi. So the shaded region is considered as two regions by inequal.

@Markiyan Hirnyk asked: Could you explain the occurrence of or in your code?

I also wondered at it at first. But pay close attention to the direction of the inequalities that are connected by or. Preben had to do it this way because two-argument arctan always returns a value between -Pi and Pi. So the shaded region is considered as two regions by inequal.

@Jimmy I think (just guessing here) that when the fit is very good, as it is in your situation, that it can work without the parameter ranges.

@Jimmy I think (just guessing here) that when the fit is very good, as it is in your situation, that it can work without the parameter ranges.

@Andriy But you never tested what I actually wrote! You have N:= f-> ..., but I wrote N:= (i,j,sigma,f)-> ....