Suppose that a, b \in \mathbb{Z}a, b∈Z, not both 00, and let d=\gcd(a, b)d=gcd(a, b). Bezout's theorem states that dd can be written as a linear combination of aa and bb, that is, there exist integers m, n \in \mathbb{Z}m, n∈Z such that d = am + bnd=am+bn. Prove that, on the other hand, any linear combination of aa and bb is divisible by dd. That is, suppose that t = ax + byt=ax+by for some integers x, y \in \mathbb{Z}x, y∈Z. Prove that d \, | \, td∣t.

Ineed to learn how to solve this problem

Jack is considering a list of features and fees for current bank: jack plans on using network atms about 4 times per month. what would be jack’s total estimated annual fees for a checking account with direct paycheck deposit, one overdraft per year, and no 2nd copies of statements? a. $44 b. $104 c. $144 d. $176

On a certain portion of an experiment, a statistical test result yielded a p-value of 0.21. what can you conclude? 2(0.21) = 0.42 < 0.5; the test is not statistically significant. if the null hypothesis is true, one could expect to get a test statistic at least as extreme as that observed 21% of the time, so the test is not statistically significant. 0.21 > 0.05; the test is statistically significant. if the null hypothesis is true, one could expect to get a test statistic at least as extreme as that observed 79% of the time, so the test is not statistically significant. p = 1 - 0.21 = 0.79 > 0.05; the test is statistically significant.