G Prove that for any integer n, n is divisible by 3 iff n 2 is divisible by 3. Does your proof work for divisibility by 4 - why or why not? Identify the kind of proof steps you used, and why.

If n is devisible by 3 then n^2 is devisible by 3 it easy.

n=3k so n^2=9k so 9 is devisible by 3.

In the other way, if n^2 is devisible by 3we have n^2=3k wher k is integer number which has to be devisible by 3. If k is not devisible by 3, then n=/sqrt3*r , r^2=k. So n is not integer, contradiction.

This proof show us that iff doesnt work.

If n is devisile by 4 then n^2 is also devisible by 4. But if we have that n^2 is devisibke by 4 then n hasn’t be devisible by 4. Example: n^2=36 is dev by 4 but n=6 is not dev by4.

Its allow because /sqrt 4 is 2.

d) by the cross product property, ab^2 = bc multiplied by ad

step-by-step explanation:

we are given

in the given triangle abc

angle a is 90° and segment ad is perpendicular to segment bc

we can see that

triangle(abc) and triangle(abd) are similar because they have common side and same angle (90 degree)

so, triangles(abc) and abd are similar

since, they are similar

so, the ratio of their sides must be equal

we get

now, we can cross multiply

and we get

so, this could be step to prove it

your exact question is kind of difficult to understand, so maybe an example will explain what you're supposed to do? i'll work through the first problem on the worksheet.

suppose you have a tray of 652 brownies, and you have 5 friends that you want to feed without picking favorites. how many brownies can you dole out to each of your friends in equal amounts? how many will be left over for you to eat?

what you're doing here is finding a way to arrange the number 652 as the sum of integer multiple of 5 and some remainder:

here ("q" for quotient) is the number of brownies each of your friends get, and is the remainder. that's the basic idea behind division.

we break up the number 652 into parts so that the leading digit stands on its own:

652 = 600 + 52

first we check if it's possible to hand out exactly 100 brownies to each friend. with 5 friends, this means we want to know if we can take out 500 brownies from the tray. we can do this 1 time because we have 600 brownies to take from, and when we do that we're left with 100 + 52 brownies to divvy up. so we know that

652 = 1*500 + 152

next we want to know if it's possible to hand out exactly 10 brownies per friend. if we can, we have to remove 50 brownies from the tray each time until we can't. we have 152 brownies left, and we know that 3(50) = 150, so

152 = 3*50 + 2

now we have 2 brownies left in the tray. is it possible to hand 1 out to each of your 5 friends? no, you'd need a minimum of 5 brownies to do that. so the last 2 are yours.

putting everything together, we found that

652 = 1*500 + 3*50 + 2

and we can rearrange this to write

652 = 5*100 + 5*30 + 2

652 = 5(100 + 30) + 2

652 = 5*130 + 2

so and .

you might be more accustomed to the table depicting the algorithm. that's just a compact way of organizing what we've done above. you can consult the image i've attached below.