PERIOD FINDING binary generator FOR QUANTOM ALGORITHM with the probalism of angular spin AND NEW QUANTOM RNDG AND PRNDG

perod finding algorithm imagine w e have numebr in bitform and numeric form we the knwo the period or iterations first a numerb genrator how to ccretae in quantom 0,1 spin then it betwnen we put 2pow n and 2 pow n-1 sow ecrea teh numebr by that but also her si teh set of in string of qunatom 0 to spin1 and 1 to spin 0 so evry qunatom number havev two values 2 pow n,k and 2 pow n,k-1 where 01 is the spin 1,0 is psin butw ecretae by quantom so we radins it nad by pie to create value cos (pie/2+... or cos npie/2 and sin (pie/2+...)oe sin npie/2 so put theses in junction of sine pie/2 nd cso pie/2 numerical binayr genrator epow cos pie/2 -1 e pow sin pie/2/e so always ths sirculatoion in tehr cirucits cofnigures so make exponnetial f(fact n,epow cos pie/2 -1)y f(fact n ,epow sin pie/2/e) functioor implsce of factor m factoralnthen multiplyy pien hwo would work factiral 2 .1 =1.1.1 then mdlao by we grab all 0 and and 1 pie/2 euqla then ethen w efind 0 smae we find 1 111111111 nwo fixed the values f(f(fact n,epow cos pie/2 -1),f(fact m ,epow sin pie/2/e))all zero oe si grab by then exchnage with factorial n and co way will inetrchneg to make bit whenn the bit is ready how factorial will drive to telll it wil happepns factroial ncm and mcn /nn+mc(n+m) oro oetrhs n-2cm m-1cn/n+m cn-2+m-1 we grba the muliple zero and one for applies algorithm to factorial dnesity for 0 and oenmn and place to find thers whne palce to fidn theers we need a find them by factorila anser then cionevrt in the value of it then sonhow by the probsbility to come 2 that will happens 1 meAns simgle 1 or 0 then 23 mrans 24 zero and 23 2 yhen numbrr to make 23 to benprobabilitu to change in bit by circuit by both functions how many ones and how many 0 0 address rotation to doen 24 in it postions probability what position hou eant to put zero which position you wang to put 1 position probabilitu meand second ssme as it aboves hete whatnptoability brings its brings 3*1 matroces to put 00 0 0 0 same wigh 4 0 000 for 1 1111 then wr make bronabiltiy of memory posotion yo bring so 1 comes on first placd in above three or above 4 from fourty like then it providrbdensoty that convert on fdnsity it hoe much 1 snd 0 so so omage fourty four plavce to thirf placde fourt fortu four from 26 placr then tpgsl so wr put bu probsbilty percdntage to change ghemm kn numbdr for on position to multiple positions all 0 and ,1 got caught put inmatricrx then clssfication of matrives position to give them 12 position to come 1 22 c1 12 c#2 1 ions now for 1 numer come on twelve probabilty in per etzhe and then 0 by percentage to hundrrd then allot ment og bit yheres its rbng br gng but for multiple dpin it happpens by now n cm-20 m meandms we factorise it in the n and m factorial in n zero selectipn in m 1 selection values by by 2k-1or 2k c total n1+n2 them value put as gtab as now which wll be high iyt take place now its in now for factorial teo then for factorial 3 fldensitu spin then fourth spin then sixth spin now now symmetrical to choose multiple or again probslism data for place ad perntage and percetaile radius rate how it would works:--> to genrate binary we have function to like 1 order factroial 1 factria;l 2 2.1 factroial 3 3.2.1 codnese alll values variables this is multiple comes its come vectro directions of spin spin roatetd with facrtorial 3 means 6 palce 4.3.21. for 4 24 ositon 1 2 6 24 120 that comes values means a factroial n si comin in teh spin of it it comes ame as 2pie 4pie 6 pie 8pie we get omega over theres sowe got teh angular velcity sowe reahc to oemga so for 1 2 3 4 5 6 7 8 9 10 omega is the angualr velicity euqivalent f(f(n.2pie/fact n,epow cos pie/2 -1),f(fact m.2pie/factm ,epow sin pie/2/e))all zero oe si grab by then so we diretcly by oemga print 1 and 0 we got the nth oemga of it then we reduce factn-1/npie omenag grabs here we take neutral time then angualr velicty we get then refres alll clasifction happens withn spin speeed now what to do heres heres w eanguala 1 and 0 so hoiw create angualr 0 and one more we put then 1 21. 3.2.1. 4.3.2.1 5.4.3.2.1 fatcrial ciruclations in minimal angular velcity anser od 0 and 1 it grabs 0000000000000000 11111111111111111111111111111 noo palce them we we doe for one qunatom rndg prndg algorithm steps :--> ff(n.2pie/factr n,epow cos pie/2 -1) ff(factr m.2pie/factm ,epow sin pie/2/e here arrancgemtn function to muitle to acoocridn like cos cos cos cos cos sin sin cos cos sine sine but its wokrs by probability f(f(n.2pie/factr n(amgular velocity),epow cos npie/2 -1,epow sin npie/2/e),f(factr m.2pie/factr m ,epow sin npie/2/e,epow cos npie/2 -1)) then we socket it to porbaility n,m total number to come 2kcm-13 2kcn-15/2kcm-13+n-15 so zero comes to this ways m-13 comes to take for zeor singel zero then convetr in eprcnetage for zero m and n for 1 l and h and about 2k is the taotal angalr consider so 0 percnetgae devide by hundered percnetgse comes which take high it take firs palxce anotehr will belft tor 0 right and lefts so ths so we get what by thsi 0 and 1 placmemnt