Ludwig loves to solve different problem using his knowledge of programming. Today, Ludwig got a grid with x rows and y columns. Rows are indexed from 1 to a and columns are indexed from 1 to b. The...

Extracted text: Ludwig loves to solve different problem using his knowledge of programming. Today, Ludwig got a grid with x rows and y columns. Rows are indexed from 1 to a and columns are indexed from 1 to b. The cell (m, n) is the cell of intersection of rowm and column n. Each cell has a number written on it. The number written on cell (m, n) is equal to (m+n). Now, Ludwig wants to select some cells from the grid, such that for every pair of selected cells, the numbers on the cells are co-prime. With the help of python programming find the maximum number of cells that Ludwig can select. Test Case: 56 Result: