Show that if P=NP, then there is a polynomial time algorithm for factoring. Here you are given an n-bit number N, and you need to find a factor a that divides N, with a ≠ 1 and a ≠ N, if such an a exists.

Write a method that takes in an array of point2d objects, and then analyzes the dataset to find points that are close together. be sure to review the point2d api. in your method, if the distance between any pair of points is less than 10, display the distance and the (x,y)s of each point. for example, "the distance between (3,5) and (8,9) is 6.40312." the complete api for the point2d adt may be viewed at ~pf/sedgewick-wayne/algs4/documentation/point2d.html (links to an external site.)links to an external site.. try to write your program directly from the api - do not review the adt's source code.

Apunishment or the threat of punishment used to enforce conformity. select the best answer from the choices provided t f

What is a loop? a. a collection of function definitions at the top of a program b. a line of code that defines a variable and assigns it a value c. a program that opens the turtle graphics window d. a block of code that repeats a specific number of times