Found problems: 1048
Find the total number of primes $p<100$ such that $\lfloor (2+\sqrt{5})^p \rfloor-2^{p+1}$ is divisible by $p$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.
If $p$ and $q$ are natural numbers so that \[ \frac{p}{q}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+ \ldots -\frac{1}{1318}+\frac{1}{1319}, \] prove that $p$ is divisible with $1979$.
Let $p$ and $q$ be prime numbers of the form $4k+3$. Suppose that there exist integers $x$ and $y$ such that $x^2-pqy^2=1$. Prove that there exist positive integers $a$ and $b$ such that $|pa^2-qb^2|=1$.
For all positive integers $a$ and $b$, we de ne $a @ b = \frac{a - b}{gcd(a, b)}$ .
Show that for every integer $n > 1$, the following holds:
$n$ is a prime power if and only if for all positive integers $m$ such that $m < n$, it holds that $gcd(n, n @m) = 1$.
Find all primes $p$ for which the quotient \[ \dfrac{2^{p-1} - 1 }{p} \] is a square.
Joe and Kathryn are both on the school math team, which practices every Wednesday after school until $4$ PM for competitions. The team was preparing for the $ 2005$ iTest when Joe realized how crazy he was for not asking Kathryn out – the way she worked those iTest problems, solving question after question, almost made him go insane sitting there that day. He never felt the same way when she worked on preparing for other competitions – they just aren’t the same.
Kathryn always beat Joe at competitions, too. Joe admired her resolve and unwillingness to make herself look stupid, when so many other girls he knew at school tried to pretend they were stupid in order to attract guys.
So as time ticked away and that afternoon’s Wednesday practice neared an end, Joe was determined to strike up a conversation with Kathryn and ask her out. He really wanted to impress her, so he thought he’d ask her a really hard history of math question that she didn’t know. Naturally, she’d want the answer, and be so impressed with Joe’s brilliance that she’d go out with him on Friday night.
Great plan. Seriously.
When Joe asked Kathryn after class, “Who was the mathematician that died in approximately $200$ B.C. that developed a method for calculating all prime numbers?” Kathryn gave the correct response. What name did she say?
Can be colored the positive integers with 2009 colors if we know that each color paints infinitive integers and that we can not find three numbers colored by three different colors for which the product of two numbers equal to the third one?
Does there exists a base in which the numbers of the form:
\[ 10101, 101010101, 1010101010101,\cdots \]
are all prime numbers?
Let $p>3$ be a prime number. The natural numbers $a,b,c, d$ are such that $a+b+c+d$ and $a^3+b^3+c^3+d^3$ are divisible by $p$. Prove that for all odd $n$, $a^n+b^n+c^n+d^n$ is divisible by $p$.
A prime number $p > 2$ and $x,y \in \left\{ 1,2,\ldots, \frac{p-1}{2} \right\}$ are given. Prove that if
$x\left( p-x\right)y\left( p-y\right)$ is a perfect square, then $x = y$.
Palmer correctly computes the product of the first $1,001$ prime numbers. Which of the following is NOT a factor of Palmer's product?
$\text{(A) }2,002\qquad\text{(B) }3,003\qquad\text{(C) }5,005\qquad\text{(D) }6,006\qquad\text{(E) }7,007$
A sequence $(a_n)_{n \in N}$ of squares of nonzero integers is such that for each $n$ the difference $a_{n+1} - a_n$ is a prime or the square of a prime. Show that all such sequences are finite and determine the longest sequence.
We say that the prime numbers $p_1,\dots,p_n$ construct the graph $G$ if we can assign to each vertex of $G$ a natural number whose prime divisors are among $p_1,\dots,p_n$ and there is an edge between two vertices in $G$ if and only if the numbers assigned to the two vertices have a common divisor greater than $1$. What is the minimal $n$ such that there exist prime numbers $p_1,\dots,p_n$ which construct any graph $G$ with $N$ vertices?
Fix a sequence $ a_1,a_2,a_3,... $ of integers satisfying the following condition:for all prime numbers $ p $ and all positive integers $ k $, we have $ a_{pk+1}=pa_k-3a_p+13 $.Determine all possible values of $ a_{2013} $.
Let $p\ge 5$ be a prime number. Prove that there exist positive integers $m$ and $n$ with $m+n\le \frac{p+1}{2}$ for which $p$ divides $2^n\cdot 3^m-1.$
The prime number $p > 2$ and the integer $n$ are given. Prove that the number $pn^2$ has no more than one divisor $d$ for which $n^2+d$ is the square of the natural number.
.
a) Let $1, 2, 3, 5, 6, 7, 10, .., N$ be all the divisors of $N = 2\cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31$ (the product of primes $2$ to $31$) written in increasing order. Below this series of divisors, write the following series of $1$’s or $-1$’s: write $1$ below any number that factors into an even number of prime factors and below a $1$, write $-1$ below the remaining numbers. Prove that the sum of the series of $1$’s and $-1$’s is equal to $0$.
b) Let $1, 2, 3, 5, 6, 7, 10, .., N$ be all the divisors of $N = 2\cdot 3 \cdot 5 \cdot 7 \cdot 11 \cdot 13 \cdot 17 \cdot 19 \cdot 23 \cdot 29 \cdot 31 \cdot 37$ (the product of primes $2$ to $37$) written in increasing order. Below this series of divisors, write the following series of $1$’s or $-1$’s: write $1$ below any number that factors into an even number of prime factors and below a $1$, write $-1$ below the remaining numbers. Prove that the sum of the series of $1$’s and $-1$’s is equal to $0$.
Can you find five prime numbers $p, q, r, s, t$ such that $p^3+q^3+r^3+s^3 =t^3$?
The acute angles of a right triangle are $a^{\circ}$ and $b^{\circ}$, where $a>b$ and both $a$ and $b$ are prime numbers. What is the least possible value of $b$?
$\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }5\qquad\textbf{(D) }7\qquad\textbf{(E) }11$
Let $C(n)$ be the number of prime divisors of a positive integer $n$.
(a) Consider set $S$ of all pairs of positive integers $(a, b)$ such that $a \ne b$ and $C(a + b) = C(a) + C(b)$.
Is $S$ finite or infinite?
(b) Define $S'$ as a subset of S consisting of the pairs $(a, b)$ such that $C(a+b) > 1000$. Is $S'$ finite or infinite?
Find all pairs $(x, y)$ of natural numbers $x$ and $y$ such that $\frac{xy^2}{x+y}$ is a prime
Let be a finite group $ G $ that has an element $ a\neq 1 $ for which exists a prime number $ p $ such that $ x^{1+p}=a^{-1}xa, $ for all $ x\in G. $
[b]a)[/b] Prove that the order of $ G $ is a power of $ p. $
[b]b)[/b] Show that $ H:=\{x\in G|\text{ord} (x)=p\}\le G $ and $ \text{ord}^2(H)>\text{ord}(G). $
Find all triplets $(x,y,p)$ of positive integers such that $p$ be a prime number and $\frac{xy^3}{x+y}=p$
Find all positive integers \(n\) such that among the \(n\) numbers
\[ 2n + 1, \, 2^2 n + 1, \, \ldots, \, 2^n n + 1 \]
there are \(n\), \(n - 1\), or \(n - 2\) primes.
Determine if there exist prime numbers $ p_{1},p_{2},...,p_{2007}$ such that $ p_{2}|p_{1}^{2}\minus{}1,p_{3}|p_{2}^{2}\minus{}1,...,p_{1}|p_{2007}^{2}\minus{}1$.