Found problems: 259
The operations below can be applied on any expression of the form \(ax^2+bx+c\).
$(\text{I})$ If \(c \neq 0\), replace \(a\) by \(4a-\frac{3}{c}\) and \(c\) by \(\frac{c}{4}\).
$(\text{II})$ If \(a \neq 0\), replace \(a\) by \(-\frac{a}{2}\) and \(c\) by \(-2c+\frac{3}{a}\).
$(\text{III}_t)$ Replace \(x\) by \(x-t\), where \(t\) is an integer. (Different values of \(t\) can be used.)
Is it possible to transform \(x^2-x-6\) into each of the following by applying some sequence of the above operations?
$(\text{a})$ \(5x^2+5x-1\)
$(\text{b})$ \(x^2+6x+2\)
On a blackboard there are $2010$ natural nonzero numbers. We define a "move" by erasing $x$ and $y$ with $y\neq0$ and replacing them with $2x+1$ and $y-1$, or we can choose to replace them by $2x+1$ and $\frac{y-1}{4}$ if $y-1$ is divisible by 4.
Knowing that in the beginning the numbers $2006$ and $2008$ have been erased, show that the original set of numbers cannot be attained again by any sequence of moves.
$ 1994$ girls are seated at a round table. Initially one girl holds $ n$ tokens. Each turn a girl who is holding more than one token passes one token to each of her neighbours.
a.) Show that if $ n < 1994$, the game must terminate.
b.) Show that if $ n \equal{} 1994$ it cannot terminate.
Let $x_1,\cdots, x_n$ be nonzero vectors of a vector space $V$ and $\varphi:V\to V$ be a linear transformation such that $\varphi x_1 = x_1$, $\varphi x_k = x_k - x_{k-1}$ for $k = 2, 3,\ldots,n$.
Prove that the vectors $x_1,\ldots,x_n$ are linearly independent.
The numbers $1, 2, \dots , 50$ are written on a board. Letícia performs the following actions: she erases two numbers $a$ and $b$ on the board, writes the number $a+b$ on it and notes the number $ab(a+b)$ in her notebook. After performing these operations $49$ times, when there is only one number written on the board, Letícia calculates the sum $S$ of the $49$ numbers in the notebook.
a) Prove that $S$ doesn't depend on the order Letícia chooses the numbers to perform the operations.
b) Find the value of $S$.
Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.
A natural number is written in each square of an $ m \times n$ chess board. The allowed move is to add an integer $ k$ to each of two adjacent numbers in such a way that non-negative numbers are obtained. (Two squares are adjacent if they have a common side.) Find a necessary and sufficient condition for it to be possible for all the numbers to be zero after finitely many operations.
[i]George the grasshopper[/i] lives of the real line, starting at $0$ . He is given the following sequence of numbers: $2, 3, 4, 8, 9, ... ,$ which are all the numbers of the form $2^k$ or $3^l$, $k, l \in \mathbb{N}$, arranged in increasing order. Starting from $2$, for each number $x$ in the sequence in order, he (currently at $a$) must choose to jump to either $a+x$ or $a-x$. Show that [i]George the grasshopper[/i] can jump in a way that he reaches every integer on the real line.
The circles $ C_{1}$ and $ C_{2}$ touch externally at $ M$ and the radius of $ C_{2}$ is larger than that of $ C_{1}$. $ A$ is any point on $ C_{2}$ which does not lie on the line joining the centers of the circles. $ B$ and $ C$ are points on $ C_{1}$ such that $ AB$ and $ AC$ are tangent to $ C_{1}$. The lines $ BM$, $ CM$ intersect $ C_{2}$ again at $ E$, $ F$ respectively. $ D$ is the intersection of the tangent at $ A$ and the line $ EF$. Show that the locus of $ D$ as $ A$ varies is a straight line.