You will write the n + 1 rule as a program: the heights of the lines and where each one falls.
The idea. A signal with equivalent neighbours has lines in the heights of row of Pascal's triangle. The lines are hertz apart, centred on the shift.
Your tasks.
pascal(n). It returns row , for example [1, 2, 1] for .positions(shift, n, j, mhz). It returns the line positions in ppm, from low to high.outer_share(n), the height of an outer line divided by the height of the tallest line.Run your code once to unlock the worked solution.
Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Log in to join the discussion.
Loading…