mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2010-12-27, 13:37   #1
allasc
 
Aug 2010
SPb

428 Posts
Default Please help me find a composite number (test2)

Numbers n such that 2^(2*n)-1 = 63 (mod 3*(n+2)), 2^(n-1) == 1(mod n) and n == 6 (mod 7)

83, 293, 503, 1553, 2393, 3863, 4283, 4703, 6803, 7433, 7853, 9533, 9743, 11213, 12893, 13103, 13313, 14783, 15413, 16253

in OEIS add A173654

all elements satisfy the condition.
A141570 Primes of the form 2*3*5*7*n+83.
Our sequence is a subsequence for A141570

please help me find a pseudo-prime element of my sequence

ps verified for n<5*10^8
ps2 768440063
topic can be removed

Last fiddled with by allasc on 2010-12-27 at 14:29
allasc is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Number Composite Astronomical M281414479 PaulineEinstein Lounge 27 2018-01-24 19:28
Can 1227133513 be the only composite number matching the conditions? miket Math 5 2014-08-12 00:41
Fermat number F6=18446744073709551617 is a composite number. Proof. literka Factoring 5 2012-01-30 12:28
how do you find number of digits of a 2^n number? Unregistered Math 11 2004-11-30 22:53
How long before you found your first composite number? Bundu Data 3 2004-08-14 12:21

All times are UTC. The time now is 16:17.

Thu Nov 26 16:17:25 UTC 2020 up 77 days, 13:28, 4 users, load averages: 1.57, 1.66, 1.58

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.