You are given an int variable k, an int array zipcodelist that has been declared and initialized , and an boolean variable duplicates. write some code that assigns true to duplicates if there are two adjacent elements in the array that have the same value , and that assigns false to duplicates otherwise. use only k, zipcodelist, and duplicates.

Thank you for posting your question here at . I hope the answer will help you. Feel free to ask more questions here.
Below is the

duplicates = false;
for(k = 0; k < zipcodeList.length - 1; k++)
{
if(zipcodeList[k] == zipcodeList[k + 1])duplicates = true;

}

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

1 the 1st term, 3 the 2nd term, 6 the 3rd term,etc.

note the following:

from the 1st term (1) to the 2nd term (3), we go up by 2,from the 2nd term (3) to the 3rd term (6), we go up by 3from the 3rd term (6) to the 4th term (10), we go up by 4, andfrom the 4th term (10) to the 5th term (15), we go up by 5.

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for

If i drew it correctly, then al would also equal 14 in., because the midsegment divides the line ab into 2, equal in length lines.therefore, al = lb