Mathematics, 19.03.2020 23:59, Zykuko
Prove: If a is any integer and the polynomial f(x) = x 2 + ax + 1 factors (poly mod 9), then there are THREE distinct non-negative integers y less than 9 such that f(y) ≡ 0 (mod 9). Hint: If x 2 +ax+ 1 ≡ (x+b)·(x+c) (mod 9), what can you deduce about b and c? Remark: This problem is very similar to the next problem.
Answers: 2
Other questions on the subject: Mathematics
Mathematics, 21.06.2019 17:00, liaholmes8
Given f(x)=2x^2-8x+6 and g(x)=3x-1 find f(x) +g(x) a. 2x^2+5x+5 b.2x^2-11x+7 c. 2x^2-5x+5 d.2x^2-5x-5
Answers: 1
Mathematics, 22.06.2019 00:00, lazymarshmallow7
50 will mark show all use the linear combination method to solve the system of equations. explain each step of your solution. if steps are not explained, you will not receive credit for that step. 2x+9y= -26 -3x-7y=13
Answers: 1
Mathematics, 22.06.2019 00:30, steelersfan4343
Which of these side lengths could form a triangle a) 2 cm , 2 cm , 4 cm b) 3 cm , 5 cm , 10 cm c) 3 cm , 4 cm , 5 cm d) 4 cm , 8 cm , 15 cm
Answers: 3
Do you know the correct answer?
Prove: If a is any integer and the polynomial f(x) = x 2 + ax + 1 factors (poly mod 9), then there a...
Questions in other subjects:
Social Studies, 20.09.2020 03:01
Chemistry, 20.09.2020 03:01
