Pages:
Author

Topic: This message was too old and has been purged - page 7. (Read 9002 times)

newbie
Activity: 42
Merit: 0
i tried and came up with this.. hope i can get some xD

=((x-1)^2 (x+1)^2)\/(4 x (a x+x^2+1))


=(x^4-2 x^2+1)\/(4 a x^2+4 x^3+4 x)


x = 1, a - 2=/0
x = 1, a + 2=/0

={x element R : (a<=-2 and x<0) or (a<=-2 and x>0 and sqrt(a^2-4)+a+2 x<0)
or (a<=-2 and sqrt(a^2-4)+a+2 x>0 and sqrt(a^2-4)>a+2 x)
or (a<=-2 and a+2 x>sqrt(a^2-4))
or (-2or (a>=2 and sqrt(a^2-4)>a+2 x and sqrt(a^2-4)+a+2 x>0)
or (a>=2 and sqrt(a^2-4)or (a>=2 and x>0)
or (a>=2 and sqrt(a^2-4)+a+2 x<0)}

1\/(4 x)-a\/4+1\/4 (a^2-3) x+(a-a^3\/4) x^2+1\/4 (a^4-5 a^2+4) x^3+O(x^4)\n(Laurent series)


x\/4-a\/4+(a^2-3)\/(4 x)+(a-a^3\/4)\/x^2+O((1\/x)^3)\n

(d)\/(dx)((x^2-1)^2\/(4 x (x^2+a x+1))) = ((x^2-1) (2 a (x^3+x)+x^4+6 x^2+1))\/(4 x^2 (a x+x^2+1)^2)

 integral (-1+x^2)^2\/(4 x (1+a x+x^2)) dx = 1\/8 ((a^2-4) log(a x+x^2+1)+2 a sqrt(4-a^2) tan^(-1)((a+2 x)\/sqrt(4-a^2))-2 a x+x^2+2 log(x))+constant



BTC: 199hWWjMZdZ59dfyKpi7AG7wKv9LnqJSij
member
Activity: 99
Merit: 10
yeah ive given him the instructions to find his answer and how to do it in which languages thank you!
newbie
Activity: 42
Merit: 0
so the bounty is @ 34 for me now? Wink please check your messages form me ive finished this bounty thanks!

so you mean you already got the answer? Huh
member
Activity: 99
Merit: 10
so the bounty is @ 34 for me now? Wink please check your messages form me ive finished this bounty thanks!
member
Activity: 99
Merit: 10
yes i just sent him how to solve it in pm
member
Activity: 70
Merit: 10
Bitcoin > Dollar

Problem Description:

Being a some constant, further assume that we
are in a factor ring (basically all operations modulo some sumber p). Note, that the division below is a multiplication by the modular inverse.
You always have to start with x=9.
Consider the following recursive formula:

Code:
new_x = (x²-1)² / (4*x*(x²+a*x+1))

How often do you have to perform this operation to get a specific x (basically getting the new_x and feeding it back into the formula to get another new_x, and so on)?
Note: You can start multiple such chains beginning at x=9, and add the resulting x values
using the addition algorithm from http://en.wikipedia.org/wiki/Montgomery_curve (Montgomery arithmetic section).
Note, that the x value, is the value you get at the end of such calculation-chain, and the z value is always 1.



Is this really solvable at all?
member
Activity: 99
Merit: 10
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN

i just sent you a pm with the appropriate script on how to compute and find your solution please send my bounty the addy above thanks you!

@OP:You can run it yourself in a .html file just copy and paste it into notepad. Of course over 100000 is kinda slow on my computer so there are some limitations to it. If I was to have it calculated I would run the above script as php and then use that to generate the javascript code to give me an answer.

there your problem is solved in your pm please send me the bounty and close this thread
legendary
Activity: 2030
Merit: 1028
I have a friend that might interest for this Bounty.

Will let you no when I got respond from him
member
Activity: 99
Merit: 10
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN
14DFu1bW6DSPPuJYnZLn9EfgKeFYcLaFAN

i just sent you a pm with the appropriate script on how to compute and find your solution please send my bounty the addy above thanks you!
legendary
Activity: 1022
Merit: 1004
I still missed the part where the elliptic curve comes in. You need one
if you want to apply this addition method.
If you can describe your problem more formally, I might be able to
help.
legendary
Activity: 1260
Merit: 1168
This message was too old and has been purged
legendary
Activity: 1022
Merit: 1004
You always have to start with x=9.
Consider the following recursive formula:

Code:
new_x = (x²-1)² / (4*x*(x²+a*x+1))

How often do you have to perform this operation to get a specific x (basically getting the new_x and feeding it back into the formula to get another new_x, and so on)?

Let f:Z/pZ -> Z/pZ be the map given by your assignment
x |-> new_x. Then you basically ask for a map g:Z/pZ -> N
s.t. f^(g(y))(9) = y for all y in Z/pZ, right?

Note: You can start multiple such chains beginning at x=9, and add the resulting x values
using the addition algorithm from http://en.wikipedia.org/wiki/Montgomery_curve (Montgomery arithmetic section).
Note, that the x value, is the value you get at the end of such calculation-chain, and the z value is always 1.

I don't know what you mean with all of this.. Could you put it in more
mathematical terms?
Be also advised that the referenced addition “algorithm“ is not specific
to Montgomery curves, so it would be better to link to the wikipedia article
for elliptic curves where it is also described.
Do you try to consider elliptic curves over F_p? I have the impression,
but you should reformulate your question..
legendary
Activity: 812
Merit: 1002
Everything there is gibberish to me, but it does reminds me of this riddle below. Quite entertaining to follow even if you understood none of it.

https://bitcointalksearch.org/topic/arg-puzzle-with-35-btc-private-key-prize-game-over-661781

hero member
Activity: 728
Merit: 501
io.ezystayz.com
No idea if this helps, buts that is what I got when I followed the instructions in the referenced thread :-D

Code:
-----BEGIN BITCOIN SIGNED MESSAGE-----
Comment: Signed by Bitcoin Armory v0.92.3

Evilknievel just posted a 30 BTC bounty on Bitcointalk.org.
-----BEGIN BITCOIN SIGNATURE-----


G2LzJDlSBkzeCpZptys8LeDJfKS47Xgfu+d3/EvUEILmFljOoJPVKh/0iYo3yKBJ
EAqeAou/qsH5e9ZM7GCJMlQ=
=oRUP
-----END BITCOIN SIGNATURE-----


Yes , I've verified on  https://brainwallet.github.io/#verify  :



Code:
-----BEGIN BITCOIN SIGNED MESSAGE-----
Evilknievel just posted a 30 BTC bounty on Bitcointalk.org.
-----BEGIN SIGNATURE-----
18b2no9rBkovhv5gf3vkd5VQ9MKxHvqSzu
G2LzJDlSBkzeCpZptys8LeDJfKS47Xgfu+d3/EvUEILmFljOoJPVKh/0iYo3yKBJEAqeAou/qsH5e9ZM7GCJMlQ=
-----END BITCOIN SIGNED MESSAGE-----

PS: I removed the =oRUP , I don't know why the sign process gives  you that.

Yes the second one is verified with brainwallet. No need of =oRUP
legendary
Activity: 1778
Merit: 1043
#Free market
No idea if this helps, buts that is what I got when I followed the instructions in the referenced thread :-D

Code:
-----BEGIN BITCOIN SIGNED MESSAGE-----
Comment: Signed by Bitcoin Armory v0.92.3

Evilknievel just posted a 30 BTC bounty on Bitcointalk.org.
-----BEGIN BITCOIN SIGNATURE-----


G2LzJDlSBkzeCpZptys8LeDJfKS47Xgfu+d3/EvUEILmFljOoJPVKh/0iYo3yKBJ
EAqeAou/qsH5e9ZM7GCJMlQ=
=oRUP
-----END BITCOIN SIGNATURE-----


Yes , I've verified on  https://brainwallet.github.io/#verify  :



Code:
-----BEGIN BITCOIN SIGNED MESSAGE-----
Evilknievel just posted a 30 BTC bounty on Bitcointalk.org.
-----BEGIN SIGNATURE-----
18b2no9rBkovhv5gf3vkd5VQ9MKxHvqSzu
G2LzJDlSBkzeCpZptys8LeDJfKS47Xgfu+d3/EvUEILmFljOoJPVKh/0iYo3yKBJEAqeAou/qsH5e9ZM7GCJMlQ=
-----END BITCOIN SIGNED MESSAGE-----

PS: I removed the =oRUP , I don't know why the sign process gives  you that.
legendary
Activity: 1260
Merit: 1168
This message was too old and has been purged
legendary
Activity: 1778
Merit: 1043
#Free market
Can you sign a message from the bitcoin address (18b2no9rBkovhv5gf3vkd5VQ9MKxHvqSzu) ?

If you tell me how I can do that in Amory, I will. I am trying hard for the last 15 minutes  Wink


I've find this thread : https://bitcointalksearch.org/topic/signing-messages-in-armory-252848  maybe it will be helpful for you  ( I don't use armory , I prefer electrum).
legendary
Activity: 1260
Merit: 1168
This message was too old and has been purged
legendary
Activity: 1778
Merit: 1043
#Free market
Can you sign a message from the bitcoin address (18b2no9rBkovhv5gf3vkd5VQ9MKxHvqSzu) ?
hero member
Activity: 728
Merit: 501
io.ezystayz.com
Excellent!

Will try to Solve it.

Pages:
Jump to: