As the question title suggests, is $n^7 - 77$ ever a Fibonacci number, where $n$ is a integer?
2026-03-29 06:02:24.1774764144
Is $n^7 - 77$ ever a Fibonacci number?
1.7k Views Asked by user352685 https://math.techqa.club/user/user352685/detail At
1
There are 1 best solutions below
Related Questions in ALGEBRA-PRECALCULUS
- How to show that $k < m_1+2$?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Finding the value of cot 142.5°
- Why is the following $\frac{3^n}{3^{n+1}}$ equal to $\frac{1}{3}$?
- Extracting the S from formula
- Using trigonometric identities to simply the following expression $\tan\frac{\pi}{5} + 2\tan\frac{2\pi}{5}+ 4\cot\frac{4\pi}{5}=\cot\frac{\pi}{5}$
- Solving an equation involving binomial coefficients
- Is division inherently the last operation when using fraction notation or is the order of operation always PEMDAS?
- How is $\frac{\left(2\left(n+1\right)\right)!}{\left(n+1\right)!}\cdot \frac{n!}{\left(2n\right)!}$ simplified like that?
- How to solve algebraic equation
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in ELEMENTARY-NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- How do I show that if $\boldsymbol{a_1 a_2 a_3\cdots a_n \mid k}$ then each variable divides $\boldsymbol k $?
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- Algebra Proof including relative primes.
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
- algebraic integers of $x^4 -10x^2 +1$
- What exactly is the definition of Carmichael numbers?
- Number of divisors 888,888.
Related Questions in CONTEST-MATH
- Solution to a hard inequality
- Length of Shadow from a lamp?
- All possible values of coordinate k such that triangle ABC is a right triangle?
- Prove that $1+{1\over 1+{1\over 1+{1\over 1+{1\over 1+...}}}}=\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+...}}}}$
- Lack of clarity over modular arithmetic notation
- if $n\nmid 2^n+1, n|2^{2^n+1}+1$ show that the $3^k\cdot p$ is good postive integers numbers
- How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$
- Proving that $b-a\ge \pi $
- Volume of sphere split into eight sections?
- Largest Cube that fits the space between two Spheres?
Related Questions in FIBONACCI-NUMBERS
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
- Fibonacci Numbers Proof by Induction (Looking for Feedback)
- Fibonacci sequence and golden ratio
- Induction proof of Fibonacci numbers
- Fibonacci sequence and divisibility.
- Fibonacci numbers mod $p$
- A proof regarding the Fibonacci Sequence.
- Congruencies for Fibonacci numbers
- Is every $N$th Fibonacci number where $N$ is divisible by $5$ itself divisible by $5$
- Proof involving Fibonacci number and binomial coefficient
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The fibonacci sequence goes as follows:
$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|c|c|c|} F_n &1&1&2&3&5&8&13&21&34&55&89&144&233&377&610&987\\ F_n\pmod{29}&1&1&2&3&5&8&13&21&5 &26&2&28&1&0&1&1\end{array}$
It is clear that the cycle will repeat for $F_n\pmod{29}$ as we reached again a point where it is two ones in a row.
So, the set of possible values modulo $29$ that a fibonacci number can be is $\{0,1,2,3,5,8,13,21,26,28\}$
On the other hand, $n^7\pmod{29}$ can only ever be $0,1,12,17,28$ by fermat's little theorem.
Thus, $n^7-77$ can only ever be one of $\{9,10,11,22,27\}$
We see that the set of possible values of $n^7-77\pmod{29}$ does not intersect the set of possible values of $F_n\pmod{29}$, therefore no solutions exist.