Stay ahead of learning milestones! Enroll in a class over the summer!

G
Topic
First Poster
Last Poster
D1019 : Dominoes 2*1
Dattier   5
N 2 hours ago by polishedhardwoodtable
I have a 9*9 grid like this one:

IMAGE

We choose 5 white squares on the lower triangle, 5 black squares on the upper triangle and one on the diagonal, which we remove from the grid.
Like for example here:

IMAGE

Can we completely cover the grid remove from these 11 squares with 2*1 dominoes like this one:

IMAGE
5 replies
Dattier
Mar 26, 2025
polishedhardwoodtable
2 hours ago
Goes through fixed points
CheshireOrb   5
N 2 hours ago by HoRI_DA_GRe8
Source: Vietnam TST 2021 P5
Given a fixed circle $(O)$ and two fixed points $B, C$ on that circle, let $A$ be a moving point on $(O)$ such that $\triangle ABC$ is acute and scalene. Let $I$ be the midpoint of $BC$ and let $AD, BE, CF$ be the three heights of $\triangle ABC$. In two rays $\overrightarrow{FA}, \overrightarrow{EA}$, we pick respectively $M,N$ such that $FM = CE, EN = BF$. Let $L$ be the intersection of $MN$ and $EF$, and let $G \neq L$ be the second intersection of $(LEN)$ and $(LFM)$.

a) Show that the circle $(MNG)$ always goes through a fixed point.

b) Let $AD$ intersects $(O)$ at $K \neq A$. In the tangent line through $D$ of $(DKI)$, we pick $P,Q$ such that $GP \parallel AB, GQ \parallel AC$. Let $T$ be the center of $(GPQ)$. Show that $GT$ always goes through a fixed point.
5 replies
CheshireOrb
Apr 2, 2021
HoRI_DA_GRe8
2 hours ago
Unsolved NT, 3rd time posting
GreekIdiot   8
N 3 hours ago by ektorasmiliotis
Source: own
Solve $5^x-2^y=z^3$ where $x,y,z \in \mathbb Z$
Hint
8 replies
GreekIdiot
Mar 26, 2025
ektorasmiliotis
3 hours ago
n=y^2+108
Havu   6
N 3 hours ago by ektorasmiliotis
Given the positive integer $n = y^2 + 108$ where $y \in \mathbb{N}$.
Prove that $n$ cannot be a perfect cube of a positive integer.
6 replies
Havu
Today at 4:30 PM
ektorasmiliotis
3 hours ago
Valuable subsets of segments in [1;n]
NO_SQUARES   0
3 hours ago
Source: Russian May TST to IMO 2023; group of candidates P6; group of non-candidates P8
The integer $n \geqslant 2$ is given. Let $A$ be set of all $n(n-1)/2$ segments of real line of type $[i, j]$, where $i$ and $j$ are integers, $1\leqslant i<j\leqslant n$. A subset $B \subset A$ is said to be valuable if the intersection of any two segments from $B$ is either empty, or is a segment of nonzero length belonging to $B$. Find the number of valuable subsets of set $A$.
0 replies
NO_SQUARES
3 hours ago
0 replies
Fneqn or Realpoly?
Mathandski   2
N 4 hours ago by jasperE3
Source: India, not sure which year. Found in OTIS pset
Find all polynomials $P$ with real coefficients obeying
\[P(x) P(x+1) = P(x^2 + x + 1)\]for all real numbers $x$.
2 replies
Mathandski
Today at 5:46 PM
jasperE3
4 hours ago
thanks u!
Ruji2018252   2
N 4 hours ago by CHESSR1DER
find all $f: \mathbb{R}\to \mathbb{R}$ and
\[(x-y)[f(x)+f(y)]\leqslant f(x^2-y^2), \forall x,y \in \mathbb{R}\]
2 replies
Ruji2018252
Today at 5:56 PM
CHESSR1DER
4 hours ago
Functional equations
hanzo.ei   11
N Today at 5:55 PM by GreekIdiot
Source: Greekldiot
Find all $f: \mathbb R_+ \rightarrow \mathbb R_+$ such that $f(xf(y)+f(x))=yf(x+yf(x)) \: \forall \: x,y \in \mathbb R_+$
11 replies
hanzo.ei
Mar 29, 2025
GreekIdiot
Today at 5:55 PM
D1018 : Can you do that ?
Dattier   1
N Today at 5:48 PM by Dattier
Source: les dattes à Dattier
We can find $A,B,C$, such that $\gcd(A,B)=\gcd(C,A)=\gcd(A,2)=1$ and $$\forall n \in \mathbb N^*, (C^n \times B \mod A) \mod 2=0 $$.

For example :

$C=20$
$A=47650065401584409637777147310342834508082136874940478469495402430677786194142956609253842997905945723173497630499054266092849839$

$B=238877301561986449355077953728734922992395532218802882582141073061059783672634737309722816649187007910722185635031285098751698$

Can you find $A,B,C$ such that $A>3$ is prime, $C,B \in (\mathbb Z/A\mathbb Z)^*$ with $o(C)=(A-1)/2$ and $$\forall n \in \mathbb N^*, (C^n \times B \mod A) \mod 2=0 $$?
1 reply
Dattier
Mar 24, 2025
Dattier
Today at 5:48 PM
D1010 : How it is possible ?
Dattier   14
N Today at 5:30 PM by ehuseyinyigit
Source: les dattes à Dattier
Is it true that$$\forall n \in \mathbb N^*, (24^n \times B \mod A) \mod 2 = 0 $$?

A=1728400904217815186787639216753921417860004366580219212750904
024377969478249664644267971025952530803647043121025959018172048
336953969062151534282052863307398281681465366665810775710867856
720572225880311472925624694183944650261079955759251769111321319
421445397848518597584590900951222557860592579005088853698315463
815905425095325508106272375728975

B=2275643401548081847207782760491442295266487354750527085289354
965376765188468052271190172787064418854789322484305145310707614
546573398182642923893780527037224143380886260467760991228567577
953725945090125797351518670892779468968705801340068681556238850
340398780828104506916965606659768601942798676554332768254089685
307970609932846902
14 replies
Dattier
Mar 10, 2025
ehuseyinyigit
Today at 5:30 PM
Cool one
MTA_2024   11
N Mar 30, 2025 by sqing
Prove that for all real numbers $a$ and $b$ verifying $a>b>0$ . $$(n+1) \cdot b^n \leq \frac{a^{n+1}-b^{n+1}}{a-b} \leq (n+1) \cdot a^n $$
11 replies
MTA_2024
Mar 15, 2025
sqing
Mar 30, 2025
Cool one
G H J
G H BBookmark kLocked kLocked NReply
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MTA_2024
24 posts
#1 • 1 Y
Y by byron-aj-tom
Prove that for all real numbers $a$ and $b$ verifying $a>b>0$ . $$(n+1) \cdot b^n \leq \frac{a^{n+1}-b^{n+1}}{a-b} \leq (n+1) \cdot a^n $$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
vsarg
250 posts
#2
Y by
Very easy , Just use the geometric Serie Expansion

(a^(n+1) - b^(n+1)) / (a-b) = a^n + b * a^(n-1) + b^2 * a^(n-2) + ... + a * b^(n-1) + b^n

Since a > b, and Both are positive, this is > (n+1) * b^n and < (n+1) * a^n, And we are done ! Easy Peasy Lemon Squeasy as they say in Kentucky xD :blush:
This post has been edited 1 time. Last edited by vsarg, Mar 15, 2025, 10:12 PM
Reason: Many mistake for me. I edit to ffix it
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
EaZ_Shadow
1156 posts
#3
Y by
vsarg wrote:
Very easy , Just use the geometric Serie Expansion

(a^(n+1) - b^(n+1)) / (a-b) = a^n + b * a^(n-1) + b^2 * a^(n-2) + ... + a * b^(n-1) + b^n

Since a > b, and Both are positive, this is > (n+1) * b^n and < (n+1) * a^n, And we are done ! Easy Peasy Lemon Squeasy as they say in Kentucky xD :blush:

Not valid you didnt prove.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MTA_2024
24 posts
#4
Y by
vsarg wrote:
Very easy , Just use the geometric Serie Expansion

(a^(n+1) - b^(n+1)) / (a-b) = a^n + b * a^(n-1) + b^2 * a^(n-2) + ... + a * b^(n-1) + b^n

Since a > b, and Both are positive, this is > (n+1) * b^n and < (n+1) * a^n, And we are done ! Easy Peasy Lemon Squeasy as they say in Kentucky xD :blush:

EXACTLY WHY IS IT GREATER THAT $(n+1) \cdot b^n$ ?
This post has been edited 1 time. Last edited by MTA_2024, Mar 15, 2025, 10:42 PM
Reason: Miswriting
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
no_room_for_error
326 posts
#5
Y by
EaZ_Shadow wrote:
vsarg wrote:
Very easy , Just use the geometric Serie Expansion

(a^(n+1) - b^(n+1)) / (a-b) = a^n + b * a^(n-1) + b^2 * a^(n-2) + ... + a * b^(n-1) + b^n

Since a > b, and Both are positive, this is > (n+1) * b^n and < (n+1) * a^n, And we are done ! Easy Peasy Lemon Squeasy as they say in Kentucky xD :blush:

Not valid you didnt prove.

His proof is valid (and imo explained thoroughly enough).
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ohiorizzler1434
744 posts
#6
Y by
MTA_2024 wrote:
Prove that for all real numbers $a$ and $b$ verifying $a>b>0$ . $$(n+1) \cdot b^n \leq \frac{a^{n+1}-b^{n+1}}{a-b} \leq (n+1) \cdot a^n $$

bro! the middle term is a^n + a^{n-1}b + ... + b^n, so it has 11 terms made up of mixed powers of a and b. Because a>b, then the middle term is larger than (n+1)b^n. Because b<a, the middle term is less than (n+1)a^n. Easy Peasy Lemon Squeezy! Now that's rizz!



I agree! vsarg's proof is thorough and complete! Anyone who says the opposite is just a hater unwilling to embrace the fundamental property of multiplication and factorisations!
This post has been edited 1 time. Last edited by ohiorizzler1434, Mar 15, 2025, 11:59 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MTA_2024
24 posts
#7
Y by
Sorry I'm dumb, found it out myself a bit later.
I was stuck on a problem till I reached right here. Thought I was still a long way through, before realising what is the fudging problem quoting at the very beginning. $a>b$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
invisibleman
13 posts
#8
Y by
This is the natural solution above! I have an idea that is not only valid for natural numbers $n$! Let's see! Consider the function $f(x)=x^{n+1}$ on the interval $[a;b]$. If we apply Lagrange's finite growth theorem, then there is a $c$ in the interval $(a;b)$ for which $$\frac{f(b)-f(a)}{b-a}=(n+1){{c}^{n}}$$But since $$a<c<b$$we already got the problem. And we didn't have to use the abbreviated calculation formula anywhere, which is only valid for natural numbers $n$!
This post has been edited 1 time. Last edited by invisibleman, Mar 20, 2025, 8:53 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ohiorizzler1434
744 posts
#9
Y by
what the sigam? what is lagrange finite growth theorem? it does not appear in google saerch.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
invisibleman
13 posts
#10
Y by
ohiorizzler1434 wrote:
what the sigam? what is lagrange finite growth theorem? it does not appear in google saerch.

Dear friend! Maybe I didn't express myself clearly. I meant this:
https://en.wikipedia.org/wiki/Mean_value_theorem
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
vsarg
250 posts
#11
Y by
ohiorizzler1434 wrote:
MTA_2024 wrote:
Prove that for all real numbers $a$ and $b$ verifying $a>b>0$ . $$(n+1) \cdot b^n \leq \frac{a^{n+1}-b^{n+1}}{a-b} \leq (n+1) \cdot a^n $$

bro! the middle term is a^n + a^{n-1}b + ... + b^n, so it has 11 terms made up of mixed powers of a and b. Because a>b, then the middle term is larger than (n+1)b^n. Because b<a, the middle term is less than (n+1)a^n. Easy Peasy Lemon Squeezy! Now that's rizz!



I agree! vsarg's proof is thorough and complete! Anyone who says the opposite is just a hater unwilling to embrace the fundamental property of multiplication and factorisations!

Very correct Ohifrizzler thank yod for baking me up from meanies like Eazy. In Kentucky we would :moose: horse race them to seeee whos the better one.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sqing
41401 posts
#12
Y by
MTA_2024 wrote:
Prove that for all real numbers $a$ and $b$ verifying $a>b>0$ . $$(n+1) \cdot b^n \leq \frac{a^{n+1}-b^{n+1}}{a-b} \leq (n+1) \cdot a^n $$
https://math.stackexchange.com/questions/71285/series-apostol-calculus-vol-i-section-10-20-24?noredirect=1
https://math.stackexchange.com/questions/3890494/how-could-someone-conceive-of-using-this-inequality-for-this-proof?noredirect=1
Z K Y
N Quick Reply
G
H
=
a