Odd numbers with $varphi(n)/n < 1/2$
$begingroup$
The topic was also discussed in this MathOverflow question.
From $varphi(n)/n = prod_{p|n}(1-1/p)$ (Euler's product formula) one concludes that even numbers $n$ must have $varphi(n)/n leq 1/2$ because the product contains the factor $1/2$ and cannot be larger than that.
But not all odd numbers have $varphi(n)/n > 1/2$. The smallest number that hasn't is $105$.
You can see the exceptions as bright stars when plotting $varphi(n)/n$ on a square spiral (where odd and even numbers build a checkerboard pattern), but only, when $varphi(n)/n > 1/2$:
I wonder if and how one could enumerate or characterize all odd numbers for which $varphi(n)/n < 1/2$.
This is how one could proceed: Start with an empty list. Determine the smallest square-free odd number $n$ with $varphi(n)/n < 1/2$ which is not on the list and add it to the list together with its odd multiples. Then find the next, and the next, and so on. The list starts with
$105 = 3cdot 5 cdot 7$ and its odd multiples $315, 525, 735,...$
$165 = 3cdot 5 cdot 11$ and its odd multiples $495,825,1155,...$
$195 = 3cdot 5 cdot 13$ and its odd multiples $195,585,975,1365,...$
These numbers can be seen as white stars (above).
Then a jump occurs:
$3,003 = 3cdot 7 cdot 11 cdot 13$ and its odd multiples $9009, 15015, 21021, ...$
$3,927 = 3cdot 7 cdot 11 cdot 17$ and its odd multiples $11781, 19635, 27489 ...$
$4,389 = 3cdot 7 cdot 11 cdot 19$ and its odd multiples $13167, 21945, 30723, ...$
$4,641 = 3cdot 7 cdot 13 cdot 17$ and its odd multiples $13923, 23205, 32487, ...$
$5,187 = 3cdot 7 cdot 13 cdot 19$ and its odd multiples $15561, 25935, 36309, ...$
$5,313= 3cdot 7 cdot 11 cdot 23$ and its odd multiples $15939, 26565, 37191, ...$
The four smallest of these numbers can be seen as yellow stars (above).
Then the numbers $3 cdot 5 cdot 17 cdot p$ follow for $23 leq p leq 251$, the largest one being $64,005$.
Then a larger jump occurs:
$138,567 = 3cdot 11 cdot 13 cdot 17 cdot 19 $
Note that in the first group of numbers (divisible by $3$ and $5$) all differences are multiples of $30 = 2cdot 3 cdot 5$. That's because all numbers are multiples of $15$ and the even multiples are omitted. In the second
group (divisible by $3$ and $7$) all differences are multiples of $42 = 2cdot 3 cdot 7$.
There are several questions related to these findings:
Are there "smallest numbers" I missed?
This question has been answered thanks to Robert Israel's link to OEIS A119433. I've edited my post accordingly.
How do I systematically find the next "smallest number"?
After ordering the first group, the maximal factor of consecutive numbers in this group is $7$, i.e. when $n_{k+1} = n_k + acdot 30$
then $1 leq a leq 7$. Furthermore, all factors $1 leq a leq 7$ do occur. I wonder why this is so and how to prove it?
What's the maximal factor for the second group?
Which other properties do odd numbers with $varphi(n)/n < 1/2$ share with even numbers? (They might be considered "quasi-even".)
elementary-number-theory prime-numbers prime-factorization totient-function
$endgroup$
|
show 15 more comments
$begingroup$
The topic was also discussed in this MathOverflow question.
From $varphi(n)/n = prod_{p|n}(1-1/p)$ (Euler's product formula) one concludes that even numbers $n$ must have $varphi(n)/n leq 1/2$ because the product contains the factor $1/2$ and cannot be larger than that.
But not all odd numbers have $varphi(n)/n > 1/2$. The smallest number that hasn't is $105$.
You can see the exceptions as bright stars when plotting $varphi(n)/n$ on a square spiral (where odd and even numbers build a checkerboard pattern), but only, when $varphi(n)/n > 1/2$:
I wonder if and how one could enumerate or characterize all odd numbers for which $varphi(n)/n < 1/2$.
This is how one could proceed: Start with an empty list. Determine the smallest square-free odd number $n$ with $varphi(n)/n < 1/2$ which is not on the list and add it to the list together with its odd multiples. Then find the next, and the next, and so on. The list starts with
$105 = 3cdot 5 cdot 7$ and its odd multiples $315, 525, 735,...$
$165 = 3cdot 5 cdot 11$ and its odd multiples $495,825,1155,...$
$195 = 3cdot 5 cdot 13$ and its odd multiples $195,585,975,1365,...$
These numbers can be seen as white stars (above).
Then a jump occurs:
$3,003 = 3cdot 7 cdot 11 cdot 13$ and its odd multiples $9009, 15015, 21021, ...$
$3,927 = 3cdot 7 cdot 11 cdot 17$ and its odd multiples $11781, 19635, 27489 ...$
$4,389 = 3cdot 7 cdot 11 cdot 19$ and its odd multiples $13167, 21945, 30723, ...$
$4,641 = 3cdot 7 cdot 13 cdot 17$ and its odd multiples $13923, 23205, 32487, ...$
$5,187 = 3cdot 7 cdot 13 cdot 19$ and its odd multiples $15561, 25935, 36309, ...$
$5,313= 3cdot 7 cdot 11 cdot 23$ and its odd multiples $15939, 26565, 37191, ...$
The four smallest of these numbers can be seen as yellow stars (above).
Then the numbers $3 cdot 5 cdot 17 cdot p$ follow for $23 leq p leq 251$, the largest one being $64,005$.
Then a larger jump occurs:
$138,567 = 3cdot 11 cdot 13 cdot 17 cdot 19 $
Note that in the first group of numbers (divisible by $3$ and $5$) all differences are multiples of $30 = 2cdot 3 cdot 5$. That's because all numbers are multiples of $15$ and the even multiples are omitted. In the second
group (divisible by $3$ and $7$) all differences are multiples of $42 = 2cdot 3 cdot 7$.
There are several questions related to these findings:
Are there "smallest numbers" I missed?
This question has been answered thanks to Robert Israel's link to OEIS A119433. I've edited my post accordingly.
How do I systematically find the next "smallest number"?
After ordering the first group, the maximal factor of consecutive numbers in this group is $7$, i.e. when $n_{k+1} = n_k + acdot 30$
then $1 leq a leq 7$. Furthermore, all factors $1 leq a leq 7$ do occur. I wonder why this is so and how to prove it?
What's the maximal factor for the second group?
Which other properties do odd numbers with $varphi(n)/n < 1/2$ share with even numbers? (They might be considered "quasi-even".)
elementary-number-theory prime-numbers prime-factorization totient-function
$endgroup$
$begingroup$
See OEIS sequence A119434 and A119433.
$endgroup$
– Robert Israel
Jan 10 at 15:38
$begingroup$
@RobertIsrael: Thanks, I've seen it. But does it help to answer my question? (Ah, I see that you are the author of this OEIS entry. Very pleased!)
$endgroup$
– Hans Stricker
Jan 10 at 15:40
$begingroup$
@RobertIsrael: I see, the second sequence answers question 1: There are lots of numbers $5,313<n<138,567$ which do qualify, the first one is $5,865 = 3cdot 5cdot 17 cdot 23$. And it may also give me hint to answer question 2.
$endgroup$
– Hans Stricker
Jan 10 at 15:48
1
$begingroup$
@HansStricker: Just wait: the smallest odd number that is not a multiple of $3$ or $5$ for which $frac{phi(n)}nltfrac12$ is $3909612711980232366109$.
$endgroup$
– robjohn♦
Jan 10 at 19:08
1
$begingroup$
@Peter: One just multiplies $left(1-frac17right)left(1-frac1{11}right)left(1-frac1{13}right)left(1-frac1{17}right)cdotsleft(1-frac1{61}right)$ until the product becomes less than $frac12$. Then compute $7cdot11cdot13cdot17cdots61$.
$endgroup$
– robjohn♦
Jan 11 at 12:12
|
show 15 more comments
$begingroup$
The topic was also discussed in this MathOverflow question.
From $varphi(n)/n = prod_{p|n}(1-1/p)$ (Euler's product formula) one concludes that even numbers $n$ must have $varphi(n)/n leq 1/2$ because the product contains the factor $1/2$ and cannot be larger than that.
But not all odd numbers have $varphi(n)/n > 1/2$. The smallest number that hasn't is $105$.
You can see the exceptions as bright stars when plotting $varphi(n)/n$ on a square spiral (where odd and even numbers build a checkerboard pattern), but only, when $varphi(n)/n > 1/2$:
I wonder if and how one could enumerate or characterize all odd numbers for which $varphi(n)/n < 1/2$.
This is how one could proceed: Start with an empty list. Determine the smallest square-free odd number $n$ with $varphi(n)/n < 1/2$ which is not on the list and add it to the list together with its odd multiples. Then find the next, and the next, and so on. The list starts with
$105 = 3cdot 5 cdot 7$ and its odd multiples $315, 525, 735,...$
$165 = 3cdot 5 cdot 11$ and its odd multiples $495,825,1155,...$
$195 = 3cdot 5 cdot 13$ and its odd multiples $195,585,975,1365,...$
These numbers can be seen as white stars (above).
Then a jump occurs:
$3,003 = 3cdot 7 cdot 11 cdot 13$ and its odd multiples $9009, 15015, 21021, ...$
$3,927 = 3cdot 7 cdot 11 cdot 17$ and its odd multiples $11781, 19635, 27489 ...$
$4,389 = 3cdot 7 cdot 11 cdot 19$ and its odd multiples $13167, 21945, 30723, ...$
$4,641 = 3cdot 7 cdot 13 cdot 17$ and its odd multiples $13923, 23205, 32487, ...$
$5,187 = 3cdot 7 cdot 13 cdot 19$ and its odd multiples $15561, 25935, 36309, ...$
$5,313= 3cdot 7 cdot 11 cdot 23$ and its odd multiples $15939, 26565, 37191, ...$
The four smallest of these numbers can be seen as yellow stars (above).
Then the numbers $3 cdot 5 cdot 17 cdot p$ follow for $23 leq p leq 251$, the largest one being $64,005$.
Then a larger jump occurs:
$138,567 = 3cdot 11 cdot 13 cdot 17 cdot 19 $
Note that in the first group of numbers (divisible by $3$ and $5$) all differences are multiples of $30 = 2cdot 3 cdot 5$. That's because all numbers are multiples of $15$ and the even multiples are omitted. In the second
group (divisible by $3$ and $7$) all differences are multiples of $42 = 2cdot 3 cdot 7$.
There are several questions related to these findings:
Are there "smallest numbers" I missed?
This question has been answered thanks to Robert Israel's link to OEIS A119433. I've edited my post accordingly.
How do I systematically find the next "smallest number"?
After ordering the first group, the maximal factor of consecutive numbers in this group is $7$, i.e. when $n_{k+1} = n_k + acdot 30$
then $1 leq a leq 7$. Furthermore, all factors $1 leq a leq 7$ do occur. I wonder why this is so and how to prove it?
What's the maximal factor for the second group?
Which other properties do odd numbers with $varphi(n)/n < 1/2$ share with even numbers? (They might be considered "quasi-even".)
elementary-number-theory prime-numbers prime-factorization totient-function
$endgroup$
The topic was also discussed in this MathOverflow question.
From $varphi(n)/n = prod_{p|n}(1-1/p)$ (Euler's product formula) one concludes that even numbers $n$ must have $varphi(n)/n leq 1/2$ because the product contains the factor $1/2$ and cannot be larger than that.
But not all odd numbers have $varphi(n)/n > 1/2$. The smallest number that hasn't is $105$.
You can see the exceptions as bright stars when plotting $varphi(n)/n$ on a square spiral (where odd and even numbers build a checkerboard pattern), but only, when $varphi(n)/n > 1/2$:
I wonder if and how one could enumerate or characterize all odd numbers for which $varphi(n)/n < 1/2$.
This is how one could proceed: Start with an empty list. Determine the smallest square-free odd number $n$ with $varphi(n)/n < 1/2$ which is not on the list and add it to the list together with its odd multiples. Then find the next, and the next, and so on. The list starts with
$105 = 3cdot 5 cdot 7$ and its odd multiples $315, 525, 735,...$
$165 = 3cdot 5 cdot 11$ and its odd multiples $495,825,1155,...$
$195 = 3cdot 5 cdot 13$ and its odd multiples $195,585,975,1365,...$
These numbers can be seen as white stars (above).
Then a jump occurs:
$3,003 = 3cdot 7 cdot 11 cdot 13$ and its odd multiples $9009, 15015, 21021, ...$
$3,927 = 3cdot 7 cdot 11 cdot 17$ and its odd multiples $11781, 19635, 27489 ...$
$4,389 = 3cdot 7 cdot 11 cdot 19$ and its odd multiples $13167, 21945, 30723, ...$
$4,641 = 3cdot 7 cdot 13 cdot 17$ and its odd multiples $13923, 23205, 32487, ...$
$5,187 = 3cdot 7 cdot 13 cdot 19$ and its odd multiples $15561, 25935, 36309, ...$
$5,313= 3cdot 7 cdot 11 cdot 23$ and its odd multiples $15939, 26565, 37191, ...$
The four smallest of these numbers can be seen as yellow stars (above).
Then the numbers $3 cdot 5 cdot 17 cdot p$ follow for $23 leq p leq 251$, the largest one being $64,005$.
Then a larger jump occurs:
$138,567 = 3cdot 11 cdot 13 cdot 17 cdot 19 $
Note that in the first group of numbers (divisible by $3$ and $5$) all differences are multiples of $30 = 2cdot 3 cdot 5$. That's because all numbers are multiples of $15$ and the even multiples are omitted. In the second
group (divisible by $3$ and $7$) all differences are multiples of $42 = 2cdot 3 cdot 7$.
There are several questions related to these findings:
Are there "smallest numbers" I missed?
This question has been answered thanks to Robert Israel's link to OEIS A119433. I've edited my post accordingly.
How do I systematically find the next "smallest number"?
After ordering the first group, the maximal factor of consecutive numbers in this group is $7$, i.e. when $n_{k+1} = n_k + acdot 30$
then $1 leq a leq 7$. Furthermore, all factors $1 leq a leq 7$ do occur. I wonder why this is so and how to prove it?
What's the maximal factor for the second group?
Which other properties do odd numbers with $varphi(n)/n < 1/2$ share with even numbers? (They might be considered "quasi-even".)
elementary-number-theory prime-numbers prime-factorization totient-function
elementary-number-theory prime-numbers prime-factorization totient-function
edited Jan 10 at 19:33
Wojowu
18.6k23172
18.6k23172
asked Jan 10 at 15:28
Hans StrickerHans Stricker
6,46443993
6,46443993
$begingroup$
See OEIS sequence A119434 and A119433.
$endgroup$
– Robert Israel
Jan 10 at 15:38
$begingroup$
@RobertIsrael: Thanks, I've seen it. But does it help to answer my question? (Ah, I see that you are the author of this OEIS entry. Very pleased!)
$endgroup$
– Hans Stricker
Jan 10 at 15:40
$begingroup$
@RobertIsrael: I see, the second sequence answers question 1: There are lots of numbers $5,313<n<138,567$ which do qualify, the first one is $5,865 = 3cdot 5cdot 17 cdot 23$. And it may also give me hint to answer question 2.
$endgroup$
– Hans Stricker
Jan 10 at 15:48
1
$begingroup$
@HansStricker: Just wait: the smallest odd number that is not a multiple of $3$ or $5$ for which $frac{phi(n)}nltfrac12$ is $3909612711980232366109$.
$endgroup$
– robjohn♦
Jan 10 at 19:08
1
$begingroup$
@Peter: One just multiplies $left(1-frac17right)left(1-frac1{11}right)left(1-frac1{13}right)left(1-frac1{17}right)cdotsleft(1-frac1{61}right)$ until the product becomes less than $frac12$. Then compute $7cdot11cdot13cdot17cdots61$.
$endgroup$
– robjohn♦
Jan 11 at 12:12
|
show 15 more comments
$begingroup$
See OEIS sequence A119434 and A119433.
$endgroup$
– Robert Israel
Jan 10 at 15:38
$begingroup$
@RobertIsrael: Thanks, I've seen it. But does it help to answer my question? (Ah, I see that you are the author of this OEIS entry. Very pleased!)
$endgroup$
– Hans Stricker
Jan 10 at 15:40
$begingroup$
@RobertIsrael: I see, the second sequence answers question 1: There are lots of numbers $5,313<n<138,567$ which do qualify, the first one is $5,865 = 3cdot 5cdot 17 cdot 23$. And it may also give me hint to answer question 2.
$endgroup$
– Hans Stricker
Jan 10 at 15:48
1
$begingroup$
@HansStricker: Just wait: the smallest odd number that is not a multiple of $3$ or $5$ for which $frac{phi(n)}nltfrac12$ is $3909612711980232366109$.
$endgroup$
– robjohn♦
Jan 10 at 19:08
1
$begingroup$
@Peter: One just multiplies $left(1-frac17right)left(1-frac1{11}right)left(1-frac1{13}right)left(1-frac1{17}right)cdotsleft(1-frac1{61}right)$ until the product becomes less than $frac12$. Then compute $7cdot11cdot13cdot17cdots61$.
$endgroup$
– robjohn♦
Jan 11 at 12:12
$begingroup$
See OEIS sequence A119434 and A119433.
$endgroup$
– Robert Israel
Jan 10 at 15:38
$begingroup$
See OEIS sequence A119434 and A119433.
$endgroup$
– Robert Israel
Jan 10 at 15:38
$begingroup$
@RobertIsrael: Thanks, I've seen it. But does it help to answer my question? (Ah, I see that you are the author of this OEIS entry. Very pleased!)
$endgroup$
– Hans Stricker
Jan 10 at 15:40
$begingroup$
@RobertIsrael: Thanks, I've seen it. But does it help to answer my question? (Ah, I see that you are the author of this OEIS entry. Very pleased!)
$endgroup$
– Hans Stricker
Jan 10 at 15:40
$begingroup$
@RobertIsrael: I see, the second sequence answers question 1: There are lots of numbers $5,313<n<138,567$ which do qualify, the first one is $5,865 = 3cdot 5cdot 17 cdot 23$. And it may also give me hint to answer question 2.
$endgroup$
– Hans Stricker
Jan 10 at 15:48
$begingroup$
@RobertIsrael: I see, the second sequence answers question 1: There are lots of numbers $5,313<n<138,567$ which do qualify, the first one is $5,865 = 3cdot 5cdot 17 cdot 23$. And it may also give me hint to answer question 2.
$endgroup$
– Hans Stricker
Jan 10 at 15:48
1
1
$begingroup$
@HansStricker: Just wait: the smallest odd number that is not a multiple of $3$ or $5$ for which $frac{phi(n)}nltfrac12$ is $3909612711980232366109$.
$endgroup$
– robjohn♦
Jan 10 at 19:08
$begingroup$
@HansStricker: Just wait: the smallest odd number that is not a multiple of $3$ or $5$ for which $frac{phi(n)}nltfrac12$ is $3909612711980232366109$.
$endgroup$
– robjohn♦
Jan 10 at 19:08
1
1
$begingroup$
@Peter: One just multiplies $left(1-frac17right)left(1-frac1{11}right)left(1-frac1{13}right)left(1-frac1{17}right)cdotsleft(1-frac1{61}right)$ until the product becomes less than $frac12$. Then compute $7cdot11cdot13cdot17cdots61$.
$endgroup$
– robjohn♦
Jan 11 at 12:12
$begingroup$
@Peter: One just multiplies $left(1-frac17right)left(1-frac1{11}right)left(1-frac1{13}right)left(1-frac1{17}right)cdotsleft(1-frac1{61}right)$ until the product becomes less than $frac12$. Then compute $7cdot11cdot13cdot17cdots61$.
$endgroup$
– robjohn♦
Jan 11 at 12:12
|
show 15 more comments
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3068771%2fodd-numbers-with-varphin-n-1-2%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3068771%2fodd-numbers-with-varphin-n-1-2%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
See OEIS sequence A119434 and A119433.
$endgroup$
– Robert Israel
Jan 10 at 15:38
$begingroup$
@RobertIsrael: Thanks, I've seen it. But does it help to answer my question? (Ah, I see that you are the author of this OEIS entry. Very pleased!)
$endgroup$
– Hans Stricker
Jan 10 at 15:40
$begingroup$
@RobertIsrael: I see, the second sequence answers question 1: There are lots of numbers $5,313<n<138,567$ which do qualify, the first one is $5,865 = 3cdot 5cdot 17 cdot 23$. And it may also give me hint to answer question 2.
$endgroup$
– Hans Stricker
Jan 10 at 15:48
1
$begingroup$
@HansStricker: Just wait: the smallest odd number that is not a multiple of $3$ or $5$ for which $frac{phi(n)}nltfrac12$ is $3909612711980232366109$.
$endgroup$
– robjohn♦
Jan 10 at 19:08
1
$begingroup$
@Peter: One just multiplies $left(1-frac17right)left(1-frac1{11}right)left(1-frac1{13}right)left(1-frac1{17}right)cdotsleft(1-frac1{61}right)$ until the product becomes less than $frac12$. Then compute $7cdot11cdot13cdot17cdots61$.
$endgroup$
– robjohn♦
Jan 11 at 12:12