Skip to main content
Notice removed Authoritative reference needed by CommunityBot
Bounty Ended with no winning answer by CommunityBot
Notice added Authoritative reference needed by Đào Thanh Oai
Bounty Started worth 100 reputation by Đào Thanh Oai
Commonmark migration
Source Link

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

 

Let three positive integers $a, b, c$ with $\gcd(a,b)=\gcd(b,c)=\gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

 

Stronger conjecture: Let two positive integers $a, b$ with $\gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

 

Let three positive integers $a, b, c$ with $\gcd(a,b)=\gcd(b,c)=\gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

 

Stronger conjecture: Let two positive integers $a, b$ with $\gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

Let three positive integers $a, b, c$ with $\gcd(a,b)=\gcd(b,c)=\gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

Stronger conjecture: Let two positive integers $a, b$ with $\gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

Notice removed Authoritative reference needed by CommunityBot
Bounty Ended with no winning answer by CommunityBot
Notice added Authoritative reference needed by Đào Thanh Oai
Bounty Started worth 50 reputation by Đào Thanh Oai
MathJax: \gcd
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

Let three positive integers $a, b, c$ with $gcd(a,b)$$=gcd(b,c)$$=gcd(c,a)=1$$\gcd(a,b)=\gcd(b,c)=\gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

Stronger conjecture: Let two positive integers $a, b$ with $gcd(a,b)=1$$\gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

Let three positive integers $a, b, c$ with $gcd(a,b)$$=gcd(b,c)$$=gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

Stronger conjecture: Let two positive integers $a, b$ with $gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

Let three positive integers $a, b, c$ with $\gcd(a,b)=\gcd(b,c)=\gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

Stronger conjecture: Let two positive integers $a, b$ with $\gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

added 62 characters in body; edited title
Source Link

Are there at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$? (was checked up to $10^{18}$)

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

Let three positive integers $a, b, c$ with $gcd(a,b)$$=gcd(b,c)$$=gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

Stronger conjecture: Let two positive integers $a, b$ with $gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

Are there at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$?

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

Let three positive integers $a, b, c$ with $gcd(a,b)$$=gcd(b,c)$$=gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

Stronger conjecture: Let two positive integers $a, b$ with $gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Relative question:

See also:

Are there at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$? (was checked up to $10^{18}$)

Given a positive integer $P>1$, let its prime factorization be written $$P=p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$

Define the functions $h(P)$ by $h(1)=1$ and $h(P)=\min(a_1, a_2,\ldots,a_k)$

Is the follows property true or false?

Let three positive integers $a, b, c$ with $gcd(a,b)$$=gcd(b,c)$$=gcd(c,a)=1$ then at least one of $a$, $b$, $c$, $a+b$, $b+c$, $c+a$ have h(P) $\le 3$

Stronger conjecture: Let two positive integers $a, b$ with $gcd(a,b)=1$ then at least one of $a$, $b$, $a+b$ have h(P) $\le 3$ (proposed a year ago)

Note that the stronger conjecture is true up to $10^{18}$ (by Yaakov Baruch)

Relative question:

See also:

deleted 5 characters in body
Source Link
Loading
added 128 characters in body
Source Link
Loading
added 128 characters in body
Source Link
Loading
Source Link
Loading