added 16 characters in body

Source Link

edited Jan 18 at 20:01

vengy

2.3k
7
30

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

An integer \$n\$ wheresuch that \$3 \leq n \leq 50 \$.

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in integer format.

Test Cases

For \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

\$n\$ where \$3 \leq n \leq 50 \$

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in integer format.

Test Cases

For \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

An integer \$n\$ such that \$3 \leq n \leq 50 \$.

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in integer format.

Test Cases

For \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

updated limits for n

Source Link

edited Jan 18 at 19:55

vengy

2.3k
7
30

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

\$n\$ where \$3 \leq n \leq 50 \$

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in integer format.

Test Cases

For \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

\$n\$

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in integer format.

Test Cases

For \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

\$n\$ where \$3 \leq n \leq 50 \$

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in integer format.

Test Cases

For \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

minor edits to tidy up question

Source Link

edited Jan 18 at 12:54

vengy

2.3k
7
30

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

\$n\$

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in the form of an exact integer format.

Test Cases

For test cases \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

Test Cases

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

\$n\$

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in the form of an exact integer.

For test cases \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

Test Cases

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

Challenge

Generate \$n-1\$ consecutive composite numbers using this prime gap formula

$$n!+2,n!+3,...,n!+n$$

Input

\$n\$

Output

Sequence of \$n-1\$ consecutive composite numbers.

Example

Input

Output

8
9

Rules

Output should be in integer format.

Test Cases

For \$n > 20\$, the results are very BIG integers (greater than 64-bits) and will most likely require a language that natively supports large numbers or a 3rd party library to handle them.

n	\$n-1\$ consecutive composites
3	8 9
5	122 123 124 125
21	51090942171709440002 51090942171709440003 51090942171709440004 51090942171709440005 51090942171709440006 51090942171709440007 51090942171709440008 51090942171709440009 51090942171709440010 51090942171709440011 51090942171709440012 51090942171709440013 51090942171709440014 51090942171709440015 51090942171709440016 51090942171709440017 51090942171709440018 51090942171709440019 51090942171709440020 51090942171709440021

deleted 54 characters in body

Source Link

edited Jan 18 at 12:49

vengy

2.3k
7
30

Loading

Added rules: Output should be in the form of an exact integer, without any decimal or floating-point representation.

Source Link

edited Jan 18 at 12:36

vengy

2.3k
7
30

Loading

Became Hot Network Question

occurred Jan 18 at 7:11

add a note about large numbers

Source Link

edited Jan 18 at 0:09

vengy

2.3k
7
30

Loading

added 8 characters in body

Source Link

edited Jan 18 at 0:01

vengy

2.3k
7
30

Loading

oops, n-1 not n

Source Link

edited Jan 17 at 23:46

vengy

2.3k
7
30

Loading

added lower bound test case

Source Link

edited Jan 17 at 23:13

vengy

2.3k
7
30

Loading

Source Link

asked Jan 17 at 23:08

vengy

2.3k
7
30

Loading

Stack Exchange Network

Return to Question

Challenge

Example

Rules

Test Cases

Challenge

Example

Rules

Test Cases

Challenge

Example

Rules

Test Cases

Challenge

Example

Rules

Test Cases

Challenge

Example

Rules

Test Cases

Challenge

Example

Rules

Test Cases

Challenge

Example

Rules

Test Cases

Test Cases

Challenge

Example

Rules

Test Cases

Challenge

Example

Rules

Test Cases