a) Find n such that n is the least positive integer >= 1000
where 7 is a prime factor of SMn.
b) Find n such that n is the least positive integer where 7, 11, and 13 are all prime factors of SMn.
c) Find n such than n is the least positive integer >= 1000 where 101 is a prime factor of SMn.
(I solved with a QuickBasic program.)
The administrator has disabled public write access.
Posted 1 Year, 3 Months ago
cosmoschaos
Senior Boarder
Posts: 66
S
P
O
I
L
E
R
I hope these are correct, I did it rather quickly with sloppy code... =)
A) 1003 744 C) 10073
Anyone else get the same? Different?
The administrator has disabled public write access.
Posted 1 Year, 3 Months ago
kdavis004
Senior Boarder
Posts: 67
1000 where 7 is a prime factor of SMn.<<
where 7, 11, and 13 are all prime factors of SMn.<<
1000 where 101 is a prime factor of SMn.<<
sloppy code... =)<
I get the same solutions you got for a) & b), Jeromy.
I get different for c).
I get 10073 + a number less than half of 101.
Bob
x x x x x x x x x x x x
The administrator has disabled public write access.
Posted 1 Year, 3 Months ago
Duane
Senior Boarder
Posts: 70
Argh! Seems my big numbers package has a problem multiplying that huge number by a 6 digit number... See down below for my new answer to C...
10073 + 50 = 10123
I 'think' that's correct now. =)
The administrator has disabled public write access.
Posted 1 Year, 3 Months ago
swasta
Senior Boarder
Posts: 75
Bob S. posted:
This can be done without a big numbers package.
The residue mod 7 (and separately mod 11, 13, and 101) of SM(n+1) can be calculated from the residue of SM(n). Doing so involves a small multiply and add, and a modulo operation. The best way I can think to describe this is to just show a little table (view with a monospace font).
+
The administrator has disabled public write access.
Posted 1 Year, 3 Months ago
imported_baz
Senior Boarder
Posts: 71
Definitely more efficient than the brute force method. Easier to implement, too.
I did this one by hand, so I am probably way wrong. I don't think I've used pen and paper in over 10 years... I got: 38,888,888,899 digits. (Below table show my logic... Looks better with monospace font)
Low Bound - High Bound = Numbers * Dg = Total Digits
The administrator has disabled public write access.
Posted 1 Year, 3 Months ago
jugherffere
Expert Boarder
Posts: 86
I get the following solutions for n, where n < 50000: