Questions on congruences, linear diophantine equations, greatest common divisor, divisibility, etc.

learn more… | top users | synonyms

3
votes
2answers
72 views

$\sqrt{\frac{15}{11}}$ continued fraction

I know how to find a continued fraction representation of rationals and quadratic irrationals, but I'm not sure how to proceed with square roots of rationals. For example, I want to know how to get: ...
4
votes
3answers
293 views

How does one attack a divisibility problem like $(a+b)^2 \mid (2a^3+6a^2b+1)$?

In my current line of investigation, I am running into [many] divisibility questions like the one in the title, i.e. $$ (a+b)^2 \mid (2a^3+6a^2b+1), \qquad(\star) $$ where $a > b \ge 1$ are ...
5
votes
5answers
168 views

The number $(3+\sqrt{5})^n+(3-\sqrt{5})^n$ is an integer

Prove by induction that this number is an integer: $$u_n=(3+\sqrt{5})^n+(3-\sqrt{5})^n$$ Progress I assumed that it holds for $n$ and I tried to do it for $n+1$ but the algebra gets quite messy and ...
0
votes
0answers
15 views

What are some [mostly trivial] Pell transformations?

Euler looked at some transformations which turned one Pell[-type] equation into another. Example 1: $$u^2-av^2=-1 \quad\iff\quad (2u^2+1)^2-a(2uv)^2=1.$$ Example 2: $$u^2-av^2=-2 \quad\iff\quad ...
1
vote
0answers
16 views

Proof of the formula for the number of components in all partitions of a given number

I have to show that this formula is the number of components in all partitions of number $n$: $$\sum_{i=1}^{n}\sum_{j=1}^{[n/i]}\sum_{k=0}^{n-ij}A_i(k) \cdot A_{j-1}(n-ij-k)$$ $A_k(n)$ is number of ...
0
votes
1answer
28 views

Find the general solution to diophantine equation $-221x + 187y - 493 = 0$

I have to find the general solution to $$-221x + 187y - 493 = 0$$ The main issue, I'm figuring out if I have found the general solution or not. Below, are my steps: The $\gcd{(-221,187)} = 17$ and ...
1
vote
1answer
34 views

solve the diophantine equation: $x^3-3xy^2=z^3$

Let $ x,y,z$ be 3 integers greater than 1,if $x$ and $y$ are relatively prime, solve the diophantine equation: $x^3-3xy^2=z^3$.
3
votes
3answers
47 views

Raising $2$ to the power of $2014^ {2013}$ modulo $41$

The question is as follows: $$2^{{2014}^{2013}}$$ Determine its remainder by division with $41$. I know that I need to use $\bmod 41$ and reduce the power somehow to something that can be solved ...
1
vote
1answer
43 views

When is a sum of products of positive powers of 2 and 3 divisible by $2^b-3^n$?

Here we have a really tough exercise. Find all natural solution: $$\frac{\sum\limits_{k=1}^n 2^{a_k} 3^{n-k}}{c}+3^n=2^{b} ,\quad b\geq a_n; \quad a_k, b, c ,n\in \mathbb N $$ Any ideas, hints?
2
votes
2answers
60 views

Solution of an equation involving even integers

If $x$ is any positive even integer $> 1$. I compute: $$ c = x + x! $$ Now assume instead $c$ (even integer) is given, and I want to get back the value $x$. Is it possible to find a simple ...
0
votes
1answer
214 views

How to determine whether a number can be written as a sum of two squares?

I know the following theorems: A number can be represented as a sum of two squares precisely when $N$ is of the form $n^2 \prod p_i$ where each $p_i$ is a prime congruent to 1 mod 4 If the equation ...
1
vote
3answers
50 views

Simplifying radical expressions such as $\sqrt{80}$

I am having trouble simplifying a radical expression, such as say...$\sqrt{80}$. What I do is firstly, I do 80/2, then 80/3, then 80/4, then 80/5...etc until I find the largest number that can be ...
0
votes
1answer
20 views

If $a\equiv b [p^k]$ then $a^p \equiv b^p [p^{k+1}]$

Can anyone explain the steps to this proof? I'm really lost/ If $k\geq 1$ and $a\equiv b[p^k]$ then $a^p \equiv b^p [p^{k+1}]$ Proof: Since $a= b + qp^k$ for some $q\in \mathbb{Z}$ we have $a^p = ...
2
votes
4answers
83 views

Proving congruence modulo, number theory

The task is to prove $24^{31}\equiv 23^{32}\pmod {19}$. I'm trying to use Fermat's little Theorem and so far I only found that $24^{31}\equiv 19\pmod{19}$. Would proving that $17\mid23^{32}$ prove ...
0
votes
2answers
85 views

General question about undergrad math classes? [on hold]

I'm currently in Real Analysis 2, and while I'm doing pretty well, it's just so much time and effort to finish all the problem sets and do well on the exams. I only have a few math classes left for ...
1
vote
3answers
38 views

Transcendental Union Algebraic = Irrational?

It is true that $\mathbb{R} = \mathbb{Q} \bigcup \overline{\mathbb{Q}}$ where $\mathbb{R}$ is the set of real numbers, $\mathbb{Q}$ is the set of rational numbers, and $\overline{\mathbb{Q}}$ is the ...
40
votes
5answers
1k views
+50

Prime as sum of three numbers whose product is a cube

Good evening! I am very new to this site. I would like to put the following materiel from Prof. Gandhi's note book and my observations. Of course it is little long with more questions. But, with good ...
1
vote
3answers
39 views

If $x$ leaves remainder $2$ when divided by $8$, what will the remainder be when $x + 9$ is divided by $8$?

If the positive integer $x$ leaves a remainder of $2$ when divided by $8$, what will the remainder be when $x + 9$ is divided by $8$? I love to put stuff into algebraic equations to make life ...
3
votes
2answers
222 views

A number is a perfect square if and only if it has odd number of positive divisors

I believe I have the solution to this problem but post it anyway to get feedback and alternate solutions/angles for it. For all $n \in \mathrm {Z_+}$ prove $n$ is a perfect square if and only if $n$ ...
2
votes
1answer
24 views
+50

What's the formula for the fixed point of a power tower of $2$s modulo $n$?

e.g., $n = 3$. Clearly, the powers of $2$ modulo $3$ alternate $2, 1$. The powers of $4$ modulo $3$ are all $1$s. So a power tower of $2$s modulo $3$ must get stuck on $1$. Of course this method is ...
1
vote
1answer
51 views

Show that there are infinitely many integers $n$ with a given number of divisors

Show that there are infinitely many integers $n$ with a given number of divisors, but at most finitely many $n$ with a given sum of divisors. Sorry no useful attempt this time, any help on ...
1
vote
1answer
56 views

Find $n$ between $100$ and $1000$ so that $2^n+2$ is divisible by $n$

Find $n$ such that $n$ divides $2^n + 2$. Also, $n$ should be between $100$ and $1000$. It can be easily seen that $n$ is not a multiple of $4$. By brute force I have figured out that answer is ...
1
vote
1answer
20 views

“Descent” on binary quadratic forms?

Let's say I have the Diophantine equation $$ x^2+3n^2 = y^2+3z^2. \tag{$\star$} $$ where $n$ is a known integer, and we're trying to determine solutions in integers $x,y,z \ge 1$. Rewrite ($\star$) ...
7
votes
4answers
381 views

There are finitely many maps on nonnegative integers satisfying $\phi(ab)=\phi(a)+\phi(b)$

How to show that there are finitely many maps $\phi:\mathbb{N}\cup\{0\}\to \mathbb{N}\cup\{0\}$ with the property that $\phi(ab)=\phi(a)+\phi(b)$ for all $a,b\in \mathbb{N}\cup\{0\}$.
0
votes
0answers
30 views

Explanation of a proof of the existence of reclusive primes

The goal is to prove: For any given number $N$, there exists a prime number that is at least $N$ greater than the previous prime number and at least $N$ smaller than the following one. We call those ...
3
votes
3answers
85 views

How to prove that $\frac{a+b}{2} \geq \sqrt{ab}$ for $a,b>0$?

I am reading a chapter about mathematical proofs. As an example there is: Prove that: $$(1) \space\space\space\space\space\space\space\space\space\space\space \frac{a+b}{2} \geq \sqrt{ab}$$ for ...
0
votes
1answer
27 views

Value of an iterated sum

I am interested in the number of function evaluations required to numerically evaluate an iterated integral of the form $$ \int_0^t \int_{t_1}^t \cdots \int_{t_{n-1}}^t f(t_1,\ldots,t_n) dt_n\cdots ...
1
vote
1answer
50 views

Order of $\{x\in\mathbb {Z}, |x|+|3x-1|<5\}$

There is a multiple choices which says what is the order of $\{x\in\mathbb {Z}, |x|+|3x-1|<5\}$? a. 1 b. 3 c. 2 d. empty I know that by considering certain cases, for example when $x<0$ or ...
1
vote
3answers
45 views

Subgroup of matrices exercise

Let $G=\{\left( \begin{array}{ccc}1 & b \\ 0 & a \\ \end{array} \right) : a,b \in \mathbb Z_7, a \neq 0\}$. Find the order of $G$. For each prime $p$ such that $p$ divides $|G|$, find all ...
1
vote
1answer
24 views

Even numbers and Euler's Totient Function

If $m$ is even, $m|r$ and $\phi (r) \leq \phi (m)$, prove that $r=m$. I only knew the converse is also true $\phi (r) \geq \phi (m)$ but i dont know how the condition $m$ is even is gonna help, ...
3
votes
2answers
124 views

Evaluation of the sum $\sum_{i=1}^{\lfloor na \rfloor} \left \lfloor ia \right \rfloor $

Let $a$ be a positive proper fraction and $n$ is any integer then evaluate the following sum, $$\sum_{i=1}^{\left \lfloor na \right \rfloor\atop} \left \lfloor ia \right \rfloor $$ I think that ...
9
votes
1answer
193 views

Can $p^{q-1}\equiv 1 \pmod {q^3}$ for primes $p<q$?

For prime $q$ can it be that $$ p^{q-1}\equiv 1 \pmod{q^k} $$ for some prime $p<q$ and for $k\ge 3$? There doesn't seem to be a case with $k=3$ and $q<90000$, and I also checked for small ...
4
votes
4answers
69 views

Find the sum of the multiples of $3$ and $5$ below $709$?

I just cant figure this question out: Find the sum of the multiples of $3$ or $5$ under $709$ For example, if we list all the natural numbers below $10$ that are multiples of $3$ or $5$, we get $3$, ...
1
vote
2answers
45 views
1
vote
2answers
389 views

twin prime conjecture

Whether I am correct or wrong I don't know. If there are any corrections, please let me know. Let $p_n$ = product of all primes. (of course we can go still beyond as we know $p_n$ is infinite). Now ...
0
votes
2answers
40 views

Count the integers between $20000$ and $30000$ that end in $39$, and end in $33$ in base $4$, and end in $37$ in base $8$

How I can calculate the integers between $20000$ and $30000$ that end in $39$, and end in $33$ in base $4$, and end in $37$ in base $8$. I think that I have to solve the system of congruences: ...
3
votes
3answers
116 views

Infinitude of prime numbers

Everyone knows that there is an infinitude of primes. I know the Euclide, the Euler and the Erdos proofs. But are they the only known proofs ? I will try, here, to present a fourth one : Let the ...
5
votes
4answers
355 views

Solutions to $p+1=2n^2$ and $p^2+1=2m^2$ in Natural numbers.

$$p+1=2n^2$$$$p^2+1=2m^2$$ Find positive integers $m,n$ and prime $p$ satisfying the above two equations. What would people commonly do? Subtracting both the equations. You get: ...
3
votes
0answers
65 views

Looking for help with this elementary method of finding integer solutions on an elliptic curve.

In the post Finding all solutions to $y^3 = x^2 + x + 1$ with $x,y$ integers larger than $1$, the single positive integer solution $(x,y)=(18,7)$ is found using algebraic integers. In one of the ...
1
vote
0answers
19 views

Powerful numbers in Pell solutions (or, more generally, any Lucas sequence)

There are several definitive results regarding perfect powers in the Pell numbers — e.g., the only perfect power is $P_7=169=13^2$. On the other hand, when it comes to powerful numbers, I've only ...
0
votes
0answers
17 views

Solving a recurrence relation with absolute values in it.

The recurrence relation is: Let $\{y_{j}\}_{j\in \mathbb{N}}$ be a sequence of integers and x a real number then define: $P_{1}(x):=y_{1}+(-1)^{1}|x-y_{1}|$ and the general j-step as ...
0
votes
1answer
26 views

The number of ways to form $1110€$ using $45$ notes of $20€$ and $18$ notes of $50€$

Let 45 notes of 20€ and 18 notes of 50€, how many different forms we can have 1110€? I don't know write the congruence, I had thought the following: $$45 x \equiv 1110 \pmod{20}$$ $$18 x \equiv ...
2
votes
1answer
35 views

The number of divisors of any positive number $n$ is $\le 2\sqrt{n}$

How to prove that the number of divisors of any positive number $n$ is $\le 2\sqrt{n}$? I have started something like below: $$ n^{\tau(n)/2} = \prod_{d|n} d$$ But not getting ideas on how to ...
1
vote
2answers
342 views

Can this primality test be optimized to runs in polynomial time?

Theorem : Let $k$ be positive integer such that : $k \in [1,\lfloor \sqrt p \rfloor ]$ $\binom{p}{k} \equiv 0 \pmod p$ for all $k$ iff $p$ is a prime number . Test written in Maple : ...
1
vote
0answers
40 views

Given a Pell “solution” in [integer] polynomials, what can be said about the components?

Let $x,y$ be integers, and $f(x,y)$, $g(x,y)$, and $h(x,y)$ be polynomials in $x$ and $y$ with integer coefficients such that $$ f(x,y)^2 - g(x,y)h(x,y)^2 = 1. \qquad(\star) $$ Furthermore, assume it ...
1
vote
1answer
170 views

Why isn't $1$ a superior highly composite number?

A superior highly composite number is a positive integer $n$ for which there is an $\epsilon>0$ such that $\dfrac{d(n)}{n^\epsilon} \geq \dfrac{d(k)}{k^\epsilon}$ for all $k>1$, where the ...
10
votes
5answers
2k views

Disproving the claim that the numbers 1+2+4, 1+2+4+8, 1+2+4+8+16… alternate between prime and composite

I am working through an elementary number theory book and I have come across the following problem. Show the following claims are wrong: Claim 1: The sequence 1+2+4, 1+2+4+8, 1+2+4+8+16, ...
1
vote
3answers
141 views

How to prove $~(c - b) ^ 2 + 3cb = x^3~$ has no nonzero integer solutions?

I'm trying solve: $~a^3 + b^3 = c^3~$ has no nonzero integer solutions. Only one problem left: because $c^3 - b ^ 3 = (c - b)((c - b) ^ 2 + 3cb) = a ^ 3,\quad (1)$ if $~c-b~$ is a cubic number, ...
3
votes
2answers
40 views

A sum of difference of floors

I have the sum ( $M$ is any integer $> 1$ ): $$ \sum_{h = 1}^{M}\left(\,\left\lfloor\, 2M + 1 \over h\,\right\rfloor -\left\lfloor\, 2M \over h\,\right\rfloor\,\right) $$ and looking for a way to ...
6
votes
3answers
77 views

The number of positive integers whose digits are all $1$, $3$, or $4$, and add up to $2k$, is a perfect square

I have been stuck on this question for a pretty long time. My teacher says that we should find a small pattern, but I can't find one. Can anyone give me a hand? Let $b_n$ be the number of ...