fermat | high performance research | GPU library

I read your code, and it is working fine.

One thing you would like to add is the index of text inputs in a single row.

Currently, if user presses + button three times, addCustomFile will add three elements to state.customRow. However, three of these elements are identical, and there is nothing to distinguished from each other.

That is why the filter function (which is executed when X button is pressed) will remove all the elements inside state.customRow that belongs to same row.

I suggest you to add a new attribute to elements of state.customRow to distinguish added inputs of a same row. For example, it could be insideRowIndex and each added input can have incrementing integer (0,1,2,3,4 ...).

Checking insideRowIndex inside the filter function will let you to only remove the input you intend to, not all the others that belong to same function.

When you exceed MAXINT for your machine, Python converts the computations to its "large integer" mode, which is much slower. You're working with a number that has a huge quantity of digits. Instead, you need to perform your modulus operations regularly, or perform some other algorithm, to get the performance you'll need.

From GeeksForGeeks:

You can work with a filter and yield an (x, y, z) tuple in case the filter is satisfied:

It's because your pow_mod is terribly slow. Use a fast algorithm or just use Python's built-in pow function.

Btw, if I understand your rather convoluted code correctly, you're simply checking whether all tests were successful. Which can be written more clearly:

You were going in the right direction, but rather than touching the DOM directly via style.backgroundColor you can use some React state to track the ID of the row and then apply a selected class which handles the styling.

I've updated the sandbox to give you an idea how to do this. https://codesandbox.io/s/elegant-lewin-duqt6?file=/src/App.js

NOTE: I've only applied the row selection for the first two rows of the top table. This solution will need DRYing out, but should give you an idea how to achieve it.

You're thinking about this too hard. Relax and let Python do the work:

Your N does not have two distinct prime factors:

The problem is with your modular exponentiation algorithm: The modulus is applied to res but not to b. Since b is squared in every iteration, it will become extremely large (as in several thousand digits). This slows down your algorithm.

To solve this, you have to apply the modulus to b as well. Replace b *= b with: