X and y being "congruent" under modulo n is denoted by "x ≡ y mod n" and defined as "x and y having the same remainder when divided by n." Show the following congruences. Required:
Show that the smallest k for 1640 ≡ k mod 7 is k = 2.

Write a method that accepts a string object as an argument and returns the number of words it contains. for instance, if the argument is "four score and seven years ago", the method should return the number 6. demonstrate the method in a program that asks the user to input a string and then passes that string into the method, printing out whatever the method returns.

When is it appropriate to use an absolute reference

For the following example of making a peanut butter and jelly sandwich, identify which are inputs, processes, or outputs: bread scooping and spreading peanut butter plate scooping and spreading jelly finished sandwich putting two pieces of covered bread together dirty plate crumbs