| CARVIEW |
Select Language
HTTP/2 200
date: Sun, 12 Oct 2025 03:22:11 GMT
content-type: text/html; charset=UTF-8
server: cloudflare
x-frame-options: DENY
x-content-type-options: nosniff
x-xss-protection: 1;mode=block
vary: accept-encoding
cf-cache-status: DYNAMIC
content-encoding: gzip
set-cookie: _csrf-frontend=1f31606471d00fc102cf729ff22ab4ad56c4d443f30c39d5439cad3d594d4bf7a%3A2%3A%7Bi%3A0%3Bs%3A14%3A%22_csrf-frontend%22%3Bi%3A1%3Bs%3A32%3A%22Dlt6azrrvLANAlBrs_bYVwuKypXm3VSz%22%3B%7D; HttpOnly; Path=/
cf-ray: 98d378ac9955b277-BLR
Support program for the conjecture - Pastebin.com
SHARE
TWEET
Support program for the conjecture
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Original code for A055881 by: Joerg Arndt (www.jjj.de) Dec 2012
- Sequencer adaptation for A196020 by: R. J. Cano, ( aallggoorriitthhmmuuss_at_gmail.com ), Jan 2013 */
- first_diff_mode=0;
- base=10;
- n=10; \\ Warning: n should not be greater than 10... never, if all computations are assumed in base-10;
- fc=vector(n) /* mixed radix numbers (rising factorial base) */
- ct=0; a=0; p=vector(n,k,k-1) /* permutation */
- t=0; j=0; w=#p; G=sum(y=1,w,p[y]*base^(w-y));
- updater()=
- {
- ct += 1;
- /* increment factorial number fc[]: */
- j = 1;
- while ( fc[j] == j, fc[j]=0; j+=1; ); /* scan over nines */
- if ( j==n, return() ); /* current is last */
- fc[j] += 1;
- /* update permutation p[], reverse prefix of length j+1: */
- a = j; /* next term of A055881 */
- j += 1; k = 1;
- while ( k < j,
- t=p[j]; p[j]=p[k]; p[k]=t;
- k+=1; j-=1;
- );
- H=sum(y=1,w,p[y]*base^(w-y));
- ans=(H-G)\(base-1);
- if(first_diff_mode,G=H);
- /* */
- Qq=0;
- while(ans%base==0, ans/=base; Qq++); \\ Useful for the checking of the "((p-1)!-1) Conjecture".
- \\ Below return either ans or Qq depending of the attribute you want to know for a(n): The coefficient or the power.
- /* * /
- ans;
- / * */I
- /**/
- Qq; \\ Before enabling this, ensure that first_diff_mode is set to zero!.
- /**/
- }
- if(!first_diff_mode, print("0")); for(u=1,(n!-1),print(updater()));
- quit;
Advertisement
Add Comment
Please, Sign In to add comment
-
✅ Make $2500 in 20 minutes⭐⭐⭐ E
JavaScript | 3 sec ago | 0.25 KB
-
Free Crypto Method (NEVER SEEN BEFORE)⭐⭐ X
JavaScript | 6 sec ago | 0.25 KB
-
📌 Swapzone +37% glitch ⭐ T
JavaScript | 12 sec ago | 0.25 KB
-
✅⭐ Make huge profits on trading ⭐⭐ B
JavaScript | 21 sec ago | 0.25 KB
-
⭐✅ Marketplace Glitch ✅ Working ✅ NEVER SEEN...
JavaScript | 31 sec ago | 0.25 KB
-
⭐✅ Exploit 2500$ in 15 Minutes⭐⭐⭐ O
JavaScript | 40 sec ago | 0.25 KB
-
Free Crypto Method (NEVER SEEN BEFORE)⭐⭐ 7
JavaScript | 48 sec ago | 0.25 KB
-
⭐✅ Swapzone Glitch ✅ Working ⭐⭐ P
JavaScript | 57 sec ago | 0.25 KB
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
