Question: How many 6-digit positive integers have all digits either 3 or 7, and contain at least one pair of consecutive 3s?

["### How Many 6-Digit Positive Integers Consist of Only 3s and 7s with At Least One Pair of Consecutive 3s?", "When exploring patterns in numbers composed only of the digits 3 and 7, a fascinating combinatorial question arises: How many 6-digit positive integers made exclusively from the digits 3 and 7 contain at least one pair of consecutive 3s? This seemingly simple number-crunching problem taps into core principles of combinatorics and inclusion-exclusion, offering insight into counting structured sequences with constraints.", "---", "#### Understanding the Problem", "We want to count 6-digit integers where:", "- Every digit is either 3 or 7.\n- The number contains at least one occurrence of consecutive 3s (i.e., the substring "33").", "A naive approach might involve listing all such numbers, but with $ 2^6 = 64 $ possible combinations (since each digit has two choices), enumerating all manually is inefficient and error-prone. Instead, we can use complementary counting:", "[\n\ ext{Valid numbers with at least one "33"} = \ ext{Total valid 6-digit {3,7} numbers} - \ ext{Those with no "33" anywhere}\n]", "This method simplifies the problem significantly.", "---", "#### Step 1: Total 6-digit numbers using only 3 and 7", "Each of the 6 digits independently is either 3 or 7 — so total combinations:", "[\n2^6 = 64\n]", "This includes all sequences like 333333, 333337, 773333, 777777, etc.", "---", "#### Step 2: Count 6-digit numbers with no two consecutive 3s", "We now count how many of these do NOT contain "33" anywhere — these are the sequences without any consecutive 3s. Let’s define:", "- Let ( a_n ) be the number of n-digit numbers (digits 3 or 7), with no two consecutive 3s.", "We derive a recurrence based on the last digit:", "- If the nth digit is 7, the first ( n-1 ) digits can be any valid sequence of length ( n-1 ).\n- If the nth digit is 3, the ( (n-1) )-th digit must be 7 (to avoid 33), and the first ( n-2 ) digits form a valid sequence of length ( n-2 ).", "This gives the recurrence:", "[\na_n = a_{n-1} + a_{n-2}\n]", "Initial conditions:", "- ( a_1 = 2 ): digits 3 and 7 are valid (no risk of consecutive 3s).\n- ( a_2 = 3 ): valid sequences: 37, 73, 77; only 33 is invalid → 3 valid sequences.", "Now compute up to ( n = 6 ):", "- ( a_1 = 2 )\n- ( a_2 = 3 )\n- ( a_3 = a_2 + a_1 = 3 + 2 = 5 )\n- ( a_4 = a_3 + a_2 = 5 + 3 = 8 )\n- ( a_5 = a_4 + a_3 = 8 + 5 = 13 )\n- ( a_6 = a_5 + a_4 = 13 + 8 = 21 )", "So, there are 21 six-digit numbers using only 3s and 7s that have no consecutive 3s.", "---", "#### Step 3: Subtract to find sequences with at least one "33"", "Total possible 6-digit sequences of 3s and 7s: 64\nNumber with no consecutive 3s: 21\nThus, number with at least one "33" is:", "[\n64 - 21 = 43\n]", "---", "#### Additional Insight: How many of the 43 contain at least one "33"?", "Note: Having at least one pair of consecutive 3s includes sequences like 333000 (i.e., 333337), 733333, 333333, and even overlapping ones like 333333. Our subtraction correctly captures all such, so 43 is fully accurate.", "---", "#### Final Answer", "[\n\boxed{43}\n]", "There are 43 six-digit positive integers composed only of the digits 3 and 7 that contain at least one pair of consecutive 3s.", "---", "### Why This Matters", "This problem exemplifies how combinatorial reasoning and formulaic counting (like recurrence relations) can simplify apparently complex enumeration tasks. It highlights the power of complementary counting and recursion in solving real-world-style number pattern problems efficiently. Whether you're coding an algorithm, designing a puzzle, or teaching mathematically, this approach offers a clean, scalable method."]