Search problems

94 problems match “counting”. Clear

Visitors search a sample. Sign in for free to search every problem. Sign in

  1. Counting z with integer parts of f(z) ●●●●○ 100 ptsLet f:C→Cf : \mathbb{C} \to \mathbb{C} be defined by f(z)=z2+iz+1f(z) = z^2 + iz + 1. How many complex numbers zz are there such that Im(z)>0\text{Im}(z) > 0 and both the real and the imaginary parts of f(z)f(z) are integers with absolute value at most 1010?
  2. Minimum red balloons in a string ●●●●○ 100 ptsDavid is making a string of red, white, and blue balloons by these rules: - no red balloon is adjacent to another red balloon; - white balloons appear in groups of exactly two, and groups of white balloons are separated by at least two non-white balloons; - blue balloons appear in groups of exactly three, and groups of blue balloons are separated by at least three non-blue balloons. If David uses more than 600 balloons, find the smallest number of red balloons he can use.
  3. Counting case-switching letter sequences ●●●●○ 100 ptsBob writes a sequence of letters of the alphabet, each of which is either uppercase or lowercase, under these rules. If he has just written an uppercase letter, he either writes the same letter in lowercase next, or the next letter of the alphabet in uppercase. If he has just written a lowercase letter, he either writes the same letter in uppercase next, or the preceding letter of the alphabet in lowercase. For example, a A a A B C D d c b B Ca\,A\,a\,A\,B\,C\,D\,d\,c\,b\,B\,C is such a sequence. How many sequences of 32 letters can he write that start at lowercase aa and end at lowercase zz?
  4. Possible second terms of a sequence ●●●●○ 100 ptsA sequence a1,a2,…a_1, a_2, \ldots of non-negative integers is defined by the rule an+2=∣an+1−an∣a_{n+2}=|a_{n+1}-a_n| for n≥1n\geq1. If a1=999a_1=999, a2<999a_2<999, and a2006=1a_{2006}=1, how many different values of a2a_2 are possible?
  5. Possible values of the largest removed integer ●●●●○ 100 ptsYann writes down the first nn consecutive positive integers, 1,2,3,4,…,n−1,n1,2,3,4,\ldots,n-1,n. He removes four different integers p,q,r,sp,q,r,s from the list. At least three of p,q,r,sp,q,r,s are consecutive and 100<p<q<r<s100<p<q<r<s. The average of the integers remaining in the list is 89.562589.5625. What is the number of possible values of ss?
  6. Count complex solutions of an exponential equation ●●●●○ 100 ptsHow many complex numbers zz such that ∣z∣<30\left| z \right| < 30 satisfy the equation ez=z−1z+1e^z = \frac{z - 1}{z + 1}?
  7. Integers reaching one in twenty steps ●●●●○ 100 ptsFor every positive integer xx, let f(x)={1if x=1x10if x is divisible by 10x+1otherwisef(x)=\begin{cases}1 & \text{if }x = 1\\ \frac x{10} & \text{if }x\text{ is divisible by }10\\ x+1 & \text{otherwise}\end{cases} and define a sequence by x1=xx_1=x and xn+1=f(xn)x_{n+1}=f(x_n) for all positive integers nn. Let d(x)d(x) be the smallest nn such that xn=1x_n=1. (For example, d(100)=3d(100)=3 and d(87)=7d(87)=7.) Let mm be the number of positive integers xx such that d(x)=20d(x)=20. Find the sum of the distinct prime factors of mm.
  8. Smallest n with many solutions ●●●●○ 100 ptsLet f(x)=∣2{x}−1∣f(x)=|2\{x\}-1|, where {x}\{x\} denotes the fractional part of xx. Find the smallest positive integer nn such that the equation nf(xf(x))=xn f(x f(x))=x has at least 20122012 real solutions.
  9. Minimum red beads in a necklace ●●●●○ 100 ptsA necklace consists of 50 blue beads and a certain number of red beads. In any segment of the necklace containing 8 blue beads, there are at least 4 red beads. What is the minimum number of red beads that can be in this necklace? The beads are arranged cyclically, so the last bead is adjacent to the first.
  10. Roots in [0,1] after sine substitution ●●●●○ 100 ptsUsing a suitable substitution, determine the number of roots of the equation 8x(1−2x2)(8x4−8x2+1)=18x(1-2x^2)(8x^4-8x^2+1)=1 that lie in the interval [0,1][0,1].

← PreviousNext →