<h2>
Step-by-step explanation:</h2>
As per the question,
Let a be any positive integer and b = 4.
According to Euclid division lemma , a = 4q + r
where 0 ≤ r < b.
Thus,
r = 0, 1, 2, 3
Since, a is an odd integer, and
The only valid value of r = 1 and 3
So a = 4q + 1 or 4q + 3
<u>Case 1 :-</u> When a = 4q + 1
On squaring both sides, we get
a² = (4q + 1)²
= 16q² + 8q + 1
= 8(2q² + q) + 1
= 8m + 1 , where m = 2q² + q
<u>Case 2 :-</u> when a = 4q + 3
On squaring both sides, we get
a² = (4q + 3)²
= 16q² + 24q + 9
= 8 (2q² + 3q + 1) + 1
= 8m +1, where m = 2q² + 3q +1
Now,
<u>We can see that at every odd values of r, square of a is in the form of 8m +1.</u>
Also we know, a = 4q +1 and 4q +3 are not divisible by 2 means these all numbers are odd numbers.
Hence , it is clear that square of an odd positive is in form of 8m +1
A. If the player chooses 6, 4, and 8 each time, they have 3/5 chances to win.
6+4= 10
6+8= 14
8+4= 12
These are all even so as long as they get one of these combinations they will win
b. All three combinations still work when multiplied
6*4=24
6*8=48
8*4= 32
Answer:
follow pcllord on twitch
Step-by-step explanation:
a content creator on the pogg champ smp
81 is a counter example of the conditional statement given.
81 has factors other than itself, 1 and the square root of 81 which is 9.
81 has factors of 3 and 27 which are not listed.
Answer:
true
Step-by-step explanation:
3+3+3+3+3+3+3+3=24.
Mark me brainliest please ._.
