# 2006 Alabama ARML TST Problems

## Contents

## Problem 1

How many integers satisfy the inequality

## Problem 2

Compute .

## Problem 3

River draws four cards from a standard 52 card deck of playing cards. Exactly 3 of them are 2’s. Find the probability River drew exactly one spade and one club from the deck.

## Problem 4

Find the number of six-digit positive integers for which the digits are in increasing order.

## Problem 5

There exist positive integers , , , and with no common factor greater than 1, such that

Find .

## Problem 6

Let be the greatest integer less than or equal to and let . Find given that

## Problem 7

Four equilateral triangles are drawn such that each one shares a different side with a square of side length 10. None of the areas of the triangles overlap with the area of the square. The four vertices of the triangles that aren’t vertices of the square are connected to form a larger square. Find the area of this larger square.

## Problem 8

A bored mathematician has his computer calculate 1000 consecutive terms in the Fibonacci sequence. He notes that the smallest of the numbers is a multiple of 7. How many of the other 999 Fibonacci numbers are multiples of 7?

## Problem 9

Amanda ordered a dozen donuts. She said she wanted only chocolate, glazed, and powdered donuts, and at least one of each kind. Let , , and be the number of chocolate, glazed, and powdered donuts she wound up with. Find the number of possible ordered triples .

## Problem 10

Let be the probability that Scooby Doo solves any given mystery. The probability that Scooby Doo solves 1800 out of 2006 given mysteries is the same as the probability that he solves 1801 of them. Find the probability that Scooby Doo solves the mystery of why Eddie Murphy decided to stop being funny.

## Problem 11

The integer has 1403 digits, and 1 is its first digit (farthest to the left). For how many integers does begin with the digit 1?

## Problem 12

Yoda begins writing the positive integers starting from 1 and continuing consecutively as he writes. When he stops, he realizes that there is no set of 5 composite integers among the ones he wrote such that each pair of those 5 is relatively prime. What’s the largest possible number Yoda could have stopped on?

## Problem 13

Find the sum of the solutions to the equation

## Problem 14

Find the real solution to the system of equations

## Problem 15

Ying lives on Strangeland, a tiny planet with 4 little cities that are each 100 miles apart from each other. One day, Ying begins driving from her home city of Viavesta to the city of Havennew, which takes her about an hour. When she gets to Havennew, she decides she wants to go straight to another city on Strangeland, so she randomly chooses one of the other three cities (possibly Viavesta), and starts driving there. Ying drives like this for most of the day, making 8 total trips between cities on Strangeland, choosing randomly where to drive to next from each stop. She then stops at her final city of destination, digs a hole, and buries her car.

Let be the probability Ying buried her car in Viavesta and let q be the probability she buried it in Havennew. Find the value of .