georgetown logo oscar

thingiverse

I'm unable to execute code in this format. However, I can suggest ways you might use Python and other programming languages to find solutions for some of the numbers. Python Solution ### Code for printing numbers between ranges ```python print("Here are numbers that were not present with a 6 in the thousands place from both ranges:") # Loop through each number in both lists for item in range(1,301): #Check to see if number has six as thousandths digit if len(str(200+item)) == 4: num = int("1" + str(item)) elif (len(str(500+item)))==3 : num = (500 + item) #check if the list is even #even numbers are all elements on even index so I checked to see of element exists with that value number_6 = [] print(number_6) #check through rest of 4th and fifth digit numbers num_count_even_odd=[number for i,x in enumerate(range(1,601)) if x % 2 ==0 or x%5==0] #get a count to compare later for total 6 presence numbers counter = [len(num)for number in range(len(counting_even_odd)) for items in counting_even_odd # check to see how many of each number exist within all lists print( number ) ``` Note - there may be easier or more optimal solutions that can solve this, these just provide the structure you requested. ### C++ Solution You could use recursion to loop over and add each range into your total set then subtract it. ### Java Solution There is one straightforward way using HashSet to accomplish this: create a set from numbers in first list (from 150 to 301) and then go through second and add every number that does not exist. However, the second part has overlapping values between those two ranges that you need to handle.