Given int variables k and total that have already been declared, use a while loop to compute the sum of the squares of the first 50 counting numbers, and store this value in total. Thus your code should put 1*1 + 2*2 + 3*3 +... + 49*49 + 50*50 into total. Use no variables other than k and total.

the smallest possible measurement of the width is 14 feet

step-by-step explanation:

let's assume length of parallelogram is 'l'

width of parallelogram is 'w'

the perimeter of a parallelogram must be no less than 40 feet

so, we get

we are given

length of parallelogram is 6 feet

so,

l=6

we can plug it

now, we can solve for w

subtract both sides by 12

divide both sides by 2

and we get

so,

the smallest possible measurement of the width is 14 feet

answer: yes, since the line has a steeper rate of change than the exponential the y-values will be greater and they will only intersect one time.

the polynomial is a perfect square trinomial of the form a^2-2ab+b^2:

option a. true

step-by-step explanation:

9x^2-12x+4

comparing with the form a^2-2ab+b^2

1.) a^2=9x^2

solving for a: square root both sides of the equation:

sqrt(a^2)=sqrt(9x^2)

a=sqrt(9) sqrt(x^2)

a=3x

2.) b^2=4

solving for b: square root both sides of the equation:

sqrt(b^2)=sqrt(4)

b=2

to be a perfet square trinomial 2ab must be equal to 12x. let's check:

2ab = 2 (3x) (2)

2ab = 12x

correct

step-by-step explanation: hi!