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

learn more… | top users | synonyms

13
votes
0answers
409 views

Prove that the product of some numbers between perfect squares is $2k^2$

Here's a question I've recently come up with: Prove that for every natural $x$, we can find arbitrary number of integers in the interval $[x^2,(x+1)^2]$ so that their product is in the form of ...
12
votes
0answers
171 views

Is there an elementary proof that $\sum_{n=1}^\infty {1\over n^s\{n\pi\}}<\infty$ for some $s>0$?

For $x\in\mathbb R$, let $\{x\} = x-\lfloor x\rfloor$ be the fractional part of $x$. I'm searching for an elementary proof that there exists a positive real number $s$ such that $$ \sum_{n = 1}^\infty ...
11
votes
0answers
399 views

A very nice divisibility problem

A very hard problem, here it is: Prove that, if $2^{2^j} a + 1$ divides $c^{2^j}+1$ for fixed integers $a,c$ and all nonnegative integers $j$, then $a=1$ and $c=2^l$ for some odd positive integer ...
11
votes
0answers
553 views

Are there unique solutions for $n=\sum_{j=1}^{g(k)} a_j^k$?

Edward Waring, asks whether for every natural number $n$ there exists an associated positive integer s such that every natural number is the sum of at most $s$ $k$th powers of natural numbers ...
8
votes
0answers
237 views

A question about the divisibility of sum of 2 consecutive primes.

Well as I was curious about the sum of $2$ consecutive primes, after proving that the sum for the odd primes always has at least 3 prime divisors, I came up with this question: Find the least ...
8
votes
0answers
373 views

Understanding Ramanujan's approach in his proof of Bertrand's Postulate

I've been reading through Ramanujan's proof of Betrand's Postulate and I'm not clear why he didn't state his proof in terms of $\varphi(2x) - \varphi(x)$ What would be wrong with this approach for ...
8
votes
0answers
538 views

How many integer solutions to a diophantine equation

Starting with the equation: $\frac{1}{a}+\frac{1}{b}=\frac{p}{10^n}$, I reached the equation: $10^{n-log(p)} = \frac{ab}{a+b}$. Now given the positive integer $n$, for what integer values of $p$ ...
8
votes
0answers
172 views

How many numbers of the form $p_1^2 p_2 p_3$ are there less than $10^{15}$ for $p_1$, $p_2$, $p_3$ distinct primes?

Is there an easy way to compute the following question: How many numbers of the form $p_1^2 p_2 p_3$ are there less than $10^{15}$ for $p_1$, $p_2$, $p_3$ distinct primes? The only thing that ...
7
votes
0answers
103 views

Twelve Distinct Positive Integers

Let S be a set of twelve distinct positive integers such that for distinct a, b, c, and d in S, a + b ≠ c + d. Show that the largest element in S is greater than 56. I found some math competition ...
7
votes
0answers
66 views

Which digit occurs most often?

Is there any method to calculate, which digit occurs most often in the number $$4 \uparrow \uparrow \uparrow \uparrow 4\ ,$$ the fourth Ackermann-number ? Or would it be necessary to calculate the ...
7
votes
0answers
172 views

Prove that Bezout's coefficients given by the extended Euclidean algorithm are minimal in absolute value

Bezout's lemma states that if a and b are integers, and at least one of them is non-zero, then there exist integers $x, y$ such that $$ax + by = gcd(a, b)$$ One way of finding such a pair $(x, y)$ is ...
7
votes
0answers
142 views

Is there some exact form of $n$ for the number of $(i,j,k)$ satisfying $ijk = (n-i)(n-j)(n-k)$

For any positive integer $n$, $i,j,k$ are also positive integers, and $0 <i,j,k < n$. How many solutions of the form $(i,j,k)$ are there for the equation $ijk = (n-i)(n-j)(n-k)$?
6
votes
0answers
59 views

infinitely many

It is well known that there are infinitely many positive integers $n$ such that $2^n+1$ is divisible by $n$. Also it is well known that there exist infinitely many positive integers $n$ such that ...
6
votes
0answers
66 views

Does there exist a positive $k$ s.t. for all $r\geq k$, “$\sigma_r(m)<\sigma_r(n)$ for every $m<n$” for infinitely many odd positive integers $n$?

Does there exist a positive real $k$ such that for all real $r\geq k$, "$\sigma_r(m)<\sigma_r(n)$ for every $m<n$" for infinitely many odd positive integers $n$? $\sigma_r(n)$ is the sum of the ...
6
votes
0answers
248 views

IMO 1979 problem

The question is $$If\, p,q\in \mathbb{N}, \;1-\frac12+\frac13-\frac14-\dotsb-\frac{1}{1318}+\frac{1}{1319}=\frac{p}{q}.\qquad Prove \,that\, 1979|p.$$ So my solution went like this: ...
6
votes
0answers
97 views

number of quadratic residues modulo n

Define $f(n)$ to be the number of quadratic residues modulo $n$. I would like to show that $f$ is multiplicative, that is, for any positive integers $m,n > 1$, $f(mn) = f(m)f(n)$ whenever $(m,n) = ...
6
votes
0answers
106 views

Twin Prime Powers

What are all the possible triplets of numbers $a$, $b$, $c$ such that $a+2=b$, $a+4=c$, and all $3$ are prime powers (where one must be a power of $3$)? I'm aware of the cases for when they are ...
6
votes
0answers
96 views

What is the Gauss sum equivalent of $\Gamma(s+1) = s\Gamma(s)$?

Gauss sums are analogous to the Gamma function: fix a complex number $s$ with real part $>0$. Then we have a multiplicative character $\chi_s :\mathbf R^{\times}_{>0} \to \mathbf C^\times$ given ...
6
votes
0answers
152 views

An infinitude of “congruence condition” primes?

Background: Several special classes of primes can be written as primes that satisfy some additional constraint $f(p)\equiv 0\pmod p$; for instance, Wilson primes are congruence primes with ...
6
votes
0answers
278 views

A conjecture about mersenne primes and non-primes

Latest Edit: My hypothesis is simply that A056295(n) are spread around some smooth curve and higher than the curve if M(n) is a non-prime (and perhaps also even higher yet if M(n) has many factors ...
6
votes
0answers
204 views

Diophantine special problem

This is my another question on Diophantine equations. Prove the following great and special problem. Let $D$ and $k$ be positive integers and $p$ be a prime number such that $gcd(D, kp) = 1$. Prove ...
6
votes
0answers
311 views

On the equation $m^3-m^2+1 = n^2$

(i) How can I find all positive integers $m$ such that $m\equiv 4 \pmod 7$ and $m^3-m^2+1$ is a perfect square? (ii) Is there a method to solve this equation over positive integers: $$m^3-m^2+1 = ...
5
votes
0answers
22 views

Problems that are made easy by using p-adic numbers

Does anybody know of elementary problems that can be be solved using the p-adics? Solutions are preferred.
5
votes
0answers
67 views

What is known about the solutions to $\varphi(a)+\varphi(b)=\varphi(a+b)$?

As of late I have been researching Euler's Totient function. For the last week or so I have specifically been studying the equation: $\varphi(a)+\varphi(b)=\varphi(a+b)$ While the equation ...
5
votes
0answers
35 views

My first proof that uses the well-ordering principle (very simple number theory). Please mark/grade.

What do you think about my first proof that uses the well-ordering principle? Please mark/grade. Theorem The sum of the cubes of three consecutive natural numbers is a multiple of 9. Proof ...
5
votes
0answers
28 views

Inverse image of rationals under tangent function is free abelian?

It is easy to see that the set $\{x:\tan x\in \Bbb Q \,\, or\,\, \pm\infty\}$ forms a group under addition. It is a free abelian group?
5
votes
0answers
74 views

What should be taught about the reciprocity law for high school gifted student

This autumn I have to teach a mini course for a small group of high school student (mathematical gifted class) on Quadratic Reciprocity Law (3 lectures in ten hours). This is the requirement of the ...
5
votes
0answers
131 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 ...
5
votes
0answers
163 views

How to partition $S$ in this way?

Assume: $$ P =\{p_1,p_2,\cdots,p_K\}\subset \{1,2,\dots,N\},\quad |P| = K, \qquad x \in \mathbb{R}_+^K , \qquad w = e^{-j\frac{2\pi}N} $$ and, $$ f(l) = \sum_{i=1}^K \sum_{j=1}^K x_i x_j ...
5
votes
0answers
202 views

Maximum length of sequence of non-coprimes of $N$ - least upper bound for Jacobsthal's function

I am looking at the length of the longest sequences of adjacent integers that are not coprime to $N$ for very large $N$. Let $F_N$ be the set of integers less than $N$ which are not coprime with $N$: ...
5
votes
0answers
101 views

Best upper bound on the number of divisors of $n$ that are larger than $N$.

I am looking for the best upper bound on $$\sum_{\substack{d | n\\ d \geq N}} 1.$$ I know that $$ d(n) = \sum_{\substack{d | n}} 1 \leq e^{O(\frac{\log n}{\log \log n})}. $$ For my application, I ...
5
votes
0answers
117 views

divisibility by powers of $2$ of diagonal sums of infinite latin square

This array is formed by placing integers such that each is the smallest such that the rectangle with it and the top left hand corner as opposite corners does not contain the same integer twice in any ...
5
votes
0answers
147 views

Carmichael number factoring

The task I'm faced with is to implement a poly-time algorithm that finds a nontrivial factor of a Carmichael number. Many resources on the web state that this is easy, however without further ...
5
votes
0answers
333 views

Digital Numbers using all digits from 1-9

Call a number a digital number if it consists of all the digits from 1-9, each used exactly once. What is the probability that a digital number will be divisible by 7 ? What is the probability that a ...
5
votes
0answers
125 views

Question about a proof on p70 in Cassels' Local Fields

I'm trying to read the proof of COROLLARY. The only solutions of $x^2+7=2^m$ ($x,m \in \mathbb{Z}$) (6.15) have $m=3,4,5,7,15$. I don't see why there could be a + in $y\pm \alpha$ ...
5
votes
0answers
483 views

The Average Running Time Of Euclid Algorithm?

What is the average running time of Euclid Algorithm with respect to all possible input pairs $(m,n)$ such that $\gcd(m,n) = d$? It seems very hard to deduce from the recurrence $T(m,n) = T(n, m ...
4
votes
0answers
119 views

Consider the equation $b^n=a^b$, where $a,b,n\in \mathbb{N}^{\ast}$

DISCLAIMER: This is a self-made problem, and I don't know if there's a nice solution. Hi, here's a conjecture I have for you; I'm not seeing the "simple" solution (at least for part (a)) at the ...
4
votes
0answers
92 views

start studying advanced topics in number theory

I am a first year undergrad and have had elementary course in Number Theory which includes only basic introductory topics like: divisibility,gcd-lcm,primes,congruences, number theoretic functions etc. ...
4
votes
0answers
83 views

If $p$, $q$ are naturals, solve $p^3-q^5=(p+q)^2$.

In If $p,q$ are prime, solve $p^3-q^5=(p+q)^2$., the author asks to solve the equation $x^3-y^5=(x+y)^2$ for primes $p$ and $q$. A proof is given that $p=7, q=3$ is the only solution. In this ...
4
votes
0answers
62 views

Intersection between OEIS-A050808 and OEIS-A080053

Is there any result on the intersection between A050808 and A080053: OEIS-A080053 = 1, 2, 4, 5, 6, 10,... (Exp(n) is further from an integer than any previous exp(k)) OEIS-A050808 = 1, 2, 18, ...
4
votes
0answers
96 views

On odd perfect numbers $N$ given in the Eulerian form $N = {q^k}{n^2}$

Note: This question was cross-posted from MO. Preamble: I apologize in advance if this particular MSE post would appear to be a bit of a polymath approach, I just had to put down all the details to ...
4
votes
0answers
299 views

Can $\sigma_4(n)$ be a square number?

Denote $\sigma_k(n)=\sum_{d\mid n}d^k,$ then $$\sigma_1(3)=2^2,\sigma_2(42)=50^2,\sigma_3(2)=3^2,$$ and both $\sigma_1(345)$ and $\sigma_3(345)$ are square numbers: ...
4
votes
0answers
74 views

The number of solutions of $ax^4 - by^4 \equiv 1$ (mod $p$) for a prime of the form $p = 4n + 1$

Weil writes in his paper "The number of solutions of equations in finite fields" that Gauss finds the number of solutions of $ax^4 - by^4 \equiv 1$ (mod $p$) for a prime of the form $p = 4n + 1$ in ...
4
votes
0answers
95 views

Prove that $\sqrt[3] {3n^2+3n+1} \notin \mathbb{N^+}$ given that $n \in \mathbb{N^+}$

I need to prove that, assuming $n \in \mathbb{N^+}$ $$\sqrt[3] {3n^2+3n+1} \notin \mathbb{N^+}$$ I'm really stuck with this problem, because so far I haven't managed a clever way to solve it. Also, ...
4
votes
0answers
77 views

Pairwise sums are equal

The distinct positive integers $a_1,a_2,...,a_n,b_1,b_2,...,b_n$ with $n\ge2$ have the property that the $\binom{n}2$ sums $a_i+a_j$ are the same as the $\binom{n}2$ sums $b_i+b_j$ (in some order). ...
4
votes
0answers
74 views

Regarding identities with sums of consecutive squares

This comic http://abstrusegoose.com/63 points out an interesting identity with sums of consecutive squares. Let us take positive integers $k, p, q$, with $p < q$, and ask if $k^2 + \ldots + (k + ...
4
votes
0answers
194 views

What is the catch in this geometrical/number theory question?

Here is a simple geometrical construction: $CA \perp x$ and $DE \perp OC$ As a result: $\bigtriangleup CDE \cong \bigtriangleup CAO$, because $\angle CDE=\angle CAO=\frac{\pi }{2}$ and $\angle ECD$ ...
4
votes
0answers
242 views

Period of decimal for $1/n$, odd part of $n+1$, and primes.

Let $n$ be a nature number is coprime to $10$,such that the period of the decimal expansion of $1/n$ is a divisor of $n-1$, and let $c$ be the "cycle length of $n$" (defined below). If $n-1=2^xc$ ...
4
votes
0answers
87 views

Generalizing Ramanujan's 6-10-8 Identity

Let $ad=bc$. Then Ramanujan's 6-10-8 Identity is the bizarre, $$64[(a+b+c)^6+(b+c+d)^6-(c+d+a)^6-(d+a+b)^6+(a-d)^6-(b-c)^6][(a+b+c)^{10}+(b+c+d)^{10}-(c+d+a)^{10}-(d+a+b)^{10}+(a-d)^{10}-(b-c)^{10}] ...
4
votes
0answers
66 views

$\{a^{k_1}\}=\{a^{k_2}\}=\{a^{k_3}\}$

Let $a\in\mathbb{R}\setminus\mathbb{Z}$. Prove that there not exist three distinct $k_1, k_2, k_3\in\mathbb{N}$ such that $\{a^{k_1}\}=\{a^{k_2}\}=\{a^{k_3}\}\neq 0$, where $\{x\}=x-\lfloor x ...