We say that an integer a is a type 0 integer if there exists an integer n such that a = 3n. An integer a is a type 1 integer if there exists an integer n such that a = 3n + 1. An integer a is a type 2 integer if there exists an integer n such that a = 3n + 2. Prove that if a is a type 1 integer, then a 2 is a type 1 integer\
2 answers:
Answer:
<em>Proof below</em>
Step-by-step explanation:
Let's assume a is a type 1 integer. By definition, it means we can find an integer n such that
a=3n+1
We need to prove is a type 1 integer
Expanding
If is a type 1 integer, then we should be able to find an integer m such as
Equating
solving for m
Since we know n is an integer, then the expression of m gives an integer also. Having found the required integer m, the assumption is proven
hope this helps :)
have an amazing day :)
Let's assume a is a type 1 integer. By definition, it means we can find an integer n such that
a=3n+1
We need to prove is a type 1 integer
Expanding
If is a type 1 integer, then we should be able to find an integer m such as
Equating
solving for m
Since we know n is an integer, then the expression of m gives an integer also. Having found the required integer m, the assumption is proven
You might be interested in
I believe the points should be as follows : X, S, Y, and U.
Answer:
36 teachers
Step-by-step explanation:
total students=128+121+135=384
groups of 32=384/8=12
teachers=12x3=36
Answer:
270 Minutes
Step-by-step explanation:
4hours = 240 Minutes
+30 minutes = 270 Minutes
Google said the answer is 2.48832 :)
In the fourth step, he didn’t put the “negative” sign for 4.