As I said in a previous post, I worked on some research papers on cryptography and algorithms. I decided to publish, for now, one of the papers: “A study on sorting times”.
You can read/download it from here [romanian language].
As I said in a previous post, I worked on some research papers on cryptography and algorithms. I decided to publish, for now, one of the papers: “A study on sorting times”.
You can read/download it from here [romanian language].
I write this paper in order to prove an equation. Why? Because today, in a national maths contest, I received an exercise that could have been solved using this equation.
We know that a modular expression looks like this: a≡b(mod n) , and it is read: “a is congruent to b modulo n”.
I must prove the following: P(k): (∑αi mod 2) mod 2=(∑αi) mod 2 where 1≤i≤k
