triploblastic's blog

By triploblastic, history, 9 years ago, In English

I have read about gaussian elimination technique from this link. http://e-maxx-eng.github.io/linear_algebra/linear-system-gauss.html . But how do we solve the equations given a prime modulo? do i need to calculate the multiplicative inverse every time i have to divide the row with a number or is there another way to do that without using multiplicative inverse?

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By triploblastic, 11 years ago, In English

can someone tell me what is wrong with my code? i first generated all the primes up to sqrt(10^7) and then for every prime, counted how many number are divided by it...

5797193

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it