Proof

[steep remnant]

for 1 think about how to represent an odd number

for A you can use proof by counter example

[strange heart]

can i use n

[steep remnant]

idk if thats the official name

[steep remnant]

no

then for B again think how to represent an odd number

its any two odd numbers remember not consecutive

[strange heart]

sorry im still confused

how would i represent a odd number

[steep remnant]

2k+1

[strange heart]

ohhh alright

[steep remnant]

so n=2k+1 for the first question

[strange heart]

thats to represent the odd number right

[steep remnant]

yes

[strange heart]

alright

what would i do afterwards

[steep remnant]

3n + 5 = 3(2k+1) + 5

prove its even

[strange heart]

would that be the answer

[steep remnant]

once uve proved its even yes

[strange heart]

3n + 5
= 3(2k + 1) + 5
= 6k + 3 + 5
= 6k + 8
= 2(3k + 4)
= 2m

is this correct

[steep remnant]

yeah

[strange heart]

m would be 3k+4

would that be the answer

[steep remnant]

what

the question wants u to prove its even

[strange heart]

oh should i just leave it at 2m

[steep remnant]

once uve factored out a 2 thats all u need

you can do 2m if u want

[strange heart]

the question doesnt require it so im gonna leave it at 2m

would i do the same 2k+1 for question 2 as well?

[steep remnant]

no

thats not necessarily prime

and its asking you to disprove it

so u need to find a counter example

@modest wagon if ur about to send a solution ill beat you up

[modest wagon]

Cld u not simply write 3n must be odd bc odd time odd is always odd and then odd plus odd is always even? Do u have to rewrite n as 2k-1 for example?

[modest wagon]

Lmaooooo

[steep remnant]

yeah that works

but words

hate those

[modest wagon]

Lol

[strange heart]

n = 2k + 1
(2k1)2 (2k + 1)2-4k2 + 4A+ 1

would this be it

for 2

[steep remnant]

no idea what that says

as i said all u need to find is a counter example

[strange heart]

i have done B can you check if its correct
odd int (2k+1) + other int (2n+1)

= 2k+2n+1+1

=2k+2n+2

=2(k+n+1)

K + n + 1 = y

=2(k+n+1)

=2y

[steep remnant]

yes

its right

[strange heart]

im still trying to figure out a

[steep remnant]

and odd prime number eg 7
n + 2 = 9 which isnt prime

[strange heart]

for question a?

[steep remnant]

yes

[strange heart]

m = 2n+1
n = 2k + 1
m +n = 2a + 1 + 2b +1 = 2(a+b+1) = integer
therefore m +n is even

@steep remnant would this be correct for b

[steep remnant]

not really

u changed ur variables to a and b

and it was right before anyway

[strange heart]

oh shit i meant a

for a would that be correct

[steep remnant]

A?

[strange heart]

yeah

[steep remnant]

no?

A is about prime numbers

[strange heart]

im starting to give up

i dont know what to do

@steep remnant help

[steep remnant]

i lit did it

find an example where the statement is true

so where n+2 isnt prime

when n is

[strange heart]

wait n +2 is the answer?

n+ 2 = 9

[steep remnant]

wut

find a value of n such that n+2 isnt prime and n is

[strange heart]

wouldnt it be nine

[steep remnant]

an example of n+2 would be 9 yes