3871*X+2899=0 mod(9679)
#include<iostream>
using namespace std;
//main is the function from which execution of
//program starts
int main()
{
int i=0,j;
while(1)
{
//j stores the value of LHS of the expression
//i stores the value of X.
//we are increments value of i by the time it doesn't follows the codition.
j=3871*i+2899;
if(j%9679==0)
break;
//Once the value of i satisfies we break the loop and print the value of i which is X in the equation
i++;
}
cout<<i;
}
So,the value of X comes out to be 8058.
if you have any doubts please feel free to ask in comments.
please do upvote.
Thank You!
39. Suppose that the polynomial congruence f(x)0 (mod 7) has two distinct so- 0 lutions, what are the possible number of solutions of the congruence f(x) (mod 49)? 39. Suppose that the polynomial congruence f(x)0 (mod 7) has two distinct so- 0 lutions, what are the possible number of solutions of the congruence f(x) (mod 49)?
27) Solve each equation for x. a) +4 0, (mod 9) b) 4x+8 5,(mod 11) Xr
Find x in the following questions 1. 3072757632 mod x = 0 (where x>= 5907)
1. Show that the number of solutions (x mod p, y mod p) to the equation x² + 1 = y2 mod p is p- p (6+1) k=0
Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x (mod () 10), show the resulting: a. Separate chaining hash table b. Hash table using linear probing c. Hash table using quadratic probing d. Hash table with second hash function h2(x) = 7 - (x mod 7) *Assume the table size is 10.
use of Theorelli 2.29. 3. Prove that x 14 + 12x2 = 0 (mod 13) has 13 solutions and so it is an identical congruence. -o(mod n) hasi solutions x = a, x = a.,...,
9. Use the construction in the proof of the Chinese remainder theorem to find a solution to the system of congruences X 1 mod 2 x 2 mod 3 x 3 mod 5 x 4 mod 11 10. Use Fermats little theorem to find 712 mod 13 11. What sequence of pseudorandom numbers is generated using the linear congruential generator Xn+1 (4xn + 1) mod 7 with seed xo 3? 9. Use the construction in the proof of the Chinese...
Design a MOD 4 Synchronous Counter to count in a 2753,2753, etc. when x=0. Draw Circuit diagram as well.
Given the input sequence 4371, 1323, 6173, 4199, 4344, 9679, 1989, a hash table of size b=10, and a hash function h(x)=x mod b, show each step needed to build a hash table A closed hash table using double hashing, with the second hash function as h′(x)=7 − (x mod 7) This yields the sequence of hash functions hi(x)=(x mod b + i⋅ (7 − ( x mod 7)))mod b for i=0,1,…
Solve the following for x 4x ≡ 7 (mod 19) 6x ≡ 8 (mod 31) 9x ≡ 7 (mod 16)