Algebra Theorems Flashcards

1
Q

mersenne composite numbers

A

let n∈ℕ. Suppose that n is composite. Then 2ⁿ -1 is composite

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

infinite primes

A

There are infinitely many primes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

sequences containing no primes

A

let n∈ℕ. There exists a sequence of n consecutive natural numbers containing no primes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Factors of sums of integers

A

Let a,b,c∈ℤ. Suppose than a|b and a|c. Then a|(b+c).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Factors of linear combinations of integers

A

Let a,b,c,k,l∈ℤ. Suppose that a|b and a|c. Then a|(kb+lc).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Sequence of factors.

A

Let a,b,c∈ℤ. Suppose that a|b and b|c. Then a|c.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Two numbers are factors of each other

A

Let a,b∈ℤ. Suppose that a|b and b|a. Then a = +-b

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

division theorem

A

Let a∈ℤ and d∈ℕ. Then there exists unique q,r∈ℤ s.t. a=qd+r and 0<=r

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

equal hcf of factor and remainder

A

Let a,b,q,r∈ℤ. Suppose that a=qb+r . Then, hcf(a,b) = hcf(b,r)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Euclidean Algorithm verfication

A

Let a,b∈ℕ with a>b and let h be the output of Algorithm 2.12 (Euclidean algorithm). Then, h = hcf(a,b).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Bezouts lemma

A

a,b∈ℤ and let h=hcf(a,b). Then there exists x,y∈ℤ s.t. h=xa +yb

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

common factors of highest common factors

A

Let a,b,c∈ℤ and let h=hcf(a,b). Suppose that c is a common factors of a and b. The c|h.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

lcm multiplied by hcf

A

Let a,b∈ℕ. Then lcm(a,b).hcf(a,b)=ab

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

divisibility of a multiple

A

Let a,b∈ℤ and p∈ℕ be prime. Suppose that p|ab. Then p|a or p|b

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

divisibility of a multiple for r values

A

Let a₁,a₂,..,aₙ∈ℤ and p∈ℕ be prime. Suppose that p|a₁,a₂,..,aₙ. Then p|aᵢ for some i=1,2,..,n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

fundamental theorem of airthmetic

A

let n∈ℕ with n>1. Then:

a) there exists prime numbers p₁≤ p₂≤ …≤ pₖ such that n=p₁p₂…pₖ
b) if q₁≤q₂≤…≤pₗ are prime numbers such that n=q₁q₂..qₗ, then k=l and qᵢ=pᵢ for all i=1,2,..,k

17
Q

what is √2

A

√2 is irrational

18
Q

imperfect squares are irrational

A

Let a∈ℕ. Suppose that a is not a perfect square, then √a is irational

19
Q

perfect nth powers of coprime products

A

Let a,b,n∈ℕ suppose a is coprime to b, and ab is a perfect nth power. Then both a and b are perfect nth powers.

20
Q

same remainders

A

Let n∈ℕ and a,b∈ℤ. Then a≡bmodn iff a and b leave the same remainder when divided by n

21
Q

unique b

A

Let n∈ℕ and a∈ℤ. Then there exists unique b ∈ Z with 0 ≤ b < n such that a ≡ b mod n.

22
Q

properties of modulo

A

Let n∈ℕ and a,b,c∈ℤ Then:

(a) a ≡ a mod n; (Reflexive property)
(b) if a ≡ b mod n, then b ≡ a mod n; and (Symmetric property)
(c) if a ≡ b mod n and b ≡ c mod n, then a ≡ c mod n. (Transitive property)

23
Q

arithmetic operations on modulo

A

Let n,m∈ℕ and a,b,a₀,b₀∈ℤ. Suppose that a ≡ b mod n and that

a) a+a’ ≡ (b+b’)modn
b) aa’ ≡bb’modn
c) aᵐ=bᵐmodn

24
Q

multiple versions of az≡1modn

A

let n∈ℕ and a∈ℤ. Suppose that a is coprime to n. Then there exists z∈ℤ s.t. az≡1modn

25
Q

unique solutions to a linear congruence equation

A

let n∈ℕ and a,b∈ℤ. Suppose that a is coprime to n. Consider the linear congruence equation
ax ≡ bmodn
Then there exists s∈ℤ s.t. the solutions of A are given by x≡smodn

26
Q

similar factors in linear congruence equations

A

Let n∈ℕ and a,b,c∈ℤ. Suppose that c is coprime to n and
ac ≡ bcmodn
Then,
a ≡ bmodn

27
Q

factors of multiples

A

Let a,b,c∈ℤ. Suppose that a is coprime to b and that a|c and b|c. Then ab|c.

28
Q

coprimes of multiples.

A

a,b,c∈ℤ. Suppose that a is coprime to c and that b is coprime to c. Then ab is coprime to c.

29
Q

Chinese remainder theorem

A

Let n₁,n₂,..,nₖ∈ℕ and a₁,a₂,…,aₖ∈ℤ. Suppose that hcf(nᵢ,nⱼ)=1 for i≠j. Consider the system of simultaneous congruences
x≡a₁modn₁
x≡a₂modn₂

x≡aₖmodnₖ
Then there exists s∈ℤ s.t. the solution of the systemgiven by x≡smodn₁.n₂..nₖ