5. Create a vector called to20 that goes from 1 to 20 (use the range notation). Now create a variable called end that goes from 40 to 50 (use the range notation). Now create a variable called to50 that combines to20, then the number 21 to 30 and then add thes end variable at the end. Now print the variable to50. It should output the numbers 1 through 30 and then 40 through 50, skipping 31-39.

Write a program called assignment3 (saved in a file assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very e↵ective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the “larger” integer is replaced by the di↵erence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.

Sarah is having a hard time finding a template for her advertising business that she may be able to use at a later date and also make it available to her colleagues

The most complicated four letter word