Joined a algorithm chat group recently, now I am questioning my dumb brain

  • 2
    Relax. You could be me shitposting about 'breaking prime factorization' as I learn of things I never even comprehended or knew existed.

    Better to be ignorant and honest than ignorant and obstinate. We learn more by admitting our own foolishness than denying it.
  • 1
    @Wisecrack huh funny that you are the first comment I see since some weeks here, it's me the guy who tried breaking it too! xD
  • 0

    No way?

    I'm curious what approaches you tried.
  • 1
    @Wisecrack in short, I found that if I can find the middle of the two primes of a number, I can calculate the primes easily. And such a number can always be written as (m-d)*(m+d) or just m^2-d^2. If you find an integer solution for that, you win, but I couldn't find anything on the internet on how to solve a difference of squares for integers.

    So what I found is basically nothing, just that any product of 2 primes can be written as a difference of squares like m^2-d^2 where m and d are both positive integers and m > d.

    I got some promising functions and graphs but in the end they all were just some transformation of m^2-d^2 which we can not solve for integers easily.

    But it was fun to try all this
  • 0

    Euler's factorization method yeah?
  • 0
    @Wisecrack not exactly but it's close to what I tried
Add Comment