Difference between revisions of "AMC 12C 2020 Problems"
(→Problem 6) |
(→Problem 7) |
||
Line 43: | Line 43: | ||
How many increasing(lower to higher numbered) subsets of <math>\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}</math> contain no <math>2</math> consecutive prime numbers? | How many increasing(lower to higher numbered) subsets of <math>\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}</math> contain no <math>2</math> consecutive prime numbers? | ||
+ | |||
==Problem 7== | ==Problem 7== | ||
Let <math>T(n)</math> denote the sum of the factors of a positive integer <math>n</math>. What is the sum of the <math>3</math> least possible values of <math>x</math> such that <math>T(x) + T(2x) = 8</math>? | Let <math>T(n)</math> denote the sum of the factors of a positive integer <math>n</math>. What is the sum of the <math>3</math> least possible values of <math>x</math> such that <math>T(x) + T(2x) = 8</math>? | ||
− | |||
− | |||
==Problem 8== | ==Problem 8== |
Revision as of 17:28, 21 April 2020
Contents
Problem 1
What is the sum of the solutions of the equation ?
Problem 2
What is the numerical value of the sum
Problem 3
In a bag are marbles consisting of blue marbles and red marbles. If each marble is pulled out at a time, what is the probability that the marble pulled out red?
Problem 4
cows can consume kilograms of grass in days. How many more cows are required such that all the cows together can consume kilograms of grass in days?
Problem 5
A lamb is tied to a post at the origin on the real plane with a rope that measures units. wolves are tied with ropes of length as well, both of them being at points , and . What is the area that the lamb can run around without being in the range of the wolves?
Problem 6
How many increasing(lower to higher numbered) subsets of contain no consecutive prime numbers?
Problem 7
Let denote the sum of the factors of a positive integer . What is the sum of the least possible values of such that ?
Problem 8
The real value of that satisfies the equation can be written in the form where and are integers. What is ?
Problem 10
In how many ways can candy canes and lollipops be split between children if each child must receive atleast candy but no child receives both types?