Create a Program to ask the user to enter multiple values until he enter a Negative value, and print how many unique numbers entered.   Example Input: 1 2 1 3 2 4 3 3 3 2 -1   Output: You have entered 4 unique numbers excluding the negative value.

The date June 10, 1960, is special because when we write it in the following format, the month times the day equals the year: 6/10/60 Write a program that ask the user to enter a month in numeric format, a day and a two-digit year. The program should then determine whether the month times the day is equal to the year. If so, it should display a message saying the date is Magic. Otherwise, it should display a message saying the date is not Magic. Output should look as shown below. Create test data and place in a file. Name the code file Last Name + First Initial + "-MagicDates.s", for example "SmithJ- MagicDates.s". Name the test data file in a similar manner. Upload the program and test data files to the Dropbox. 6/10/60 is Magic! 6/10/70 is not Magic. 2/11/22 is Magic!

-Prompts the user to enter an integer x. Assume without error checking the user enters a positive integer.  -The program then will print all the odd integers between 1 and x that are a multiple of 3.   Sample: Enter an integer x: 15  3 is a multiple of 3  9 is a multiple of 3  15 is a multiple of 3

Prime factors of an integer \( n \) are a set of prime numbers that can be multiplied together to obtain \( n \). Write a proHide Transcribed Text Prime factors of an integernare a set of prime numbers that can be multiplied together to obtainn. Write a program that asks the user to enter a number and displays the prime factors ordered from smallest to largest. If the number entered by the user is less than 2 then there are no prime factors and the message "No prime factors" should be displayed. The following algorithm can be used to discover the prime factors: - initialize factor to 2 - while factor is less than or equal tondo: ifnis evenly divisible by factor then - conclude that factor is a factor ofn- dividenby factor using floor division else: - increase factor by 1 Adapt the algorithm so it can be used to print out the prime factors of a number. Notes: - You can assume that the number entered by the user will be an integer number. - The output must be in the format shown in the…