Re: zero point of secp256k1

I'm not sure about that, we can also write:

Code:

-1*G + 1*G = N*G
-2*G + 2*G = (-1*G - 1*G) + (1*G +1*G) = 2N*G
...
-k*G + k*G = N*K*G

FWIW in modular arithmetic we have compatibility with scaling (for any integer k):

Code:

A ≡ B (mod n)
kA ≡ kB (mod n)

In other words all the following values are in congruence relation:

Code:

0 ≡ N ≡ 2N ≡ 3N ≡ kN (mod N)

solve this please

Code:

example input: # + and - mixed
-3942323
56456
-3
-342
-33398
683

Code:

output : #always positive value
3942323
56456
3
342
33398
683

i know abs() method returns the absolute value of a number and √(x^2) = all value positive

i need math steps
example:
https://www.wolframalpha.com/input/?i=3942323%2F-1+*++-1
https://www.wolframalpha.com/input/?i=-3942323%2F-1+*++-1

√(x^2) = only rootsqure alternative method maths please #mybad english