Its called Matweb dot com

This problem is more computationally proofy. I had fun with it. Mind you, youre solving the character polynomial associated with a second order diffy eqn with monomial constants with the substitution y=x^m.

Have fun, if you get it right ill give you boob pictures.

Seriously though, go through your book aswell bud.

I just found out recently that converting between number systems (i.e. decimal to binary) uses successive multiplications or divisions depending on the digit placement. Then it dawned upon me, so is this why logarithms and modulizing number systems are interesting in Number theory. I always wondered why they make computer engineers study number theory.

Its a pretty interesting topic to dive into.

I dont have any links really have links on this one. Mayber check out the history of logarithms and see the correlation.

I would look at the translated version of "Mirifici Logarithmorum Canonis Descriptio," and look at what mods do.

For instance, using the integer number system and modulizing it by 2, I build the set of number which could be represented as binary numbers.

I like this guys channel. He does nice softcore examples of proofing techniqies generally required and even does and a set theory basis for the natural numbers rather than the usual peano's axioms.

Hopefully one day I can get lapacke working and build fancier.