0
votes
0answers
32 views

Induction and Maximum Principle

I wish to show that the following two assertions are equivalent: (Principle of Mathematical Induction) Let $S$ be a nonempty subset of the set of non-negative integers satisfying the following two ...
2
votes
5answers
2k views

Is it true that $n^2+3n+13$ is prime for all $n\in\mathbb ℤ^+$?

Prove or disprove the statement: If $n\in\mathbb ℤ^+$, then $n^2+3n+13$ is prime. I am lost here. All I know is that $n$ is greater than or equal to one, since it is a positive integer.
0
votes
0answers
44 views

Proving that $3 = 9^{-1} \pmod{26}$

Prove that $3$ is the multiplicative inverse of $9 \pmod {26}$ $$\quad26\quad1\quad0\\2\quad9\quad0\quad1\\\;\;1\quad8\quad1\quad{-2}\\\quad\;1\quad-1\quad3$$ Hence $3$ is the multiplicative inverse ...
6
votes
2answers
102 views

$\gcd(a,b)$ compared to $\gcd(3a,b)$

$\gcd(a,b)=\gcd(3a,b)$? They are obviously not equal in general, as $\gcd(ax, bx)=|x|\gcd(a,b)$.
0
votes
2answers
50 views

Pair of positive integers in product sums

I am still not sure on this answer. I would like someone to help me see the solution to his question. I was working on it for a while and it is the only question that I looked at that I can not ...
0
votes
0answers
37 views

Using jugs filled with water problem

Given jugs $m$ and $n$ liters (WLOG $m<n$) is it always possible to get all $i$, $0 \leq i \leq n ?$ If so, prove it. If not, explain which $i$ you can get. Is there also a minimum number ...
0
votes
0answers
36 views

Prove for all whole numbers n, $(n+1)(n+2)…(2n-1)(2n)=2^n(1)(3)(5)…(2n-1)$ [duplicate]

Prove for all whole numbers n, $(n+1)(n+2)...(2n-1)(2n)=2^n(1)(3)(5)...(2n-1)$. I got upto $(2n)(2n-2)(2n-4)...=2^n$, after which I'm stuck.
6
votes
0answers
117 views

Seeking help extending Vieta-jumping to higher powers

I am trying to prove the following conjecture. Conjecture. If $r > s \ge 1$ are relatively prime integers such that \begin{equation} (r-s)^4-1 \equiv 0\!\pmod{4r^2s}, \tag{1} \end{equation} ...
2
votes
4answers
83 views

Prove that $133$ divides $11^{n+1} + 12^{2n−1}$ for all $n > 1$? [duplicate]

I have tried this question so hard but still stuck here. It seems like easily provable if all $n$ are all positive numbers but in this question, the $n$ is bigger than $1$. original question : prove ...
2
votes
1answer
85 views

Proving a set of numbers has arithmetic progressions of arbitrary length, but none infinite

For each real number $x$, let $[x]$ be the largest integer less than or equal to $x$. For example, $$[5] = 5$$ $$[7.9] = 7,$$ and $$[−2.4] = −3.$$ An arithmetic progression of length $k$ is a ...
2
votes
1answer
66 views

Prove $ x^n-1=(x-1)(x^{n-1}+x^{n-2}+…+x+1)$

So what I am trying to prove is for any real number x and natural number n, prove $$x^n-1=(x-1)(x^{n-1}+x^{n-2}+...+x+1)$$ I think that to prove this I should use induction, however I am a bit stuck ...
1
vote
1answer
38 views

If $n$ is any positive integer whose last digit is $5$, then $5$ divides $n$

Prove that if n is any positive integer whose last digit is a 5, then 5|n Therefore, n is going to be 5, 15, 25, 35 etc ... b∣a states that 'b divides a' and we know that 5∣5, 5∣15, 5∣25, 5∣35 ...
0
votes
3answers
51 views

Completion of this proof

Suppose $$\forall m \in \Bbb N : \exists k \in \Bbb N : 5^m +1 =k^3$$ $$\Rightarrow 5^m = k^3 -1$$ $$ \Rightarrow 5^m = (k -1) (k^2+k +1)$$ Since $5^m$ is a power of 5 both $(k-1)$ and $(k^2+k ...
0
votes
0answers
42 views

A question related to the Descartes-Frenicle-Sorli conjecture on odd perfect numbers

Good day to everyone! I apologize in advance for the somewhat long post, but I had to put in all the details into a single question to communicate what I believe to be a viable approach to odd ...
1
vote
2answers
49 views

Discrete Mathmatics Proof

Here is the question: $a$ and $b$ are any two integers. $c$ is any prime. Prove that if $c$ divides $ab$, then $c$ divides $a$ or $c$ divides $b$ (or both, as in it can divide either or both, i.e. ...
1
vote
1answer
60 views

Proof by contradiction: logarithm

I need to prove by contradiction that $\log_2(3)$ is irrational. I'm really unfamiliar with logs to be honest, it's been awhile since I've done them and I'm unsure of how to approach this. Any help ...
5
votes
5answers
792 views

Proof of infinitely many primes, clarification

Proof: The proof is by contradiction. Suppose there are only finitely many primes. Let the complete list be $p_1,p_2,\dots,p_n$. Let $N = p_1p_2 \dots p_n+1$. According to the Fundamental Theorem of ...
2
votes
5answers
69 views

Proof regarding divisibility

if $n\in\mathbb{Z}$, then $4$ does not divide $(n^2 - 3)$ I'm not sure how to approach this question, I know how to do questions that involve proving that it does divide but I'm unsure of how to do ...
1
vote
3answers
65 views

Proof for modulus via direct or contrapositive

I have to prove the following via direct proof or via contra positive. For $a,b\in \mathbb{Z} $ it follows that $ (a+b)^3 \equiv a^3 + b^3 \mod 3$ I'm unsure of the best way to approach this ...
1
vote
0answers
41 views

What is the relationship between division and proving an integer is odd?

I am trying to use proof by contradiction to prove: $101$ is an odd integer. I know that the first step is to assume that $101$ is even, so: $101 = 2q, q \in \mathbb{Z}$ Then I am stuck. I don't ...
0
votes
0answers
44 views

Proof by Induction for Fundamental Thm of Arithmetic

Use induction to make our proof of the Fundamental Theorem of Arithmetic more rigorous. Recall that $p$ is prime iff for all $a,b\in\mathbb Z:p\mid(ab)$ implies $p\mid a$ or $p\mid b$. Prove that ...
1
vote
3answers
63 views

Use induction to prove that $2^n$ divides $(2n)!$ for any $n\in\mathbb{Z}_{\geq0}.$ [duplicate]

Use induction to prove that $2^n$ divides $(2n)!$ for any $n\in\mathbb{Z}_{\geq0}.$ How would you do the inductive step for this proof? I have the base case done.
1
vote
2answers
52 views

Proving $2^x$ is only ever 9 less than a perfect square for a unique value of x

I am trying to prove something that has essentially boiled down to proving that $9 + 2^x$ will only ever be a perfect square for the unique value of x=4, and that no other value will produce a perfect ...
5
votes
5answers
570 views

Positive integers expressable as sums of powers of 2

I need to prove that any positive integer is expressable as $$x=2^{j_0}+2^{j_1}+2^{j_2}+...+2^{j_m}$$ where $m\ge 0$ and $0\le j_0\lt j_1\lt j_2\lt ... \lt j_m. $ I think I get the gist of the proof; ...
2
votes
6answers
102 views

Investigating the linearity between squares and their roots

I recently noticed that $\sqrt{128} = 11.31$ and that $128$ is $\approx 30\%$ between $121 = 11^2$ and $144=12^2$, that is: $$ \frac{128-121}{144-121} = \frac{7}{23} \approx 30\%$$ and $\sqrt{128} = ...
1
vote
2answers
64 views

Ground Plan - Prove Fermat-Euclid's Totient Theorem with Lagrange's Theorem

If $\gcd(a,n) = 1$, then $a^{\phi(n)}\equiv 1\pmod n$. Here's a three-step proof. An integer a is invertible means there's some $a^{-1}$ such that $aa^{-1}\equiv 1 \pmod n$. By cause of Jones p84 ...
4
votes
2answers
169 views

Fermat's Little Theorem fails for composite instead of prime numbers.

I know Fermat's Little Theorem = Fermat-Euler's Totient Theorem when $n$ is prime. Elementary Number Theory, Jones, p83 writes if we simply replace p with a composite integer n, then the ...
2
votes
1answer
69 views

Backward direction – Wilson’s Theorem – p is prime $\iff (p-1)!\equiv-1(mod\ p) $.

(1) How can you preconceive to prove by contradiction? Prove by contradiction. Suppose $n$ is composite. This means there exists a divisor $d|n$ such that $1<d<n$. We are given that ...
1
vote
2answers
47 views

Ground Plan – Forward direction – Wilson’s Theorem – p is prime $\iff (p-1)!\equiv-1(mod\ p) $.

Lemma 5.3 - I omit proof here - Let p be prime. Then $x^2 \equiv 1 \, (mod p) \iff x \equiv \pm 1 \; (mod p)$ First we establish the result for the first two primes 2, 3. Then prove the result for ...
3
votes
1answer
91 views

Ground plan of Forward direction - Let $p$ be an odd prime. Prove $x^{2} \equiv -1 \; (mod \, p)$ has a solution $\iff p\equiv 1 \; (mod 4)$

Prove by contradiction. Thence suppose NOT $p\equiv 1 \; (mod 4)$. Thence 3 possibilities remain: $4|p, 4|(p - 2), 4|(p - 3)$. But $p > 2$ is prime, thence $4 \not | p$. (1) How can you ...
3
votes
1answer
171 views

Ground plan of Backward direction (<=) - Let $p$ be an odd prime. Prove $x^{2} \equiv -1 \; (mod \, p)$ has a solution $\iff p\equiv 1 \; (mod 4)$

Apply the identity $p-i \equiv -i \mod p$ for $i=1, \ldots$ to the pink factors $ \begin{align} \color{seagreen}{ (p-1)! } = 1\times 2\times\cdots\times \dfrac{p-1}{2} & \times \quad ...
0
votes
1answer
31 views

Let $a$ and $b$ be coprime positive integers. Prove that, for any integer $n$, there exist integers $s$ and $t$ such that $sa + tb = n$

I always sort of took this fact for (well..) fact. Can someone help me with the proof? Does this question have something to do with modulus? Since $a$ and $b$ are coprime ($gcd$ = 1), multiplying ...
2
votes
2answers
80 views

Proving that repeating decimals can be rewritten as fractions without using infinite series

I'm being asked to prove that all repeating decimals can be written as fractions. The catch is that I'm not allowed to use infinite series, so that excludes most if not all methods I've seen so far. ...
1
vote
1answer
48 views

Chinese Remainder Theorem - Ground Plan of Existence Proof

Let $n_{1},\ n_{2},\ n_{3},\ \cdots,\ n_{r}$ be positive integers such that $\gcd(n_{i}, n_{j})=1$ for $1 \le \quad i\neq j \quad \le r$ Then the simultaneous linear congruences $ x\equiv a_i \pmod ...
2
votes
3answers
41 views

Prove that if m is prime and m|kl then either m|k or m|l.

Proofs homework question, here's what I've figured out thus far. Suppose m doesn't divide k. We need to then prove that m|l. If m doesn't divide k and m is a prime then we know m and k are co-prime ...
0
votes
4answers
58 views

How to prove that if a number is divisible by two other numbers, then it is divisible by there product

I would like to prove if $a \mid n$ and $b \mid n$ then $a \cdot b \mid n$ for $\forall n \ge a \cdot b$ where $a, b, n \in \mathbb{Z}$ I'm stuck. $n = a \cdot k_1$ $n = b \cdot k_2$ $\therefore a ...
0
votes
3answers
23 views

Let $a$ be a positive integer. The sum of $a$ consecutive integers is divisible by $a$ if and only if $a$ is odd.

How would one prove this? Other than using cases to prove the if and only if part, how would I prove each case to complete the proof?
0
votes
3answers
110 views

How to prove if $n$ is prime and $n | a^2$ then $n | a$?

My professor assigned this for homework but I don't understand how to connect the dots. He suggested using the fact that $\gcd (x,y) \cdot \operatorname{lcm} (x,y) = xy$ but I'm not sure how that's ...
2
votes
1answer
123 views

Prove $\gcd(ka,kb) = k*\gcd(a,b)$

For all $k > 0,\ k\in \Bbb Z$ . Prove $$\gcd(k*a,\ k*b) = k *\gcd(a,\ b)$$ I think I understand what this wants but I can't figure out how to set up a formal proof. These are the guidelines we ...
2
votes
1answer
138 views

Proof - Fundamental Theorem of Arithmetic using Euclid's Lemma

Let $n \in Z > 1$. Then the expression for $n$ as the product of $\ge 1$ primes is unique, up to the order in which they appear. From Proofwiki. Suppose $n$ has two prime factorizations: ...
2
votes
1answer
54 views

Linear Congruence Theorem - Are these solutions too? Where'd they hail from?

(1) Can't the signs - I colored them in red - of x and y be switched? Aren't $x = x_0 - bn/d$ and $y = y_0 + an/d$ also solutions? They satisfy $ax + by = c$? (2) How can I remember these ...
0
votes
3answers
41 views

Divisibility proof by induction.

$ 169$ | $3^{3n+3}-26n-27$ ? Fulfilled for $n=0$. Induction to $n+1$: An integer $x$ exists so that $ 169x= 3^{3n+6}-26n-27-26$ $ 169x= 27*3^{3n+3}-26n-27-26$ $ 169x= 26*3^{3n+3}+3^{3n+3}-26n-27-26$ ...
0
votes
1answer
57 views

How to show that if $ p \equiv 1,3 \pmod 8$ then there exists a $u,v \in \mathbb Z: u^2 + 2v^2 = p$

I'm trying to show this statement: $$p \equiv 1,3 \pmod 8, \; \; \exists \; u,v \in \mathbb Z : u^2 + 2 v^2 = p.$$ I believed I proved it the other direction using the ring $\mathbb Z{\sqrt{-2}}$. ...
0
votes
1answer
65 views

Proving $\left\lfloor n\frac{\log (b)}{\log (a)}\right\rfloor =\left\lfloor \frac{\log \left(b^n+1\right)}{\log (a)}\right\rfloor$

Inspired by this question, I'd like to know how one would go about proving the below more general equation? $$n \in \mathbb{N},\;a \in \mathbb{N},\;b \in \mathbb{N}$$ $$b^n+1 \notin ...
1
vote
2answers
66 views

Prove that a pair of irrational numbers is the solution to a quadratic polynomial.

Suppose a, b are two irrational numbers such that ab is rational and a+b is rational. Then a, b are the solution to a quadratic polynomial with integer coeffecients.
2
votes
2answers
36 views

Prove that for all integers $n\geq 2, n^3+1>n^2+n$

I am attempting this by induction. Base case $2^3+1 >2^2+2 \implies 8>6,$ which is true. Now the induction step $(n+1)^3+1>(n+1)^2+(n+1),$ which simplifies to $n^3+3n^2+3n+2 > n^2+3n+2.$ ...
0
votes
0answers
47 views

Is it a surjection?

Consider the sequence given by $u_1=2$ and $u_{n+1}=\{\min k: \gcd (k,u_n)>1$ and $k$ has not appread in the sequence before} Show that the this sequence is surjective on $N\setminus \{1\}$ I ...
1
vote
4answers
26 views

If $a$ and $b$ are odd, prove $\gcd(a,b) = \gcd(\frac {\left| {a-b} \right |} {2}, b)$

Honestly I don't have a strong idea. I don't know where to even begin, I have considered that the $\gcd(a,b)$ is somehow less than $a-b$, but I'm not even sure why that would be the case.. Any help ...
1
vote
3answers
171 views

If $\gcd(a, b) = 1$ and if $ab = x^2$, prove that $a, b$ must also be perfect squares; where $a,b,x$ are in the set of natural numbers

Problem: If $\gcd(a, b) = 1$ and If $ab = x^2$ ,prove that $a$, $b$ must also be perfect squares; where $a$,$b$,$x$ are in the set of natural numbers I've come to the conclusion that $a \ne b$ and ...
3
votes
2answers
122 views

Intuition — If $k \in \mathbb{Z}$ and $n \ge 2$, then the n$^{th}$ root of k is either an integer or irrational.

Origin — Elementary Number Theory — Jones — p25 — Exercise 2.4 (1) How do you prefigure the answer? Proofwiki start after prefiguring it. (2) What's the intuition? This answer ...