Hi, i need help to find this formula. Lets say only x is unknown but the next x will always be x(i+1) which is x,2x,3x,4x
x^e mod P = K
x^5 mod 23 = 13
2x ^ 5 mod 23 = 2
3x ^ 5 mod 23 = 8
4x ^ 5 mod 23 = ?
how to find next K since i know next x is (i+1) which will be 4x.
i need something similar to fast exponentiation. but for fast exponentiation, it works if e is the only unknown value.
i forgot to add that the value is actually a encrypted value which is not in fixed length, and the position of the digit cannot be sorted as i will lose information.
is there any kind of fix algorithm something like (mod 1000)*6 /2. that kind of algorithm to change it to 6 digit value and able to get back the actual value on the other side.
Lets say i have a value 545388669453 i need to use a algorithm to convert the value to a 6 digit value. then i enter the 6 digit value on the other application. the other application will use the same algorithm to get back the value of 545388669453.
is there such algorithm? please help me
i need some help counting probability using Bayes theorem
given that 1/10 of message is a spam message. spam detector will correct identify a message as spam 89 percent of the time. the spam detector will correct identify a message as not spam 89 percent of the time too. The detector has just detect a message as being spam. what is the probability that the message is actually not a spam message?
i have come out with some numbers which i am really not sure i am correct
someone please guide me with this. i am really confused.
i need to know the formula to get the coordinates that are on the perimeter and within the shape of square and rectangle. does anyone know that?
lets say square coordinates of (1,1) , (1,3) , (3,3) , (3,1)
points on perimeter would be (1,2) , (2,1) , (2,3) , (3,2) excluding the actual coordinates above.
points within shape would be (2,2)