# Some expression you may have seen before but not in this manner

For each positive integer $n$, let $a_n = 2^n + 3^n + 6^n - 1$. Find all positive integers $m$ where $m such that $gcd(m,a_n)=1$ for all positive integers $n$. Note by Sharky Kesa
5 years, 9 months ago

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

• Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
• Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
• Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$ ... $$ or $ ... $ to ensure proper formatting.
2 \times 3 $2 \times 3$
2^{34} $2^{34}$
a_{i-1} $a_{i-1}$
\frac{2}{3} $\frac{2}{3}$
\sqrt{2} $\sqrt{2}$
\sum_{i=1}^3 $\sum_{i=1}^3$
\sin \theta $\sin \theta$
\boxed{123} $\boxed{123}$

Sort by:

For every positive integer $n$ there will be I think there would infinitely many $m$ as:-

$\large{a_{n}=(2^{n}+1)(3^{n}+1)-2}$

We see that for all $n$ the sequence Input will be even and there will be infinitely many $m$ which will satisfy it.

Sharky Kesa , If I am wrong somewhere please enlighten me.

Well after the editing of question done by Sharky Kesa , I believe there will be no specific answer for any $n$ because there is no specific pattern for $a_{n}$, the Euler's Totient Function of $a_{n}$ will keep changing, by using wolfram alpha.

- 5 years, 9 months ago

Sorry, I forgot to mention that it was for all positive integers $n$.

- 5 years, 9 months ago

I think this will also give infinity until you mention $m$ is a positive integer less than $n$

- 5 years, 9 months ago

Sorry once more. Edited.

- 5 years, 9 months ago

Can you help me find the no. of factors of $(2^{n}+1)(3^{n}+1)$

- 5 years, 9 months ago

I think for a more general ans. let's try putting values.

- 5 years, 9 months ago

I've seen this problem before, so I already know the answer. :\ Nevertheless, I'll post a solution here.

We will prove that $m = 1$ is the only such integer. Let $p$ be a prime number. If we prove that there exists an $n$ such that $p|a_n$, we are done, since that means $m$ can't have any prime factors, so it is equal to 1.

First, $2, 3|48 = a_2$. Now, let's assume $p > 3$. Then,

\begin{aligned} 6a_{p - 2} &\equiv 6(2^{p - 2} + 3^{p - 2} + 6^{p - 2} - 1) \\ &\equiv 3(2^{p - 1}) + 2(3^{p - 1}) + 6^{p - 1} - 6 \\ &\equiv 3 + 2 + 1 - 6 \\ &\equiv 0 \pmod{p}. \end{aligned}

So, $p|6a_{p - 2}$. Since $p$ is not 2 or 3, we must have $p|a_{p - 2}$, and our proof is complete.

- 5 years, 9 months ago

Please tell me whether I am right or not I used Wolfram Alpha to check this out.

- 5 years, 9 months ago

IMO 2005? O.o

- 4 years, 8 months ago