Problem Description Happy new year to everybody! Now, I want you to guess a minimum number x betwwn 1000 and 9999 to let (1) x % a = 0; (2) (x+1) % b = ...

Problem Description Give a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.

Problem Description A weird clock marked from 0 to 59 has only a minute hand. It won’t move until a special coin is thrown into its box. There are different k...

Problem Description Given a positive integer n, find the positions of all 1’s in its binary representation. The position of the least significant bit is 0.

Problem Description Given a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.

Problem Description From the article Number Theory in the 1994 Microsoft Encarta: “If a, b, c are integers such that a = bc, a is called a multiple of b or of...

Problem Description As part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers...

Problem Description Welcome to 2006’4 computer college programming contest!

Problem Description Given an positive integer A (1 <= A <= 100), output the lowest bit of A.

Problem Description Superbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions, the local hack...